Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
EYSSELT, M.
Originální název
The Design of the Factored TANT and TONT Networks
Anglický název
Druh
Stať ve sborníku mimo WoS a Scopus
Originální 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.
Anglický abstrakt
Klíčová slova
Boolean algebra, minimal set of gates, TANT networks, TONT networks
Klíčová slova v angličtině
Autoři
Vydáno
01.01.1997
Nakladatel
unknown
Místo
April 28-30, Hradec nad Moravicí
ISBN
80-85988-18-6
Kniha
Proceedings of the 31st Spring International Conference MOSIS'97
Strany od
177
Strany do
182
Strany počet
6
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" }