A novel approach for fast covering the Boolean sets

Authors:
Fatih Basççiftçi;Sirzat Kahramanli
Affiliations:
Department of Electronic and Computer Education, Selcuk University, Selçuklu, Konya, Turkey;Department of Computer Engineering, Selcuk University, Selçuklu, Konya, Turkey
Venue:
ISTASC'08 Proceedings of the 8th conference on Systems theory and scientific computation
Year:
2008

Citing 6
Cited 0

Two-level logic minimization: an overview

Integration, the VLSI Journal
Worst and Best Irredundant Sum-of-Products Expressions

IEEE Transactions on Computers
Synthesis and Optimization of Digital Circuits

Synthesis and Optimization of Digital Circuits
Logic Minimization Algorithms for VLSI Synthesis

Logic Minimization Algorithms for VLSI Synthesis
Large-scale SOP minimization using decomposition and functional properties

Proceedings of the 40th annual Design Automation Conference
Algorithms

Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this study we propose a new method for iteratively covering given Boolean data set by its prime implicants identified one at a time. In contrast to existing set covering methods of NP time complexity in the size of the set, our method is realized by procedures of linear complexity and therefore its efficiency is rapidly increased by increasing the size of the set. Our method can be useful in all fields related to Boolean data sets processing such as logic synthesis, image processing, data compressing, artificial intelligence and many others.