Accession Number:
AD0744176
Title:
New Methods of Minimizing Boolean Functions and the Creation of an Automatic Minimizer,
Descriptive Note:
Corporate Author:
FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO
Personal Author(s):
Report Date:
1972-03-20
Pagination or Media Count:
23.0
Abstract:
Any function of logic algebra can be written as a disjunctive or conjunctive perfect normal form DPNF, CPNF. Such notation in a number of cases is uneconomical because a large number of standard logic operators are necessary to synthesize it. The logic-algebra function can be represented most economically. At the present time, minimization problems are solved in the following classes negation, conjunction, and disjunction. This paper will examine a new method of minimizing the DPNF. Author
Descriptors:
Subject Categories:
- Theoretical Mathematics