论文部分内容阅读
针对目前将逻辑函数从AND/OR形式转化成固定极性Reed-Muller(FPRM)过程中存在的不足,通过引入乘积项关于极性的位互斥运算,该文提出一种基于乘积项互斥运算的FPRM转换方法。该方法只需要对互斥运算后的乘积项进行展开,就可以得到对应极性下的FPRM的表示形式,省去了列表法中相同乘积项的搜索和删除过程。提出的算法用C语言编程实现,并用MCNC标准电路进行测试。实验结果表明所提算法在处理输入变量个数较大的电路时运算速度更快,并且算法对待处理电路的极性不敏感。
Aiming at the shortcomings of converting the logic function from the AND / OR form to the fixed polarity Reed-Muller (FPRM), by introducing the bit-exclusive operation of the product term about the polarity, FPRM conversion method of operation. The method only needs to expand the product term after the exclusive operation, and can obtain the representation of FPRM under the corresponding polarity, eliminating the search and deletion process of the same product term in the list method. The proposed algorithm is implemented in C language and tested using MCNC standard circuits. Experimental results show that the proposed algorithm is faster in processing circuits with larger input variables, and the algorithm is insensitive to the polarity of circuits to be processed.