Simplified Decomposition of Boolean Functions

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.

[1]  Frederic J. Mowle,et al.  A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic Circuits , 1976, IEEE Transactions on Computers.

[2]  Stephen S. Yau,et al.  On Identification of Redundancy and Symmetry of Switching Functions , 1971, IEEE Transactions on Computers.

[3]  M. Karnaugh.  The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[4]  Frank M. Brown.  Equational Realizations of Switching Functions , 1975, IEEE Transactions on Computers.

[5]  E. McCluskey.  Minimization of Boolean functions , 1956 .

[6]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[7]  H. Allen Curtis.  A Functional Canonical Form , 1959, JACM.