arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.01265cs.NEcs.AI
收藏

使用进化算法基于通用门实现有限状态机的最优综合

Optimal Synthesis of Finite State Machines with Universal Gates using Evolutionary Algorithm

University of Engineering and Technology, Peshawar(白沙瓦工程技术大学)

Noor Ullah, Khawaja M. Yahya, Irfan Ahmed

AI总结:

本研究提出一种基于笛卡尔遗传编程的有限状态机综合优化方法,旨在减少芯片面积与电路成本,在MCNC91基准电路上平均实现近30%的门数量减少,并分析了参数对进化过程的影响。

摘要:

本工作提出了一种用于有限状态机综合的优化方法,重点在于减少芯片面积和电路成本。使用笛卡尔遗传编程对来自MCNC91基准电路的有限状态机列表进行了进化。平均而言,实现了近30%的门总数减少。本文还讨论了某些参数对进化过程的影响。

英文摘要:

This work presents an optimization method for the synthesis of finite state machines. The focus is on the reduction in the on-chip area and the cost of the circuit. A list of finite state machines from MCNC91 benchmark circuits have been evolved using Cartesian Genetic Programming. On the average, almost 30% of reduction in the total number of gates has been achieved. The effects of some parameters on the evolutionary process have also been discussed in the paper.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑