Issue No.05 - May (1969 vol.18)
A decomposition and reconstruction approach for synthesizing an arbitrary Boolean function with a minimum number of threshold logic elements connected by feedforward paths only is presented. Attention is mainly focused on cascade-type realizations. The approach has the advantage that near-minimal solutions are readily derived. An estimate of how closely the minimality has been approached is obtainable in this method. The method has been successfully applied by the authors to Boolean functions of 5 and 6 variables.
Functional inputs, matching conditions, minimal forms, multigate network, near-minimal solutions, p-realizable, reduced functions, synthesizing, threshold gates.
D. Basu, S. Ghosh, "Multigate Synthesis of General Boolean Functions by Threshold Logic Elements", IEEE Transactions on Computers, vol.18, no. 5, pp. 451-456, May 1969, doi:10.1109/T-C.1969.222684