Publication detail

The Design of the Factored TANT and TONT Networks

EYSSELT, M.

Original Title

The Design of the Factored TANT and TONT Networks

Type

article in a collection out of WoS and Scopus

Language

English

Original 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.

Keywords

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

Authors

EYSSELT, M.

Released

1. 1. 1997

Publisher

unknown

Location

April 28-30, Hradec nad Moravicí

ISBN

80-85988-18-6

Book

Proceedings of the 31st Spring International Conference MOSIS'97

Pages from

177

Pages to

182

Pages count

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"
}