SPIDERS: Swift prime implicant derivation through exhaustive rotation and sort

This paper introduces a software tool named SPIDERS which uses a novel iterative algorithm to derive prime implicants from logic functions. The algorithm takes the logic function as a list of binary numbers indicating the minterms to be disjointed. The numbers are first sorted using a special sorting algorithm with a time complexity of order O(n). Then they are rotated and sorted again in each iteration. Thus, the ith iteration of the algorithm places minterms differing only in the ith literal in successive locations of the list. By doing so, prime implicants appear as consecutive blocks of numbers in the list. The SPIDERS algorithm exhaustively derives all prime implicant from the input function during a number of iterations which is equal to the number of logic variables.

[1]  Jeenong Yang,et al.  Lossless Compression Using Two-Level and Multilevel Boolean Minimization , 2006, 2006 IEEE Workshop on Signal Processing Systems Design and Implementation.

[2]  K. Selvam,et al.  Image extraction by quine Mc Cluskey’s tabular method , 2007 .

[3]  Witold Pedrycz,et al.  Fuzzy modelling through logic optimization , 2005, NAFIPS 2005 - 2005 Annual Meeting of the North American Fuzzy Information Processing Society.

[4]  Jaehoon Song,et al.  Parallel CRC Logic Optimization Algorithm for High Speed Communication Systems , 2006, 2006 10th IEEE Singapore International Conference on Communication Systems.

[5]  Omar M. Ba-Rukab,et al.  A purely map procedure for two-level multiple-output logic minimization , 2007, Int. J. Comput. Math..

[6]  Hamid Beigy,et al.  Quine-McCluskey Classification , 2007, 2007 IEEE/ACS International Conference on Computer Systems and Applications.

[7]  Behrouz Zolfaghari,et al.  QTOP: A topological approach to minimizing single-output logic functions , 2009, 2009 IEEE Student Conference on Research and Development (SCOReD).

[8]  Petr Fiser,et al.  Fast Boolean Minimizer for Completely Specified Functions , 2008, 2008 11th IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems.

[9]  I.L. Markov,et al.  Dynamic symmetry-breaking for improved Boolean optimization , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

[10]  Witold Pedrycz,et al.  Logic Minimization as an Efficient Means of Fuzzy Structure Discovery , 2008, IEEE Transactions on Fuzzy Systems.

[11]  B. Zolfaghari.  A dynamic scheduling algorithm with minimum context switches for spacecraft avionics systems , 2004, 2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720).

[12]  Mohsen Sharifi,et al.  Optimizing the ready queue structure for dynamic scheduling strategies in real-time operating systems , 2003, Computer systems science and engineering.

[13]  He Peng,et al.  An Expanding Products Algorithm of Logic Functions Optimization , 2009, 2009 WRI World Congress on Computer Science and Information Engineering.

[14]  Behrouz Zolfaghari,et al.  YALMIC: Yet Another Logic Minimization Based Image Compressor , 2010, 2010 2nd International Conference on Computer Engineering and Technology.

[15]  F. Basçiftçi,et al.  An Off-Cubes Expanding Approach to the Problem of Separate Determination of the Essential Prime Implicants of the Single-Output Boolean Functions , 2007, EUROCON 2007 - The International Conference on "Computer as a Tool".