Loading [MathJax]/extensions/MathMenu.js
Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees | IEEE Journals & Magazine | IEEE Xplore

Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees


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...Show More

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.
Published in: IEEE Transactions on Computers ( Volume: C-28, Issue: 7, July 1979)
Page(s): 521 - 528
Date of Publication: 31 July 1979

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.