Two-Comparable Prime Implicants and Canonical Switching Functions.
Abstract
This paper shows that by using a special partial ordering on binary vectors, the set of prime implicants of a canonical (two-comparable) switching function can be easily reduced to a set of two-comparable prime implicants that imply (under the two-comparability) the deleted prime implicants. A rudimentary algorithm is presented for actually accomplishing this reduction. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1974
- Accession Number
- ADA014639
Entities
People
- James H. Starr
- V. Joseph Bowmann
Organizations
- Carnegie Mellon University