Scribd
Upload
854 views2 pages

Using Only Logic Gates, Design A 2-Bit Full Adder With Carry. Here Is A Partial Truth Table For The Circuit

1. The document describes a 2-bit full adder circuit using only logic gates. A full adder adds three inputs - two bits A and B, and a carry in bit C-IN - and produces two outputs: the sum bit S and carry out bit C-OUT. 2. The truth table for a full adder is provided, and the logical expressions for calculating the sum and carry out are derived. The sum S is equal to C-IN XOR (A XOR B), and the carry out C-OUT is equal to AB + C-IN (A EX-OR B). 3. A full adder allows multiple adders to be chained together to perform multi-bit addition

Uploaded by

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

Using Only Logic Gates, Design A 2-Bit Full Adder With Carry. Here Is A Partial Truth Table For The Circuit

1. The document describes a 2-bit full adder circuit using only logic gates. A full adder adds three inputs - two bits A and B, and a carry in bit C-IN - and produces two outputs: the sum bit S and carry out bit C-OUT. 2. The truth table for a full adder is provided, and the logical expressions for calculating the sum and carry out are derived. The sum S is equal to C-IN XOR (A XOR B), and the carry out C-OUT is equal to AB + C-IN (A EX-OR B). 3. A full adder allows multiple adders to be chained together to perform multi-bit addition

Uploaded by

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

1. Using only logic gates, design a 2-bit full adder with carry.

Here is a partial truth table for the


circuit.

Where A and B are inputs, Ci is carry in, Si is output and Co is carry out.

Full Adder is the adder which adds three inputs and produces two outputs. The first
two inputs are A and B and the third input is an input carry as C-IN. The output carry
is designated as C-OUT and the normal output is designated as S which is SUM.
A full adder logic is designed in such a manner that can take eight inputs together to
create a byte-wide adder and cascade the carry bit from one adder to the another.

Full Adder Truth Table:

Logical Expression for SUM:


= A’ B’ C-IN + A’ B C-IN’ + A B’ C-IN’ + A B C-IN
= C-IN (A’ B’ + A B) + C-IN’ (A’ B + A B’)
= C-IN XOR (A XOR B)
= (1,2,4,7)
Logical Expression for C-OUT:
= A’ B C-IN + A B’ C-IN + A B C-IN’ + A B C-IN
= A B + B C-IN + A C-IN
= (3,5,6,7)
Another form in which C-OUT can be implemented:
= A B + A C-IN + B C-IN (A + A’)
= A B C-IN + A B + A C-IN + A’ B C-IN
= A B (1 +C-IN) + A C-IN + A’ B C-IN
= A B + A C-IN + A’ B C-IN
= A B + A C-IN (B + B’) + A’ B C-IN
= A B C-IN + A B + A B’ C-IN + A’ B C-IN
= A B (C-IN + 1) + A B’ C-IN + A’ B C-IN
= A B + A B’ C-IN + A’ B C-IN
= AB + C-IN (A’ B + A B’)
Therefore COUT = AB + C-IN (A EX – OR B)

You might also like