A novel approach for fast covering the Boolean sets

作者: Sirzat Kahramanli , Fatih Basççiftçi

DOI:

关键词:

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

参考文章(6)
Olivier Coudert, Two-level logic minimization: an overview Integration. ,vol. 17, pp. 97- 140 ,(1994) , 10.1016/0167-9260(94)00007-7
Alberto L. Sangiovanni-Vincentelli, Gary D. Hachtel, Curtis T. McMullen, Robert King Brayton, Logic Minimization Algorithms for VLSI Synthesis ,(1984)
A.A. Malik, R.K. Brayton, A.R. Newton, A. Sangiovanni-Vincentelli, Reduced offsets for minimization of binary-valued functions IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 10, pp. 413- 426 ,(1991) , 10.1109/43.75625
T. Sasao, J.T. Butler, Worst and best irredundant sum-of-products expressions IEEE Transactions on Computers. ,vol. 50, pp. 935- 948 ,(2001) , 10.1109/12.954508
Alan Mishchenko, Tsutomu Sasao, Large-scale SOP minimization using decomposition and functional properties Proceedings of the 40th conference on Design automation - DAC '03. pp. 149- 154 ,(2003) , 10.1145/775832.775872
Ş. Kahramanlı, N. Allahverdi, Algebraic Approach to Transformations on Hypercube System Mathematical & Computational Applications. ,vol. 1, pp. 50- 59 ,(1996) , 10.3390/MCA1010050