Optimization of the Quine-McCluskey Method for the Minimization of the Boolean Expressions
作者： Tarun Kumar Jain , D. S. Kushwaha , A. K. Misra
DOI: 10.1109/ICAS.2008.11
关键词: Boolean function 、 Implicant 、 Boolean circuit 、 Circuit minimization for Boolean functions 、 Time complexity 、 Boolean expression 、 Quine–McCluskey algorithm 、 Algorithm 、 Computer science 、 Canonical normal form
摘要: The basic principle in designing digital circuit hovers around reducing the required hardware thus cost too. To achieve this, we use Boolean expression that helps obtaining minimum number of terms and does not contain any redundant pairs. conventional methods for minimization expressions are K-Map method . minimized used to design circuits. Since gets exceedingly complex when variable exceed six, hence Quine-McCluskey tabulation scores over this is widely .In following paper present optimized Quine- McCluskey reduces run time complexity algorithm by proposing an efficient determination Prime Implicants.
ieeecomputersociety.org
computer.org
acm.org 参考文章(7)
Sivarama P. Dandamudi, Fundamentals of Computer Organization and Design ,(2003)
Donald D. Givone, Digital Principles and Design ,(2002)
M. Morris Mano, Digital Logic And Computer Design ,(1979)
Graham Wilson, Embedded Systems and Computer Architecture ,(2001)
E. J. McCluskey, Minimization of Boolean Functions* Bell System Technical Journal. ,vol. 35, pp. 1417- 1444 ,(1956) , 10.1002/J.1538-7305.1956.TB03835.X
M. Karnaugh, The map method for synthesis of combinational logic circuits Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics. ,vol. 72, pp. 593- 599 ,(1953) , 10.1109/TCE.1953.6371932
Holger Schwender, Minimization of Boolean expressions using matrix algebra Research Papers in Economics. ,(2007)