Detail publikace

The Design of the Factored TANT and TONT Networks

EYSSELT, M. The Design of the Factored TANT and TONT Networks. Proceedings of the 31st Spring International Conference MOSIS'97. April 28-30, Hradec nad Moravicí: unknown, 1997. p. 177-182. ISBN: 80-85988-18-6.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Eysselt Miloš, Ing., CSc.
Klíčová slova

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

Abstrakt

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.

Rok
1997
Strany
177–182
Sborník
Proceedings of the 31st Spring International Conference MOSIS'97
ISBN
80-85988-18-6
Vydavatel
unknown
Místo
April 28-30, Hradec nad Moravicí
BibTeX 
@inproceedings{BUT192204,
  author="Miloš {Eysselt}",
  title="The Design of the Factored TANT and TONT Networks",
  booktitle="Proceedings of the 31st Spring International Conference MOSIS'97",
  year="1997",
  pages="177--182",
  publisher="unknown",
  address="April 28-30, Hradec nad Moravicí",
  isbn="80-85988-18-6"
}
Nahoru