1) Write out the truth table for a simple circuirt to add 2 2-bit (unsigned) numbers and produce a 3-bit (unsigned) result.
(A+B=C. Where A and B are 2-bit numbers consisting of bits:
A1 and A0
and
B1 and B0
C is a three bit number consisting of bits C2,C1, and C0.
The 0 bits are the loworder (right most) bits of the input number.A1 A0 B1 B0 C2 C1 C0 Meaning
0 0 0 0 0 0 0 0+0=0
0 0 0 1 0 0 1 0+1=1
0 0 1 0 0 1 0 0+2=2
0 0 1 1 0 1 1 0+3=3
0 1 0 0 0 0 1 1+0=1
0 1 0 1 0 1 0 1+1=2
0 1 1 0 0 1 1 1+2=3
0 1 1 1 1 0 0 1+3=4
1 0 0 0 0 1 0 2+0=2
1 0 0 1 0 1 1 2+1=3
1 0 1 0 1 0 0 2+2=4
1 0 1 1 1 0 1 2+3=5
1 1 0 0 0 1 1 3+0=3
1 1 0 1 1 0 0 3+1=4
1 1 1 0 1 0 1 3+2=5
1 1 1 1 1 1 0 3+3=62) Implement this circuit with a ROM (5 input, 3 output)
![]()
3) Implement this circuit with a PLA (4 input, 3 output)