|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
On the Minimization of Tree-Type Universal Logic Circuits
November 1975 (vol. 24 no. 11)
pp. 1110-1113
| ASCII Text | x | ||
| C.C. Cheung, R.W. Ehrich, "On the Minimization of Tree-Type Universal Logic Circuits," IEEE Transactions on Computers, vol. 24, no. 11, pp. 1110-1113, November, 1975. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1975.224141, author = {C.C. Cheung and R.W. Ehrich}, title = {On the Minimization of Tree-Type Universal Logic Circuits}, journal ={IEEE Transactions on Computers}, volume = {24}, number = {11}, issn = {0018-9340}, year = {1975}, pages = {1110-1113}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1975.224141}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - On the Minimization of Tree-Type Universal Logic Circuits IS - 11 SN - 0018-9340 SP1110 EP1113 EPD - 1110-1113 A1 - C.C. Cheung, A1 - R.W. Ehrich, PY - 1975 KW - Chain decomposition KW - Shannon decomposition KW - universal logic module. VL - 24 JA - IEEE Transactions on Computers ER - | |||
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.
Index Terms:
Chain decomposition, Shannon decomposition, universal logic module.
Citation:
C.C. Cheung, R.W. Ehrich, "On the Minimization of Tree-Type Universal Logic Circuits," IEEE Transactions on Computers, vol. 24, no. 11, pp. 1110-1113, Nov. 1975, doi:10.1109/T-C.1975.224141
Usage of this product signifies your acceptance of the Terms of Use.