Skip Navigation

The Computer Journal 1979 22(3):251-255; doi:10.1093/comjnl/22.3.251
© 1979 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lotfi, Z. M.
Right arrow Articles by Tosser, A. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Minimising the NAND-NOR-XOR network of modulo 2 sum of boolean products

Z. M. Lotfi * and A. J. Tosser *

Universite of Nancy I, Laboratoire d'Electronique CO 140, Nancy Cedex, France

Properties of the exclusive-OR (XOR) gate are used in order to determine the minimum realisation cost of logical functions written as a modulo 2 sum of minterms (factorised or not). Saving of NAND and NOR gates are tabulated. Extended results about opportune type of factoring are thus known.

Les propriétés de l'opérateur OU-exclusif permettent de déterminer le coût minimal de réalisation de fonctions logiques écrites sons forms d'une somme modulo 2 de mintermes (factorisés ou non). Les nombres de portes NAND et NOR économisées sont tabulés et fournissent des renseignements étendus sur le type de factorisation qu'il est opportun de réaliser.

Received September 1977.

* Université of Nancy I, Laboratoire d'Electronique CO 140, 54037 Nancy Cedex, France


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.