摘要
针对多输出布尔函数,给出一种求解混合极性Reed-Muller(MPRM)的系数矩阵变换算法。以MPRM中的乘积项数为化简标准,采用穷举策略进行极性空间搜索,求解最优MPRM。在MCNC和ISCAS基准电路上的测试结果表明,与采用列表技术相比,该系数矩阵变换算法能平均缩短55.8%的最优MPRM求解时间。
An algorithm based on coefficient matrix transformation for computing Mixed Polarity Reed-Muller（MPRM） expansions of Boolean fimctions with multiple outputs is proposed. The optimal MPRM is solved by taking the number of product terms in MPRM as minimization criterion and exercising exhaustive strategy for polarity space exploring. The proposed method is used to solve the optimal MPRM of MCNC and ISCAS benchmarks, and compared with the method using tabular technique, test results show that the proposed coefficient matrix transformation algorithm achieves 55.8% performance improvement on average for optimal MPRM solving.
出处
《计算机工程》
CAS
CSCD
2012年第22期255-259,共5页
Computer Engineering
基金
江西省教育厅科技基金资助项目(GJJ10538
GJJ11178)
江西省普通高等学校重点学科建设基金资助项目
