Publication Details

The Design of the Factored TANT and TONT Networks

EYSSELT Miloš. The Design of the Factored TANT and TONT Networks. In: Proceedings of the 31st Spring International Conference MOSIS'97. April 28-30, Hradec nad Moravicí: unknown, 1997, pp. 177-182. ISBN 80-85988-18-6.
Type
conference paper
Language
english
Authors
Eysselt Miloš, Ing., CSc. (DCSE FEECS BUT)
Keywords

Boolean algebra, minimal set of gates, TANT networks, TONT networks

Abstract

This paper presents a summary of tricks in expression type models, which make to reduce the hardware of TANT (NAND gates only) or TONT (NOR gates only) networks possible in favourable cases of the spreading of not-variables in terms of sum-of-products or product-of-sums expressions of Boolean functions. The delay of signals stays the same. The whole arrangement of expressions is formalized by the original way into the uniform procedure for both types of logic elements. The formalization of the tricks opens the easy way to implement this method into the program model, which aids the design on standard personal computers.

Published
1997
Pages
177-182
Proceedings
Proceedings of the 31st Spring International Conference MOSIS'97
Conference
31st Spring International Conference Modelling and Systems Simulation MOSIS'97, Hradec nad Moravicí, CZ
ISBN
80-85988-18-6
Place
April 28-30, Hradec nad Moravicí, CZ
BibTeX 
@INPROCEEDINGS{FITPUB5731,
   author = "Milo\v{s} Eysselt",
   title = "The Design of the Factored TANT and TONT Networks",
   pages = "177--182",
   booktitle = "Proceedings of the 31st Spring International Conference MOSIS'97",
   year = 1997,
   location = "April 28-30, Hradec nad Moravic\'{i}, CZ",
   ISBN = "80-85988-18-6",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/5731"
}
Back to top