CAJ | 학술논문

针对已有的列表技术在极性转换中只能解决中小规模电路的问题，提出一种基于不相交乘积项列表技术的快速转换算法。首先将待处理的逻辑函数表示为不相交乘积项之和形式；然后通过对已有的基于最大项的列表技术进行分析和改进，使得改进后的列表技术可以实现将逻辑函数从不相交乘积项的AND/OR形式向固定极性XNOR/OR形式的Reed‐Muller逻辑转化。文中算法用C编程实现，并用MCNC标准电路进行测试。实验结果表明，该算法可以快速实现大电路的极性转换，并且具有运算速度对电路的输入变量数不敏感的特点。
침대이유적렬표기술재겁성전환중지능해결중소규모전로적문제，제출일충기우불상교승적항렬표기술적쾌속전환산법。수선장대처리적라집함수표시위불상교승적항지화형식；연후통과대이유적기우최대항적렬표기술진행분석화개진，사득개진후적렬표기술가이실현장라집함수종불상교승적항적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 .