摘要
针对目前将逻辑函数从AND/OR形式转化成固定极性Reed-Muller(FPRM)过程中存在的不足,通过引入乘积项关于极性的位互斥运算,该文提出一种基于乘积项互斥运算的FPRM转换方法。该方法只需要对互斥运算后的乘积项进行展开,就可以得到对应极性下的FPRM的表示形式,省去了列表法中相同乘积项的搜索和删除过程。提出的算法用C语言编程实现,并用MCNC标准电路进行测试。实验结果表明所提算法在处理输入变量个数较大的电路时运算速度更快,并且算法对待处理电路的极性不敏感。
With the deficiency of the conversion algorithm for AND/OR forms to the Fixed Polarity Reed- Muller （FPRM） forms, an algorithm for the FPRM forms conversion from the disjointed products is proposed. By introducing the bit exclusive operator between two productions, no addi- tional steps for the same products searching and removing which are essential in the reported tabular algorithms is needed which makes the proposed algorithm can work fast and deal with large circuits. The proposed algorithm is implemented in C and tested under MCNC benchmarks. The experimental results show that the proposed algorithm can accomplish the polarity conversion for the circuits with large inputs, and the conversion speed for the different polarities is very close.
出处
《无线通信技术》
2015年第4期17-22,共6页
Wireless Communication Technology
基金
国家自然科学基金(61471211)
