K – Map
2.5 KARNAUGH MAP (K-MAP) A Boolean expression may have many different forms. WiththeuseofK-map,thecomplexityofreducingexpressionbecomeseasyandBooleanexpressionobtained is simplified. K-map also be said as pictorial form of truth table. K-map is alternative way of simplifying logic circuits. Instead of using Boolean algebra simplification techniques, you can transfer logic values from aBoolean statement or a truth table into a Karnaugh […]