This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
T.F. Tabloski, Bell Laboratories
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.
Index Terms:
Implicitly exhaustive search, logic design automation, minimization algorithm, modular logic arrays, multiplexer, multiplexer universal logic module (MULM), numerical technique, Shannon's expansion, universal logic module (ULM).
Citation:
T.F. Tabloski, F.J. Mowle, "A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic Circuits," IEEE Transactions on Computers, vol. 25, no. 7, pp. 684-702, July 1976, doi:10.1109/TC.1976.1674678
Usage of this product signifies your acceptance of the Terms of Use.