Abstract：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.
汪鹏君, 汪迪生, 蒋志迪, 张会红. 基于PSGA算法的ISFPRM电路面积与功耗优化[J]. 电子学报, 2013, 41(8): 1542-1548.
WANG Peng-jun, WANG Di-sheng, JIANG Zhi-di, ZHANG Hui-hong. Area and Power Optimization of ISFPRM Circuits Based on PSGA Algorithm. Chinese Journal of Electronics, 2013, 41(8): 1542-1548.
[1] Zhang H H,Wang P J,Gu X S.Area optimization of fixed-polarity Reed-Muller circuits based on niche genetic algorithm[J].Chinese Journal of Electronics,2011,20(1):27-30.[2] Yang M,Wang L L,Tong J R,et al.Techniques for dual forms of Reed-Muller expansion conversion[J].Integration,the VLSI Journal,2008,41(1):113-122.[3] V Geetha,N Devarajan,Pn Neelakantan.OR-Bridging fault analysis and diagnosis for exclusive-OR sum of products Reed-Muller canonical circuits[J].European Journal of Scientific Research,2012,71(4):482-489.[4] 潘张鑫,陈偕雄,阮谢永.任意极性或-符合型易测性网络及测试集[J].浙江大学学报(工学版),2008,42(3):407-411. Pan Z X,Chen X X,Ruan X Y.Easily testable network of arbitrary polarity OR-Coincidence type and test sets[J].Journal of Zhejiang University(Engineering Science),2008,42(3):407-411.(in Chinese)[5] L Mckenzie,A E A Almaini,J F Miller,et al.Optimization of Reed-Muller logic functions[J].International Journal of Electronics,1993,75(3):451-466.[6] D Debnath,T Sasao.Exact minimization of FPRMs for incompletely specified functions by using MTBDDs[J].IEICE Transactions on Fundamentals of Electronics,Communications and Computer Science,2005,88(12):3332-3341.[7] M K Habib.A new approach to generate fixed-polarity Reed-Muller expansions for completely and incompletely specified functions[J].International Journal of Electronics,2002,89(11):845-876.[8] B Al Jassani,N Urquhart,A E A Almaini,Minimization of incompletely specified mixed polarity reed muller functions using genetic algorithm[A].Proceedings of the 3th International Conference on Signals,Circuits and Systems[C].Tunis:IEEE,2009.1-6.[9] 杨萌,徐红英,A E A Almaini.针对混合极性的并行表格技术的遗传算法[J].计算机辅助设计与图形学学报,2011,23(11):1938-1943. Yang M,Xu H Y,A E A Almaini.Optimization of mixed polarity functions using genetic algorithm with parallel tabular technique[J].Journal of Computer-Aided Design & Computer Graphics,2011,23(11):1938-1943.(in Chinese)[10] 汪鹏君,李辉,等.量子遗传算法在多输出Reed-Muller逻辑电路最佳极性搜索中应用[J].电子学报,2010,38(5):1058-1063. Wang P J,Li H,et al.Application of quantum genetic algorithm in searching for best polarity of multi-output reed-muller logic circuits[J].Acta Electronica Sinica,2010,38(5):1058-1063.(in Chinese)[11] 张顶学,关治洪,刘新芝.基于捕食搜索策略的遗传算法研究[J].计算机应用研究,2008,25(4):1006-1007. Zhang D X,Guan Z H,Liu X Z.Genetic algorithm based on predatory search strategy[J].Application Research of Computers,2008,25(4):1006-1007.(in Chinese)[12] 吴训威,卢仰坚,等.基于冗余抑制技术的低功耗组合电路设计[J].电子学报,2002,30(5):672-675. Wu X W,Lu Y J,et al.Design of low power combinational circuits based on redundancy-restraining technique[J].Acta Electronica Sinica,2002,30(5):672-675.(in Chinese)[13] Wang P J,Lu J G,Chen K,et al.Low power polarity conversion based on the whole annealing genetic algorithm[J].Jour-nal of Semiconductors,2008,29(2):298-303.
2013, Vol. 41 
