0% found this document useful (0 votes)
58 views6 pages

Digital Logic Simplification Guide

The document summarizes the logic for a full adder circuit. It shows that the sum is calculated as A XOR B XOR Cin and the carry is calculated as A AND B OR B AND Cin OR A AND Cin. Truth tables are provided for both a half adder and a full adder that show the output sums and carries for all possible input combinations of A, B, and Cin.

Uploaded by

Muhammad Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
58 views6 pages

Digital Logic Simplification Guide

The document summarizes the logic for a full adder circuit. It shows that the sum is calculated as A XOR B XOR Cin and the carry is calculated as A AND B OR B AND Cin OR A AND Cin. Truth tables are provided for both a half adder and a full adder that show the output sums and carries for all possible input combinations of A, B, and Cin.

Uploaded by

Muhammad Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Simplification:

Sum = A’.B + A.B’ => A ⊕ 𝐵


Carry = A.B
Truth Table:
Input Output
A B Sum Carry
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

On Trainer Board:
Simplification:
Sum = A ⊕ B ⊕ 𝐶𝑖𝑛
Carry = A.B + B. 𝐶𝑖𝑛 + A. 𝐶𝑖𝑛
Truth Table:
Input Output

A B 𝑪𝒊𝒏 Sum 𝑪𝒐𝒖𝒕


0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1

On Trainer Board:

You might also like