Issue No. 09 - September (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.537134
<p><b>Abstract</b>—Generalized Partially-Mixed-Polarity Reed-Muller (GPMPRM) expansion, a canonical subfamily of Exclusive Sum of Products (ESOP), is presented. An efficient algorithm in two-dimensional data flow is proposed for computation of the GPMPRM forms. MCNC benchmark experimental results show that the minimal GPMPRM forms of these functions, on the average, have similar number of terms to their Sum of Products (SOP) counterparts while there are many functions for which the GPMPRM circuits are much smaller.</p>
RM expansion, fixed-polarity RM expansion, Kronecker RM expansion, ESOP minimization, Gray code.
X. Zeng, N. Zhuang, H. Wu and M. Perkowski, "Generalized Partially-Mixed-Polarity Reed-Muller Expansion and Its Fast Computation," in IEEE Transactions on Computers, vol. 45, no. , pp. 1084-1088, 1996.