Logic design principles with emphasis on testable semicustom circuits
Logic design principles with emphasis on testable semicustom circuits
On the Complexity of Mod-2l Sum PLA's
IEEE Transactions on Computers
Journal of Electronic Testing: Theory and Applications
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Generalized Partially-Mixed-Polarity Reed-Muller Expansion and Its Fast Computation
IEEE Transactions on Computers
Exact minimization of fixed polarity Reed-Muller expressions for incompletely specified functions
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
A Multiple-Valued Reed-Muller Transform for Incompletely Specified Functions
IEEE Transactions on Computers
Reed-Muller Forms for Incompletely Specified Functions via Sparse Polynomial Interpolation
ISMVL '95 Proceedings of the 25th International Symposium on Multiple-Valued Logic
| Hi-index | 14.99 |
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).