Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this study, a novel OFF-set based direct-cover Exact Minimization Algorithm (EMA) is proposed for single-output Boolean functions represented in a sum-of-products form. To obtain the complete set of prime implicants covering the given Target Minterm (ON-minterm), the proposed method uses OFF-cubes (OFF-minterms) expanded by this Target Minterm. The amount of temporary results produced by this method does not exceed the size of the OFF-set. In order to achieve the goal of this study, which is to make faster computations, logic operations were used instead of the 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 classes of benchmarks and then compared with the ESPRESSO algorithm. The results show that the proposed algorithm obtains more accurate and faster results than ESPRESSO does. © 2011 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Baifti, F., & Kahramanli, Ş. (2011). Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule. Advances in Engineering Software, 42(6), 316–321. https://doi.org/10.1016/j.advengsoft.2011.02.009

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free