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 :
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).; Circuit synthesis; Design automation; Integrated circuit interconnections; Logic arrays; Logic circuits; Logic design; Logic devices; Multiplexing; Pins; Switching circuits; 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).;
