Assignment #11� 4-variable Karnaugh Map Design Challenge �Posted 11/3, due 11/13 11:59 pm � Late: 11/14 12:01 am – 11/15 11:59 pm �Game over: after 11/15 11:59 pm: 0 point
Design Requirement: Truth Table
Inputs:
Output:
A | B | C | D |
| F |
0 | 0 | 0 | 0 |
| 0 |
0 | 0 | 0 | 1 |
| 0 |
0 | 0 | 1 | 0 |
| 1 |
0 | 0 | 1 | 1 |
| 0 |
0 | 1 | 0 | 0 |
| 1 |
0 | 1 | 0 | 1 |
| 1 |
0 | 1 | 1 | 0 |
| 1 |
0 | 1 | 1 | 1 |
| 0 |
1 | 0 | 0 | 0 |
| 1 |
1 | 0 | 0 | 1 |
| 0 |
1 | 0 | 1 | 0 |
| 1 |
1 | 0 | 1 | 1 |
| 1 |
1 | 1 | 0 | 0 |
| 1 |
1 | 1 | 0 | 1 |
| 0 |
1 | 1 | 1 | 0 |
| 0 |
1 | 1 | 1 | 1 |
| 0 |
Inputs
Output
( Given) Step 1: Create Karnaugh Map
Inputs:
Output:
| 00 | 01 | 11 | 10 |
00 | | | | 1 |
01 | 1 | 1 | | 1 |
11 | 1 | | | |
10 | 1 | | 1 | 1 |
AB
CD
A | B | C | D |
| F |
0 | 0 | 0 | 0 |
| 0 |
0 | 0 | 0 | 1 |
| 0 |
0 | 0 | 1 | 0 |
| 1 |
0 | 0 | 1 | 1 |
| 0 |
0 | 1 | 0 | 0 |
| 1 |
0 | 1 | 0 | 1 |
| 1 |
0 | 1 | 1 | 0 |
| 1 |
0 | 1 | 1 | 1 |
| 0 |
1 | 0 | 0 | 0 |
| 1 |
1 | 0 | 0 | 1 |
| 0 |
1 | 0 | 1 | 0 |
| 1 |
1 | 0 | 1 | 1 |
| 1 |
1 | 1 | 0 | 0 |
| 1 |
1 | 1 | 0 | 1 |
| 0 |
1 | 1 | 1 | 0 |
| 0 |
1 | 1 | 1 | 1 |
| 0 |
Inputs
Output
(4 points) Step 2: Karnaugh Map Grouping
| 00 | 01 | 11 | 10 |
00 | | | | |
01 | | | | |
11 | | | | |
10 | | | | |
AB
CD
Quadruple check your results
before going to next step
(8 points) Step 3: Create Design Equations�* Use Karnaugh Map only� * Do NOT simplify using Algebra�* Use Basic Logic Gates only: NOT, AND,OR�* Do NOT use Exclusive OR logic (for this assignment)
| 00 | 01 | 11 | 10 |
00 | | | | |
01 | | | | |
11 | | | | |
10 | | | | |
AB
CD
Design Equation: F =
Logic Diagram (NOT required)��Build & Test Circuit (NOT required)