On the Minimization of Tree-Type Universal Logic Circuits
- 1 November 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-24 (11), 1110-1113
- https://doi.org/10.1109/t-c.1975.224141
Abstract
The realization of arbitrary switching functions using the universal logic modules of Yau and Tang [1], [2] has the disadvantage that, in general, large trees of modules result. A decomposition theorem and an algorithm are given for reducing the size of such trees, using what is called a chain decomposition.Keywords
This publication has 5 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
- Universal Logic Modules and Their ApplicationsIEEE Transactions on Computers, 1970
- Universal logic circuits and their modular realizationsPublished by Association for Computing Machinery (ACM) ,1968