Zaprojektować konwerter kodu ABCD (0, 1, 2, 3, 4, 8, 6, 7) na XYZT (11, 12, 13, 5, 8, 1, 2, 3)
ABCD XYZT
0 0 0 0 11 1 0 1 1
0 0 0 1 12 1 1 0 0
0 0 1 0 13 1 1 0 1
0 0 1 1 5 0 1 0 1
0 1 0 0 8 1 0 0 0
1 0 0 0 1 0 0 0 1
0 1 1 0 2 0 0 1 0
0 1 1 1 3 0 0 1 1
|
1 |
0 |
1 |
1 |
X |
0 |
0 |
X |
X |
X |
X |
0 |
X |
X |
|
X
X= Ā * C + Ā * B * D
|
1 |
|
1 |
0 |
X |
0 |
0 |
X |
X |
X |
X |
0 |
X |
|
|
Y
Y= C * D + B * C
|
0 |
0 |
0 |
0 |
|
1 |
1 |
X |
X |
X |
X |
0 |
X |
X |
|
Z
Z= Ā * B * C * D + B * C
|
0 |
1 |
|
0 |
X |
1 |
0 |
|
X |
X |
|
1 |
X |
X |
|
T
T= B * D + C * D
CD
AB
00
01
11
10
00 10 11 10
00 10 11 10
CD
AB
00
01
11
10
00
01
11
10
00 10 11 10
CD
AB
00
01
11
10
00 10 11 10
CD
AB