BitFlow

K-Map with Don't Cares

beginner · combinational · 65 XP

Sign in to write your solution, run it in the simulator and submit it for grading.

Sign in or create a free account →

Problem

K-Map with Don't Cares A 4-variable K-map has: - **Minterms (output=1):** {1, 3, 7, 11, 15} - **Don't-cares (X):** {0, 2, 5} Variables: `a` (MSB), `b`, `c`, `d` (LSB). **K-Map (X = don't care):** ``` cd ab | 00 | 01 | 11 | 10 | ----|----|----|----|----| 00 | X | 1 | 1 | X | 01 | 0 | X | 1 | 0 | 11 | 0 | 0 | 1 | 0 | 10 | 0 | 0 | 1 | 0 | ``` Using don't-cares to make the groups as large as possible gives two groups: - the `cd = 11` column (minterms 3, 7, 11, 15) → `c & d` - the `ab = 00` row (minterms 1, 3 plus don't-cares 0, 2) → `~a & ~b` Minimized expression: **y = (c & d) | (~a & ~b)** Watch out: `y = d` is *not* correct. It would also output 1 for minterms 9 and 13, which are 0 in the map. Implement as a single assign. Verify only against the true minterms (don't-cares can be 0 or 1).

Constraints

  • Single assign statement.
  • Show don't-care grouping in a comment.

Examples

Input: any input with d=1

Output: y=1

Input: any input with d=0 (not a minterm)

Output: y=0

Common questions

What does the K-Map with Don't Cares problem ask you to build?
K-Map with Don't Cares A 4-variable K-map has: - **Minterms (output=1):** {1, 3, 7, 11, 15} - **Don't-cares (X):** {0, 2, 5} Variables: `a` (MSB), `b`, `c`, `d` (LSB).
What constraints does K-Map with Don't Cares have?
Single assign statement.; Show don't-care grouping in a comment.
What is an example input and output for K-Map with Don't Cares?
Input any input with d=1 gives output y=1.
Which Verilog concepts does K-Map with Don't Cares practise?
combinational, K-map, interview, don't-care.