A Quasi Prime Implicant Network Realization for Logic Functions.

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

Abstract:

A quasi prime implicant network is defined for Boolean functions. With the length of test set as a parameter to be minimized, a three-level logic network realization procedure is presented. Test-length reduction and input cost saving in the quasi prime implicant network realization over the minimum-gate two-level realization for some coverable functions are given. Author

Author(s):
Lin, Benjamin M. ; Robinson, John P.
Author Organization(s):
IOWA UNIV IOWA CITY DEPT OF MATHEMATICS
Descriptive Note:
Technical rept.,
Supplementary Note:
Report on the Theory and Application of Automation Theory.
Pagination:
0020

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
THEMIS-UI-TR-37
Contract/Grant Number(s):
N00014-68-A-0500
Project Number(s):
THEMIS-432
 Subject Terms
Joint Capability Areas:
JCA_6.1_Information Transport; JCA_6_Net Centric
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*LOGIC CIRCUITS, MATHEMATICAL LOGIC, DIGITAL SYSTEMS, GATES(CIRCUITS), SWITCHING CIRCUITS, MATRICES(MATHEMATICS), SPECIAL FUNCTIONS(MATHEMATICS), COMPUTER LOGIC
Field(s)/Group(s):
Computer Hardware
Keyword(s):
BOOLEAN FUNCTIONS, PRIME IMPLICANTS, THEMIS PROJECT
Report Date:
1971 Feb 01