Fast computation of determination of the prime implicants by a novel near minimum minimization method

Authors

FATİH BAŞÇİFTÇİ
ŞİRZAT KAHRAMANLI

DOI

10.3906/elk-0904-9

Abstract

In this study proposed is an off-set-based direct-cover near-minimum minimization method for single-output Boolean functions represented in a sum-of-products form. To obtain the complete set of prime implicants including given on-cube (on-minterm), the proposed method uses off-cubes (off-minterms) expanded by this On-cube. The amount of temporary results produced by this method does not exceed the size of the off-set. To make fast computation, we used logic operations instead of standard operations. Expansion off-cubes, commutative absorption operations and intersection operations are realized by logic operations for fast computation. The proposed minimization method is tested on several different kinds of problems and benchmarks results of which are compared with logic minimization program ESPRESSO. The results show that proposed algorithm obtains good results and faster than ESPRESSO.

Keywords

Boolean minimization, logic operations, prime implicants, direct cover

First Page

1041

Last Page

1052

Recommended Citation

BAŞÇİFTÇİ, FATİH and KAHRAMANLI, ŞİRZAT (2010) "Fast computation of determination of the prime implicants by a novel near minimum minimization method," Turkish Journal of Electrical Engineering and Computer Sciences: Vol. 18: No. 6, Article 9. https://doi.org/10.3906/elk-0904-9
Available at: https://journals.tubitak.gov.tr/elektrik/vol18/iss6/9