AN ACCOUNT OF THE PARTIAL SYMMETRY OF BOOLEAN FUNCTIONS IN THE SYNTHESIS OF LOGIC CIRCUITS,

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

Abstract:

Some properties of partially symmetric Boolean functions are studied and an algorithm is proposed for recognition of their partial symmetry that is suitable for realization on a general-purpose digital computer. By the example of the cascade method, it is shown that taking into account the partial symmetry of Boolean functions makes it possible to reduce the set of decisions in the synthesis of logic circuits. Author

Author(s):
Belyavskaya, G. B. ; Pecherskii, Yu. N.
Author Organization(s):
FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO
Supplementary Note:
Edited machine trans. of mono. Teoriya Diskretnykh Avtomatov (Theory of Discrete Automata), Riga, 1967 p51-54, by Edwin P. Pentecost.
Annotation:
An account of the partial symmetry of boolean functions in the synthesis of logic circuits--Translation.
Pagination:
0010

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
FTD-MT-24-394-69
Project Number(s):
FTD-6050205
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*SPECIAL FUNCTIONS(MATHEMATICS), *LOGIC CIRCUITS, MATHEMATICAL LOGIC, SYNTHESIS, DIGITAL COMPUTERS, COMPUTER LOGIC, THEOREMS, USSR
Field(s)/Group(s):
Theoretical Mathematics, Computer Hardware
Keyword(s):
*BOOLEAN FUNCTIONS, SYMMETRIC FUNCTIONS, TRANSLATIONS
Report Date:
1970 Jan 12