【摘要】 本文将Kronecker矩阵乘积作为一种有效的工具,对开关函数的表示及各种变换进行了讨论,特别是在变量取固定极性时,对函数的Reed-Muller展开的最小化进行了研究,并给出了相应的计算机程序。讨论表明:应用Kronecker矩阵乘积的算法优于以前的同类工作,并且与作者在最近提出的利用b_j图的最小化程序相辅而成为研究函数的Reed-Muller展开及最小化的新的手段。更多还原

【Abstract】 In this paper, an expression of switching functions and various transformations in terms of Kronecker product is discussed. Particularly, the minimization of functions based upon Reed-Muller expansion under fixed polarities is considered and the corresponding computer program is derived. The discussion shows that this algorithm using Kronecker product has advantages over previous ones. And it together with minimization by means of bj Map currently proposed by the author provides a new method for studying Reed-Muller expansion of functions and their minimization.更多还原