This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
July 1975 (vol. 24 no. 7)
pp. 753-756
null Sureshchander, Department of Electrical Engineering, Pant College of Technology
An algorithm is presented in this correspondence which will generate only those prime implicants (PI's) which are essential or necessary for a minimal sum of products (the technique can be extended for product of sums form also) of a given switching function ?iven all the minterms. This algorithm eliminates the neces-sity of finding out all the PI's.
Index Terms:
Consensus, DON'T CARE term, literal, minimal sum, minterm, prime implicant, product-i, product-0, subcube.
Citation:
null Sureshchander, "Minimization of Switching Functions?A Fast Technique," IEEE Transactions on Computers, vol. 24, no. 7, pp. 753-756, July 1975, doi:10.1109/T-C.1975.224298
Usage of this product signifies your acceptance of the Terms of Use.