三值FPRM电路极性间转换算法及其在面积优化中的应用  

Ternary FPRM circuit conversion algorithm between polarities and its application in area optimization

作　　者：孙飞[1] 汪鹏君[1] 俞海珍[1] 

机构地区：[1]宁波大学电路与系统研究所,浙江宁波315211

出　　处：《浙江大学学报（理学版）》2014年第1期43-48,共6页Journal of Zhejiang University（Science Edition）

基　　金：国家自然科学基金资助项目(61234002;61076032);浙江省自然科学基金资助项目(Z1111219)

摘　　要：通过对三值FPRM(Fixed-polarity Reed-Muller)展开式和四值列表技术的研究,提出了一种三值FPRM电路极性间转换算法,并将其应用于电路面积优化.首先根据四值RM(Reed-Muller)逻辑多项式系数的计算方法,推导出三值FPRM展开式极性间系数转换算法;然后利用该算法,结合三值模代数特点以及电路面积估计模型,沿非循环格雷码极性遍历路径进行三值FPRM电路面积最佳极性搜索,得到面积最优的FPRM电路.最后对8个MCNC基准电路进行测试,结果表明:与0极性Reed-Muller电路相比,三值FPRM电路的面积平均减少56.2%.Based on the research of ternary FPRM（Fixe＆polarity Reed-Muller） expansions and quaternary tabular tech- niques, a ternary FPRM circuit conversion algorithm between polarities is proposed and applied to the area optimization. Firstly, according to the calculation method of the quaternary RM（Reed-Muller） polynomial coefficients, the ternary FPRM expansion coefficients between polarities conversion algorithm is derived. Secondly, on the basis o{ this algorithm and com- bined with the characteristics of ternary modulo algebraic and the area estimation model, the best polarity of the minimum area of ternary FPRM circuits is found following the polarity traversal path of acyclic-gray code. Finally, the method was used for solving eight MCNC benchmarks, and the results show that the area of ternary FPRM circuits has achieved average saving 56.2 % in comparison with those Reed-Muller circuits under polarity 0.

关 键 词：三值FPRM 极性间转换 面积优化 格雷码 极性搜索 

分 类 号：TN79[电子电信—电路与系统]