Issue No. 03 - March (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.127446
<p> Fast transforms for computing modulo-2 ring-sum canonical expansions of a Boolean function are described using Kronecker products of elementary Boolean matrices. These transforms unify and generalize existing ones in the literature. Previous algorithms which employ such transforms for finding a minimal fixed polarity expansion (FPE) are reviewed, analyzed, and extended to a minimal fixed basis expansion (FBE).</p>
Boolean matrix transforms; minimization of modulo-2 canonical expansions; Boolean function; Kronecker products; elementary Boolean matrices; minimal fixed polarity expansion; minimal fixed basis expansion; Boolean functions; minimisation of switching nets.
P. Lui and J. Muzio, "Boolean Matrix Transforms for the Minimization of Modulo-2 Canonical Expansions," in IEEE Transactions on Computers, vol. 41, no. , pp. 342-347, 1992.