University of Illinois at Chicago
CS 266: Computer Architecture I Fall 2012
Homework 4 Solutions
Question 1 [25 points]
Design a combinational circuit that converts a binar y number of four bits to a decimal number n BCD. Note that the BCD number is
the same as the binary number as long as the inpu t is less than or equal to 9. The binary number from 1010 to 1111 converts into
BCD numbers from 1 0000 to 1 0101.
Decima
l
Binary
BCD
0
0
0
0
0
0
0
0
0
0
1
0
0
0
1
0
0
0
0
1
2
0
0
1
0
0
0
0
1
0
3
0
0
1
1
0
0
0
1
1
4
0
1
0
0
0
0
1
0
0
5
0
1
0
1
0
0
1
0
1
6
0
1
1
0
0
0
1
1
0
7
0
1
1
1
0
0
1
1
1
8
1
0
0
0
0
1
0
0
0
9
1
0
0
1
0
1
0
0
1
10
1
0
1
0
1
0
0
0
0
11
1
0
1
1
1
0
0
0
1
12
1
1
0
0
1
0
0
1
0
13
1
1
0
1
1
0
0
1
1
14
1
1
1
0
1
0
1
0
0
15
1
1
1
1
1
0
1
0
1
We would like to represent each of
,
,
,
,
as function of
,
,
,
,
. For each we build the k-map.
=
+
=
A
B
CD
0
0
01
1
11
10
1
1
1
0
0
01
11
10
1
1
A
B
CD
0
0
01
1
11
10
0
0
01
11
10
1
