Untitled
Untitled
0 0 0 0 0 0 0
0 0 1 0 1 0 0
0 1 0 0 1 1 0
0 1 1 1 0 0 1
1 0 0 0 1 1 0
1 0 1 1 0 0 1
1 1 0 1 0 1 1
1 1 1 1 1 1 1
= (A ⊕ B) C + (A ⊕ B) C
=A ⊕ B ⊕ C
= AB + (AB + AB) C
= AB + (A ⊕ B) C
OUTPUT Cout3 0 0 0 1 0 1 1 1
FA
Cout2 0 0 0 1 0 1 1 1
Cout1 0 0 0 1 0 1 1 1
Cout0 0 0 0 1 0 1 1 1
S3 0 0 1 0 1 0 1 1
S2 0 0 1 0 1 0 1 1
S1 0 0 1 0 1 0 1 1
S0 0 1 1 0 1 0 0 1
INPUT
FA Cin3 0 0 0 1 0 1 1 1
Cin2 0 0 0 1 0 1 1 1
Cin1 0 0 0 1 0 1 1 1
Cin0 0 1 0 1 0 1 0 1
B3 0 0 1 1 0 0 1 1
B2 0 0 1 1 0 0 1 1
B1 0 0 1 1 0 0 1 1
B0 0 0 1 1 0 0 1 1
A3 0 0 0 0 1 1 1 1
A2 0 0 0 0 1 1 1 1
A1 0 0 0 0 1 1 1 1
A0 0 0 0 0 1 1 1 1
2. Design, construct and test a combination of full adder circuit implementation of ripple
carry adder. Draw your logic diagram inside the box.
B. Using a combination of half adder and full adders.
1. Derive the truth table of ripple carry adder using full adder and half adder implementation:
A B SUM CARRY
Cin A3 A2 A1 A0 B3 B2 B1 0 S3 S2 S1 S0 Cout
0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0 1 0 0 1 0 0
0 0 0 1 0 0 0 1 0 0 1 0 0 0
0 0 0 1 1 0 0 1 1 0 1 1 0 0
0 0 1 0 0 0 1 0 0 1 0 0 0 0
0 0 1 0 1 0 1 0 1 1 0 1 0 0
0 0 1 1 0 0 1 1 0 1 1 0 0 0
0 0 1 1 1 0 1 1 1 1 1 1 0 0
0 1 0 0 0 1 0 0 0 0 0 0 0 1
0 1 0 0 1 1 0 0 1 0 0 1 0 1
0 1 0 1 0 1 0 1 0 0 1 0 0 1
0 1 0 1 1 1 0 1 1 0 1 1 0 1
0 1 1 0 0 1 1 0 0 1 0 0 0 1
0 1 1 0 1 1 1 0 1 1 0 1 0 1
0 1 1 1 0 1 1 1 0 1 1 0 0 1
0 1 1 1 1 1 1 1 1 1 1 1 0 1
2. Design, construct and test a combination of full and half adder circuit implementation of ripple
carry adder. Draw your logic diagram inside the box.
A1 A2 A3 A4 B4 B3 B2 B1 S4 S3 S2 S1 CARRY
0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 0 0 0 1 0 0 1 0 0 0 0
1 0 0 0 1 0 0 0 0 0 0 0 1
1 0 1 0 1 0 1 0 0 1 0 0 1
1 1 0 0 1 1 0 0 1 0 0 0 1
1 1 1 0 1 1 1 0 1 1 0 0 1
1 1 1 1 1 1 1 1 1 1 1 0 1
NATIONAL UNIVERSITY
RUBRIC FOR LABORATORY PERFORMANCE
Evaluated by:
________________________________________
Printed Name and Signature of Faculty Member
Date:_____________________________