The Consensus Algorithm as Applied to Finding Prime Implicants and Covers,

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

Abstract:

The report investigates and improves upon several known methods of finding all the prime implicants of a Boolean function. These procedures are then compared on the basis of their efficiency and the number and types of operations needed to program them. Finally several ways of finding a minimal cover for the function are presented. Author

Author(s):
Emery, Mary Kay
Author Organization(s):
ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB
Pagination:
0096

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
R-578, UILU-ENG-72-2239
Contract/Grant Number(s):
DAAB07-67-C-0199, NSF-GK-15459
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
(*MATHEMATICAL LOGIC, *SPECIAL FUNCTIONS(MATHEMATICAL)), ALGEBRAS, SET THEORY, GROUPS(MATHEMATICS), THEOREMS, THESES, COMPUTER LOGIC, ALGORITHMS
Field(s)/Group(s):
Theoretical Mathematics
Keyword(s):
*BOOLEAN FUNCTIONS, BOOLEAN ALGEBRA, *PRIME IMPLICANTS
Report Date:
1972 Jul 01