Universal Logic Modules and Their Applications
IEEE Transactions on Computers
On Detecting Total or Partial Symmetry of Switching Functions
IEEE Transactions on Computers
On the Design of Universal Boolean Functions
IEEE Transactions on Computers
On Identification of Redundancy and Symmetry of Switching Functions
IEEE Transactions on Computers
The universal logic block (ULB) and its application to logic design
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
Universal logic circuits and their modular realizations
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Universal Logic Modules of a New Type
IEEE Transactions on Computers
Generation of near-optimal universal Boolean functions
Journal of Computer and System Sciences
Synthesis of multiplexer network using ratio parameters and mapping onto FPGAs
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Simplified Decomposition of Boolean Functions
IEEE Transactions on Computers
On Modular Networks Satisfying the Shift-Register Rule
IEEE Transactions on Computers
Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
Journal of Computer and Systems Sciences International
| Hi-index | 14.99 |
A method of realizing arbitrary combinational switching functions with multiplexers is derived. These circuits are divided in two classes where the first allows only uncomplemented variables as control inputs and the second has unrestricted inputs. The selected inputs to each multiplexer in the first class of circuits (tree circuits) are shown to be residue functions of the output function. Using this fact, it is demonstrated that many functional properties simplify realization procedures.