摘要
n变量的逻辑函数具有2n个固定极性,而每个极性对应不同的DFRM(Dual Forms of Reed-Muller)逻辑展开式,因此极性直接影响着DFRM电路的面积和功耗。通过对DFRM逻辑展开式和极性转换算法的研究,本文成功地将遗传算法应用于DFRM逻辑电路最佳极性的搜索。对10个较大规模的MCNC Benchmark电路测试表明,所提算法搜索到的最佳极性相对应的DFRM电路,与极性0时的DFRM电路相比,面积和功耗的平均节省分别达到了75.0%和65.2%。
As n-variable logic function has 2n fixed polarities and each polarity corresponds to different DFRM (Dual Forms of Reed-Muller) logical expression, polarity is directly related to the area and power dissipation of DFRM circuit. By investigating the DFRM logical expression and the polarity conversion algorithm, this paper successfully applies the genetic algorithm to searching the best polarity of DFRM circuit. The results of testing ten large-scale circuits from MCNC Benchmark indicate that this algorithm is highly effective for searching the best polarity, that is, the DFRM circuits under the polarity searched by the proposed algorithm have achieved average area-saving and power-saving by 75.0% and 65.2%, resnectivelv, compared with those circuits under polarity 0.
出处
《电路与系统学报》
CSCD
北大核心
2009年第1期54-58,共5页
Journal of Circuits and Systems
基金
国家自然科学基金资助项目(60776022
60273093)
浙江省科技计划项目(2008C21166)
宁波市自然科学基金资助项目(2008A610005)
浙江省教育厅科研项目(20070859)