← ProblemsCircuits / Combinational Logic / Karnaugh Map to Circuit
K-map to circuit (wrap-around groups)
15%kmapboolean-algebraImplement the function f described by the Karnaugh map below. The four inputs arrive as a vector x[4:1]; columns give x[1] and x[2], rows give x[3] and x[4]. There are no don't-cares — your circuit must match every cell exactly.
| x1'x2' | x1'x2 | x1x2 | x1x2' | |
|---|---|---|---|---|
| x3'x4' | 1 | 0 | 0 | 1 |
| x3'x4 | 0 | 0 | 0 | 0 |
| x3x4 | 1 | 1 | 1 | 0 |
| x3x4' | 1 | 1 | 0 | 1 |
Remember that the map wraps: the four corner cells are mutually adjacent, and so are cells on opposite edges of the same row or column.