A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic Circuits

@article{Tabloski1976ANE,
title={A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic Circuits},
author={Theodore F. Tabloski and Frederic J. Mowle},
journal={IEEE Transactions on Computers},
year={1976},
volume={C-25},
pages={684-702}
}

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.