The Community for Technology Leaders
Green Image
Recently, an algorithm has been developed for deriving optimal NAND array realizations of complete Boolean functions [1]. The algorithm has two defects. It often requires a cumbersomely large amount of computations and does not handle incomplete functions. The short-cut method presented here is free from those defects.
tree forms (partial, complete, prime and nonprime), Complete and incomplete Boolean functions, irredundant covers, NAND arrays (optimal, near-optimal, and modified), NAND collector, NAND tree circuits
H.A. Curtis, "Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees", IEEE Transactions on Computers, vol. 28, no. , pp. 521-528, July 1979, doi:10.1109/TC.1979.1675398
98 ms
(Ver 3.3 (11022016))