使用系数矩阵变换极性转换的MPRM电路面积优化  

Area Optimization of MPRM Circuits Utilizing Coefficient Matrix Transformation Based Polarity Conversion

作　　者：卜登立[1,2] 江建慧[1] 

机构地区：[1]同济大学软件学院,上海201804 [2]井冈山大学电子与信息工程学院,吉安343009

出　　处：《计算机辅助设计与图形学学报》2013年第1期126-135,共10页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家自然科学基金(60903033)

摘　　要：为缩短布尔函数系统混合极性Reed-Muller(mixed-polarity Reed-Muller,MPRM)电路面积优化过程的时间,提出了能在任意极性值的MPRM间进行极性转换的系数矩阵变换方法.使用系数矩阵表示布尔函数系统,通过对系数矩阵进行分隔,使用置换和折叠操作完成MPRM极性转换以加快极性转换速度;在此基础上,给出了适用于较大规模MPRM电路的面积优化算法,其中使用遗传算法进行极性空间搜索,并采用基于最短个体距离的适应度计算方法进一步缩短优化过程中的极性转换时间.实验结果表明,与其他MPRM极性转换方法相比,文中方法能够提高MPRM电路面积优化的速度.In order to reduce the time consumed by area optimization of mixed-polarity Reed-Muller （MPRM） circuits for Boolean function system, a coefficient matrix transformation method for polarity conversion between MPRMs with any polarity number is proposed in the paper. The proposed method uses coefficient matrix to represent Boolean function system, and accelerates polarity conversion by using permutation and folding operations after separation of the coefficient matrix. Based on the proposed method, an area optimization algorithm for large scale MPRM circuits is presented, which takes genetic algorithm as search method for exploring polarity space and employs shortest distance between individuals based fitness calculation for further reducing the time overhead of polarity conversion during the process of area optimization. Experimental results show that, in comparison with other polarity conversion methods, the proposed method can improve the speed of area optimization process for MPRM circuits.

关 键 词：布尔函数系统 混合极性Reed-Muller 极性转换 系数矩阵变换 面积优化 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]