A decoder has four inputs (A,B,C,D) that represents 4 bits of a binary code, i.e., A, B, C, D
can each assume values of 0 or 1. The output F is presented in a Karnaugh Map (where the inputs
are in gray codes) as below. Use the Karnaugh map to generate the minimal expression for the
output F as logic combination of A,B,C,D. Make sure you clearly identify for each grouping in the
Karnaugh map with its corresponding combinational expression.
AB
CD
00
01
11
10
00
1
0
0
1
01
0
1
1
1
11
0
1
1
0
10
1
1
0
1