包含无关项逻辑函数的固定极性转换

Fixed-polarity conversions for logic functions include don’t care terms

通过对Boolean逻辑和RM((Reed-Muller)逻辑的研究,针对Boolean逻辑函数SOP(Sum-of-Products)展开式中无关项取舍不确定的特点,结合快速列表技术,提出一种包含无关项逻辑函数的固定极性转换方法。该方法首先求出最小项和无关项的相关与项,然后生成最小项索引表以及无关项索引表,最后搜索无关项取舍,得到最佳固定极性RM(Fixed-Polarity Reed-Muller,FPRM)展开式。通过对10个MCNC Benchmark电路进行测试,结果表明:与不考虑无关项的极性转换方法相比,该方法能有效简化FPRM展开式。

Based on the research of Boolean logic and RM（Reed-Muller） logic,according to the feature that don’t care terms in SOP（Sum-of-Products） expansions of Boolean logic functions are not specified,in conjunction with the fast tabular technology,a fixed-polarity conversion approach for logic functions which include don’t care terms is proposed.Firstly,the relational AND terms of mini-terms and don’t care terms are deduced.Secondly,the mini-terms index table and don’t care terms index table is generated.Finally,the best allocation of don’t care terms is searched so as to get the best FPRM（Fixed-Polarity Reed-Muller） expansions.The results of experiments test on 10 MCNC Benchmark circuits show that： compared with the polarity conversion approach ignoring don’t care terms,the proposed approach can simplify the FPRM expansions.