Digital Logic Design

Simplify the Boolean Function using Tabular Method

Quine-McClukey tabular method is a tabular method based on the concept of prime implicants. We know that prime implicant is a product (or sum) term, which can’t be further reduced by combining with any other product (or sum) terms of the given Boolean function. This tabular method is useful to get the prime implicants by repeatedly using the following Boolean identity. xy+xy’=x(y+y’)=x.1=x… Read more →