Issue No. 07 - July (1975 vol. 24)
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.
Consensus, DON'T CARE term, literal, minimal sum, minterm, prime implicant, product-i, product-0, subcube.
n. Sureshchander, "Minimization of Switching Functions?A Fast Technique," in IEEE Transactions on Computers, vol. 24, no. , pp. 753-756, 1975.