摘要
包含r个无关项的ISFPRM(Incompletely Specified Fixed Polarity Reed-Muller)电路有2r种不同的无关项取舍,其对应的FPRM(Fixed Polarity Reed-Muller)电路结构、面积与功耗不尽相同.因此本文提出一种基于PSGA(GeneticAlgorithm Based on Predatory Search Strategy)算法的ISFPRM电路面积与功耗优化算法:首先,通过对ISFPRM展开式以及快速列表技术的透析,归纳出不同无关项取舍的ISFPRM展开式极性转换方法,得到对应的FPRM展开式;然后,估算FPRM电路的面积与功耗;最后,利用PSGA算法搜索最佳无关项取舍.实验表明,该算法与不考虑无关项的极性优化结果相比,面积与功耗均有显著节省.
There are 2r kinds of allocation of don＇t care terms for an ISFPRM（Incompletely Specified Fixed Polarity Reed-Muller） circuits with r don＇t care terms,so the area and power of corresponding FPRM（Fixed Polarity Reed-Muller） circuits are different.This paper proposes an area and power optimization algorithm based on PSGA（Genetic Algorithm Based on Predatory Search Strategy） algorithm.Firstly,through the research of ISFPRM expansions and fast tabular technique,a conversion approach of ISFPRM expansions between different allocation of don＇t care terms is generalized and the corresponding FPRM expansions are deduced.Then,the area and power of these FPRM circuits are estimated.Lastly,the best allocation of don＇t care terms is searched by PSGA algorithm.The results of experiments show that the area and power of ISFPRM circuits have obviously decreased compared with the results irrespective of don＇t care terms.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2013年第8期1542-1548,共7页
Acta Electronica Sinica
基金
国家自然科学基金(No.61076032
61234002)
浙江省自然科学基金(No.Z1111219
No.LY13F040003)
宁波市自然科学基金(No.2011A610104)
关键词
捕食遗传算法
不完全确定RM电路
面积优化
功耗优化
genetic algorithm based on predatory search strategy（PSGA） algorithm
incompletely specified fixed polarity reed-muller（ISFPRM）circuits
area optimization
power optimization
