1. Introduction: Why a 4-Variable K-Map? Boolean algebra is powerful, but algebraic simplification becomes error-prone and time-consuming with 4 or more variables. The Karnaugh Map (K-map) provides a visual, graphical method to simplify logic expressions. For 4 variables (typically labeled A, B, C, D ), the K-map is a 4×4 grid of 16 cells, each representing a unique minterm (product term) or maxterm (sum term). Its core power lies in exploiting adjacency to eliminate variables via the Boolean law: ( X + \overlineX = 1 ). 2. Structure of the 4-Variable K-Map 2.1 The Grid Layout Unlike a simple 2D matrix, the K-map uses Gray code ordering (only one bit changes between adjacent cells). This ensures that moving to any adjacent cell horizontally or vertically changes exactly one variable.
| | 00 | CD 01 | CD 11 | CD 10 | | :--- | :---: | :---: | :---: | :---: | | AB 00 | m0 (0000) | m1 (0001) | m3 (0011) | m2 (0010) | | AB 01 | m4 (0100) | m5 (0101) | m7 (0111) | m6 (0110) | | AB 11 | m12 (1100)| m13 (1101)| m15 (1111)| m14 (1110)| | AB 10 | m8 (1000) | m9 (1001) | m11 (1011)| m10 (1010)| mapa de karnaugh 4 variables
| AB\CD | 00 | 01 | 11 | 10 | |-------|----|----|----|----| | 00 | 1 | 1 | 0 | 1 | | 01 | 0 | 1 | 0 | 0 | | 11 | 0 | 0 | 0 | 0 | | 10 | 1 | 1 | 0 | 1 | The Karnaugh Map (K-map) provides a visual, graphical