A Survey of Microcellular Research
Journal of the ACM (JACM)
A programming language
IEEE Transactions on Computers
Minimization over Boolean graphs
IBM Journal of Research and Development
Unateness Properties of and-Exclusive-or Logic Circuits
IEEE Transactions on Computers
Reed-Muller Like Canonic Forms for Multivalued Functions
IEEE Transactions on Computers
A Note on Minimal Reed-Muller Canonical Forms of Switching Functions
IEEE Transactions on Computers
A Theory of Galois Switching Functions
IEEE Transactions on Computers
Boolean Differential Calculus and its Application to Switching Theory
IEEE Transactions on Computers
Efficient Function Implementation for Bit-Serial Parallel Processors
IEEE Transactions on Computers
Easily Testable Realizations ror Logic Functions
IEEE Transactions on Computers
On generalized Reed-Muller expansions
IEEE Transactions on Computers
| Hi-index | 15.01 |
This paper is an attempt to develop minimization algorithms for switching circuits based on Reed-Muller canonic forms. In particular, algorithms are presented for obtaining minimal modulo 2 or complement modulo 2 sum-of- products (or sums) expressions of any arbitrary single-output or multiple-output switching function with fixed polarities of the input variables.