Simplified Decomposition of Boolean Functions
- 1 October 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-25 (10) , 1033-1044
- https://doi.org/10.1109/tc.1976.1674544
Abstract
The object of this paper is the presentation of a theory of decomposition of Boolean functions having the following properties: 1) ease of understanding and application without previous decomposition theory background; 2) flexibility of application to meet varying logic design criteria; 3) suitability of both numerical calculation and chart techniques; and 4) reduction in the number and complexity of calculations required to achieve decomposition.Keywords
This publication has 7 references indexed in Scilit:
- A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic CircuitsIEEE Transactions on Computers, 1976
- Equational Realizations of Switching FunctionsIEEE Transactions on Computers, 1975
- On Identification of Redundancy and Symmetry of Switching FunctionsIEEE Transactions on Computers, 1971
- A Functional Canonical FormJournal of the ACM, 1959
- Minimization of Boolean Functions*Bell System Technical Journal, 1956
- The map method for synthesis of combinational logic circuitsTransactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 1953
- The Synthesis of Two-Terminal Switching CircuitsBell System Technical Journal, 1949