ULM Implicants for Minimization of Univers Logic Module Circuits
- 1 May 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-26 (5), 417-424
- https://doi.org/10.1109/tc.1977.1674858
Abstract
In this paper a method is developed for circuit minimization using the universal logic modules (ULM's) of Yau and Tang. This objective is obtained by using an extension of prime implicants termed ULM implicants. Each ULM implicant implies one possible saving of a module in the tree structure implementing a function. The method is developed for the ULM(l) and an extension to the higher order ULM(p) is discussed.Keywords
This publication has 11 references indexed in Scilit:
- On the Minimization of Tree-Type Universal Logic CircuitsIEEE Transactions on Computers, 1975
- Reconfiguration for Repair in a Class of Universal Logic ModulesIEEE Transactions on Computers, 1974
- Optimal and Near-Optimal Universal Logic Modules with Interconnected External TerminalsIEEE Transactions on Computers, 1973
- Some Characteristics of Universal Cell NetsIEEE Transactions on Computers, 1973
- Universal Logic Modules of a New TypeIEEE Transactions on Computers, 1972
- On the Design of Universal Boolean FunctionsIEEE Transactions on Computers, 1971
- Generation of near-optimal universal Boolean functionsJournal of Computer and System Sciences, 1970
- Universal Logic Modules and Their ApplicationsIEEE Transactions on Computers, 1970
- Modular Tree StructuresIEEE Transactions on Computers, 1968
- Universal logic circuits and their modular realizationsPublished by Association for Computing Machinery (ACM) ,1968