A Quasi Prime Implicant Network Realization for Logic Functions.
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1971
- Accession Number
- AD0720397
Entities
People
- Benjamin M. Lin
- John P. Robinson
Organizations
- University of Iowa