Least operation traversal method applied in optimization of logic circuits

Huihong Zhang, Pengjun Wang, Xingsheng Gu, Jing Dai
{"title":"Least operation traversal method applied in optimization of logic circuits","authors":"Huihong Zhang, Pengjun Wang, Xingsheng Gu, Jing Dai","doi":"10.1109/ASICON.2009.5351553","DOIUrl":null,"url":null,"abstract":"In order to improve the optimization of middle and large-scale logic circuits, a heuristic inspired traversal method of circuit polarities called the least operation traversal method (LOTM) is proposed. Firstly, the polarity traversal sequence problem of fixed-polarity RM circuits is analyzed and a mathematical model of the problem is given and discussed; Secondly, the detailed realization of the LOTM is explained; finally, the method embedded in genetic algorithm is tested by 10 circuits from MCNC Benchmark. The results show that the method can significantly improve the efficiency of genetic algorithm for circuit optimization, especially for circuits with a number of inputs or complex structure1.","PeriodicalId":446584,"journal":{"name":"2009 IEEE 8th International Conference on ASIC","volume":"181 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE 8th International Conference on ASIC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASICON.2009.5351553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In order to improve the optimization of middle and large-scale logic circuits, a heuristic inspired traversal method of circuit polarities called the least operation traversal method (LOTM) is proposed. Firstly, the polarity traversal sequence problem of fixed-polarity RM circuits is analyzed and a mathematical model of the problem is given and discussed; Secondly, the detailed realization of the LOTM is explained; finally, the method embedded in genetic algorithm is tested by 10 circuits from MCNC Benchmark. The results show that the method can significantly improve the efficiency of genetic algorithm for circuit optimization, especially for circuits with a number of inputs or complex structure1.
最小运算遍历法在逻辑电路优化中的应用
为了提高大中型逻辑电路的优化性能,提出了一种启发式的电路极性遍历方法——最小运算遍历法(LOTM)。首先,分析了固定极性RM电路的极性遍历序列问题,给出了该问题的数学模型并进行了讨论;其次,阐述了LOTM的具体实现;最后,通过MCNC Benchmark的10个电路对嵌入遗传算法的方法进行了测试。结果表明,该方法可显著提高遗传算法在电路优化中的效率,尤其适用于输入数较多或结构复杂的电路1。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信