Abstract :
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.
Keywords :
Consensus, DON´T CARE term, literal, minimal sum, minterm, prime implicant, product-i, product-0, subcube.; Minimization methods; Consensus, DON´T CARE term, literal, minimal sum, minterm, prime implicant, product-i, product-0, subcube.;
