This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimization of Boolean Functions
August 1971 (vol. 20 no. 8)
pp. 925-929
The Quine?McCluskey method of minimizing a Boolean function gives all the prime implicants, from which the essential terms are selected by one or more cover tables known as the prime implicant tables. This note describes a tabular method where the essential prime implicants are selected during the process of forming the combination tables, and other essential terms are selected from what have been described in the note as chains of selective prime implicants. Consequently, the need for successive prime implicant tables is eliminated.
Index Terms:
Minimization method, tabular method, selective prime implicants.
Citation:
N.N. Biswas, "Minimization of Boolean Functions," IEEE Transactions on Computers, vol. 20, no. 8, pp. 925-929, Aug. 1971, doi:10.1109/T-C.1971.223373
Usage of this product signifies your acceptance of the Terms of Use.