Digital Logic20815 marksNumerical: K-map simplificationKarnaugh map simplification
Simplify (using K-map): F=(A+B+C+D′)(A+B+C′+D)(A+B′+C′+D′)(A+B′+C′+D)(A′+B′+C′+D)(A′+B+C+D′)(A′+B+C′+D)F = (A + B + C + D')(A + B + C' + D)(A + B' + C' + D')(A + B' + C' + D)(A' + B' + C' + D)(A' + B + C + D')(A' + B + C' + D)F=(A+B+C+D′)(A+B+C′+D)(A+B′+C′+D′)(A+B′+C′+D)(A′+B′+C′+D)(A′+B+C+D′)(A′+B+
Simplify (using K-map): F=(A+B+C+D′)(A+B+C′+D)(A+B′+C′+D′)(A+B′+C′+D)(A′+B′+C′+D)(A′+B+C+D′)(A′+B+C′+D)F = (A + B + C + D')(A + B + C' + D)(A + B' + C' + D')(A + B' + C' + D)(A' + B' + C' + D)(A' + B + C + D')(A' + B + C' + D)F=(A+B+C+D′)(A+B+C′+D)(A+B′+C′+D′)(A+B′+C′+D)(A′+B′+C′+D)(A′+B+C+D′)(A′+B+C′+D)[5]
$$F = (A+B+C+D')(A+B+C'+D)(A+B'+C'+D')(A+B'+C'+D)(A'+B'+C'+D)(A'+B+C+D')(A'+B+C'+D)$$ For a maxterm, uncomplemented variable = 0, complemented variable = 1. Sum Term A B C D Maxterm ------------------ $A+B+C+D'$ 0 0 0 1 $M1$ $A+B+C'+D$ 0 0 1 0 $M2$ $A+B'+C'+D'$ 0 1 1 1 $M7$ $A+B'+C'+D$ 0 1 1 0