大电路固定极性Reed-Muller逻辑快速转换算法

A Fast Reed-Muller Fixed Polarity Conversion Algorithm for Large Circuits

针对已有的列表技术在极性转换中只能解决中小规模电路的问题,提出一种基于不相交乘积项列表技术的快速转换算法.首先将待处理的逻辑函数表示为不相交乘积项之和形式;然后通过对已有的基于最大项的列表技术进行分析和改进,使得改进后的列表技术可以实现将逻辑函数从不相交乘积项的AND?OR形式向固定极性XNOR?OR形式的Reed-Muller逻辑转化.文中算法用C编程实现,并用MCNC标准电路进行测试.实验结果表明,该算法可以快速实现大电路的极性转换,并且具有运算速度对电路的输入变量数不敏感的特点.

To cope with the problem that the existing tabular techniques based algorithms are unable to deal with large circuits in the polarity conversion ,a fast conversion algorithm based on disjointed products is proposed . First the logic function is expressed as the form of the sum of disjointed products . T hen by analyzing and improving the existing tabular techniques used for Reed‐M uller functions polarity conversion based on maxterms ,the proposed technique can convert the logic function from the form of sum of disjointed products into the XNOR/OR form with the fixed polarity directly . The proposed algorithm is implemented in C and tested under MCNC benchmarks .The experimental results show that ,the proposed algorithm can carry out the polarity conversion fast for large circuits , and the conversion speed is less effect with the number of circuit inputs .