Boolean matrix transforms for the minimization of modulo-2 canonical expansions
P. K. Lui, Jon C. Muzio · IEEE Transactions on Computers · 1992
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).>