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. 

Citations

Publications citing this paper.
Showing 1-5 of 5 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Universa Ilogic modules with still fewer external interconnections

Y. N. Patt
Proc. Fourth Hawaii Int. Conf. System Science, Jan. 1971, pp. 696-697. • 1971
View 1 Excerpt

Universal Logic Modules and Their Applications

IEEE Transactions on Computers • 1970
View 1 Excerpt

Synthesis of universal logic modules

S. S. Yau, M. Orsic
Proc. Third Annu. Princeton Conf. Information Science and Systems, 1969, pp. 498-501. • 1969

Universal logic circuits and their modular realizations

AFIPS Spring Joint Computing Conference • 1968
View 2 Excerpts

The synthesis of two-terminal switching circuits

C. E. Shannon
Bell Syst. Tech. J., vol. 28, pp. 59-98, Jan. 1949. • 1949
View 2 Excerpts

Similar Papers

Loading similar papers…