Simplified Decomposition of Boolean Functions
Curtis · IEEE Transactions on Computers · 1976
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.