Simplification of Single-Output Boolean Functions by Exact Direct Cover Algorithm Based on Cube Algebra

Due to the nature of the exact two-level Boolean functions minimization methods most of practical applications rely on heuristic ones that are generally realized by a three step cyclic algorithm. First, the algorithm selects an On-minterm and it generates the set of prime implicants for this On-mint...

Full description

Saved in:
Bibliographic Details
Published in:EUROCON 2007 - the International Conference on Computer as a Tool pp. 427 - 431
Main Author: Basciftci, F.
Format: Conference Proceeding
Language:English
Published: IEEE 01.09.2007
Subjects:
Algebra
Application software
Benchmark testing
Boolean functions
Circuits
Computer science education
Cost function
cube algebra
direct-cover principle
Energy dissipation
Logic
Logic simplification
Minimization methods
prime implicant
ISBN:9781424408122, 1424408121
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Due to the nature of the exact two-level Boolean functions minimization methods most of practical applications rely on heuristic ones that are generally realized by a three step cyclic algorithm. First, the algorithm selects an On-minterm and it generates the set of prime implicants for this On-minterm; second, it determinates the essential prime implicant from among the generated prime implicants; and third, it performs a covering operation. The goal of this study, if the determination of the essential prime implicant is impossible, postponed the selection of essential prime implicant for this On-minterm and save it for a status word. When a new essential prime implicant determined, retrieve the status word. The proposed minimization algorithm is tested on several different kinds of problems and on standard MCNC benchmarks results of which are compared with ESPRESSO. The results show that proposed algorithm obtains exact results and faster than ESPRESSO.
ISBN:9781424408122
1424408121
DOI:10.1109/EURCON.2007.4400394