DocumentCode
1140230
Title
Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees
Author
Curtis, H.Allen
Issue
7
fYear
1979
fDate
7/1/1979 12:00:00 AM
Firstpage
521
Lastpage
528
Abstract
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.
Keywords
Complete and incomplete Boolean functions; NAND arrays (optimal, near-optimal, and modified); NAND collector; NAND tree circuits; irredundant covers; tree forms (partial, complete, prime and nonprime); Boolean functions; Circuit topology; Integrated circuit technology; Logic arrays; Logic circuits; Network topology; Complete and incomplete Boolean functions; NAND arrays (optimal, near-optimal, and modified); NAND collector; NAND tree circuits; irredundant covers; tree forms (partial, complete, prime and nonprime);
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1979.1675398
Filename
1675398
Link To Document