Some Studies on the Problem of Three-level NAND Network Synthesis
- 1 December 1967
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 6 (6) , 547-572
- https://doi.org/10.1080/00207176708921824
Abstract
The present paper is concerned with the problem of three-level economic NAND synthesis of general Boolean functions. It is shown that a. given Boolean function is first decomposed into a set of sub-functions, called φ functions. From a study of the properties of φ functions a method is finally suggested for three-level synthesis of Boolean functions with a fewer number of NAND gates. A method of finding the minimal three-level NAND solution for a given irredundant prime implicant cover of any Boolean function is also suggested.Keywords
This publication has 3 references indexed in Scilit:
- The Minimization of TANT NetworksIEEE Transactions on Electronic Computers, 1967
- A Synthesis of Combinational Logic with NAND or NOR ElementsIEEE Transactions on Electronic Computers, 1965
- Direct Determination of all the Minimal Prime Implicant Covers of Switching Functions†Journal of Electronics and Control, 1964