New Methods of Minimizing Boolean Functions and the Creation of an Automatic Minimizer,

reportActive / Technical Report | Accession Number: AD0744176 | Need Help?

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

Author(s):
Shereshevskii, N. I. ; Khoroshilskih, L. L. ; Tsygankov, Yu. I.
Author Organization(s):
FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO
Supplementary Note:
Edited trans. of Mekhanizatsiya i Avtomatizatsiya Proizvodstva (USSR) n3 p44-47 1970, by Henry Peck.
Annotation:
New Methods of Minimizing Boolean Functions and the Creation of an Automatic Minimizer--Translation.
Pagination:
0023

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
FTD-HT-23-1141-71
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
(*MATHEMATICAL LOGIC, SPECIAL FUNCTIONS(MATHEMATICAL)), ARTIFICIAL INTELLIGENCE, COMPUTER LOGIC, LOGIC CIRCUITS, OPTIMIZATION, USSR
Field(s)/Group(s):
Theoretical Mathematics
Keyword(s):
*BOOLEAN FUNCTIONS, TRANSLATIONS
Report Date:
1972 Mar 20