%0 Journal Article
%T Coefficient matrix based polarity conversion method and itsapplication to MPDRM minimization<br>基于系数矩阵的极性转换方法及其在MPDRM化简中的应用
%A BU Deng-li
%A WEI Wei
%A GUO Ming
%A <br>卜登立
%A 魏　韡
%A 郭　鸣
%J 计算机应用研究
%D 2013
%I 
%X This paper proposed a coefficient matrix based method for polarity conversion of MPDRM for multi-output Boolean function systems. The method improved the speed of polarity conversion through extracting sub-matrices from the coefficient matrix and simplifying the expensive matrix operations to XNOR operation between the extracted sub-matrices by analyzing the matrix operations needed for polarity conversion using transform matrix. On the basis of the proposed polarity conversion met-hod, this paper presented an exact minimization algorithm for MPDRM. This algorithm made the polarity conversion occur between MPDRMs with adjacent polarity numbers by using Gray code strategy, and obtained the minimized MPDRM by taking the number of sum terms in MPDRM as primary minimization criterion and the number of literals in MPDRM as secondary minimization criterion through polarity space exploration using exhaustive strategy. The experimental results show that, more optimal MPDRM can be obtained by using the number of literals in MPDRM as secondary minimization criterion. Compared with the tabular technique based polarity conversion method, the proposed coefficient matrix based polarity conversion method can reduce the time consumed by exact minimization process for MPDRM by 49. 5%.
%K 布尔函数系统
%K 混合极性对偶Reed-Muller
%K 系数矩阵
%K 极性转换
%K 精确化简
%K 格雷码
%K 穷举策略
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=57319E4289F4438F992E445D22E7D908&yid=FF7AA908D58E97FA&vid=340AC2BF8E7AB4FD&iid=38B194292C032A66&sid=C81F81170838C444&eid=849A5A9D85EBE6D4&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=10