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

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-cube...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Advances in engineering software (1992) Ročník 42; číslo 6; s. 316 - 321
Hlavní autoři: Basciftci, Fatih, Kahramanli, Sirzat
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.06.2011
Témata:
Algorithms
Benchmarks
Computation
Computer programs
Direct-cover
Exact minimization algorithm
Logic
Logic operations
Minimization
Optimization
Partial ordering operation
Prime implicants
Two-level logic minimization
Exact minimization algorithm
Direct-cover
Partial ordering operation
Prime implicants
Logic operations
Two-level logic minimization
ISSN:0965-9978
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0965-9978
DOI:10.1016/j.advengsoft.2011.02.009