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

H.A. Curtis

doi:10.1109/TC.1979.1675398

Publication
1979
Issue No. 7 - July
Abstract - Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/EndNote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by H.A. Curtis

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

July 1979 (vol. 28 no. 7)

pp. 521-528

	ASCII Text	x
	H.A. Curtis, "Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees," IEEE Transactions on Computers, vol. 28, no. 7, pp. 521-528, July, 1979.

	BibTex	x
	@article{ 10.1109/TC.1979.1675398, author = {H.A. Curtis}, title = {Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees}, journal ={IEEE Transactions on Computers}, volume = {28}, number = {7}, issn = {0018-9340}, year = {1979}, pages = {521-528}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1979.1675398}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Computers TI - Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees IS - 7 SN - 0018-9340 SP521 EP528 EPD - 521-528 A1 - H.A. Curtis, PY - 1979 KW - tree forms (partial KW - complete KW - prime and nonprime) KW - Complete and incomplete Boolean functions KW - irredundant covers KW - NAND arrays (optimal KW - near-optimal KW - and modified) KW - NAND collector KW - NAND tree circuits VL - 28 JA - IEEE Transactions on Computers ER -

H.A. Curtis

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.1979.1675398

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.

Index Terms:

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

Citation:

H.A. Curtis, "Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees," IEEE Transactions on Computers, vol. 28, no. 7, pp. 521-528, July 1979, doi:10.1109/TC.1979.1675398

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.