A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic Circuits
- 1 July 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-25 (7) , 684-702
- https://doi.org/10.1109/tc.1976.1674678
Abstract
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.Keywords
This publication has 11 references indexed in Scilit:
- Universal Logic Modules of a New TypeIEEE Transactions on Computers, 1972
- On Identification of Redundancy and Symmetry of Switching FunctionsIEEE Transactions on Computers, 1971
- On the Design of Universal Boolean FunctionsIEEE Transactions on Computers, 1971
- On Detecting Total or Partial Symmetry of Switching FunctionsIEEE Transactions on Computers, 1971
- Generation of near-optimal universal Boolean functionsJournal of Computer and System Sciences, 1970
- Universal Logic Modules and Their ApplicationsIEEE Transactions on Computers, 1970
- Universal logic circuits and their modular realizationsPublished by Association for Computing Machinery (ACM) ,1968
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming ProblemOperations Research, 1965
- A Catalog of Three-Variable Or-Invert and And-Invert Logical CircuitsIEEE Transactions on Electronic Computers, 1963
- The Synthesis of Two-Terminal Switching CircuitsBell System Technical Journal, 1949