跳到主要导航 跳到搜索 跳到主要内容

Optimization of best polarity searching for mixed polarity reed-muller logic circuit

  • Beihang University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

At present, although genetic algorithm (GA) is widely used in best polarity searching of MPRM logic circuit, there are few literatures pay attention to the polarity conversion sequence of the polarity set waiting for evaluation. An improved best polarity searching approach (IBPSA) based on GA is presented to optimize the polarity conversion sequence of polarity set and speed up the best polarity searching of MPRM logic circuits. In addition, we present an improved nearest neighbor (INN) to obtain the best polarity conversion sequence of the polarity set waiting for evaluation in each generation of GA and apply elitism strategy to IBPSA to guarantee its global convergence. Our proposed IBPSA is implemented in C and a comparative analysis has been presented for MCNC benchmark circuits. The experimental results show that the IBPSA can greatly reduce the time of best polarity searching of MPRM logic circuits compared to the approaches neglecting polarity conversion sequence.

源语言英语
主期刊名Proceedings - 28th IEEE International System on Chip Conference, SOCC 2015
编辑Thomas Buchner, Danella Zhao, Karan Bhatia, Ramalingam Sridhar
出版商IEEE Computer Society
275-280
页数6
ISBN(电子版)9781467390934
DOI
出版状态已出版 - 12 2月 2016
活动28th IEEE International System on Chip Conference, SOCC 2015 - Beijing, 中国
期限: 8 9月 201511 9月 2015

出版系列

姓名International System on Chip Conference
2016-February
ISSN(印刷版)2164-1676
ISSN(电子版)2164-1706

会议

会议28th IEEE International System on Chip Conference, SOCC 2015
国家/地区中国
Beijing
时期8/09/1511/09/15

指纹

探究 'Optimization of best polarity searching for mixed polarity reed-muller logic circuit' 的科研主题。它们共同构成独一无二的指纹。

引用此