The Community for Technology Leaders
Green Image
Issue No. 04 - April (1971 vol. 20)
ISSN: 0018-9340
pp: 459-461
ABSTRACT
Using as logic modules two-input one-output arbitrary logic gates, this note considers the problem of the longest chain (number of levels) in a tree-type interconnection realizing a Boolean function of n variables. Specifically, we are interested in the minimum number of levels L(n) by which we can constructively realize all Boolean functions of n variables. It was previously shown that L(n)=n for n=3, 4 and it was so conjectured for n= 5; in this note we are able to show that this holds for n=5, 6, 7, 8.
INDEX TERMS
Computational complexity, conjuctive decomposition, realization delay, switching functions.
CITATION

D. Muller and F. Preparata, "On the Delay Required to Realize Boolean Functions," in IEEE Transactions on Computers, vol. 20, no. , pp. 459-461, 1971.
doi:10.1109/T-C.1971.223266
203 ms
(Ver 3.3 (11022016))