Scribd
Upload
103 views

Adders

A half adder is a basic logic circuit that performs addition on two single-bit binary numbers and outputs their sum and carry. It can be implemented using one XOR gate and one AND gate. A full adder performs addition on three single-bit binary numbers and outputs their sum and carry out. It has a more complex truth table than a half adder due to the additional input carry bit. A full adder can be constructed from two cascaded half adders or using other logic gates like XOR and OR.

Uploaded by

9887721988
Copyright
© Attribution Non-Commercial (BY-NC)
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
103 views

Adders

A half adder is a basic logic circuit that performs addition on two single-bit binary numbers and outputs their sum and carry. It can be implemented using one XOR gate and one AND gate. A full adder performs addition on three single-bit binary numbers and outputs their sum and carry out. It has a more complex truth table than a half adder due to the additional input carry bit. A full adder can be constructed from two cascaded half adders or using other logic gates like XOR and OR.

Uploaded by

9887721988
Copyright
© Attribution Non-Commercial (BY-NC)
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
You are on page 1/ 3

Source: http://en.wikipedia.

org/wiki/Adder_%28electronics%29

Half adder

A half adder is a logical circuit that performs an addition operation on two one
one--bit binary
numbers often written as A and B B.. The half adder output is a sum of the two inputs usually
represented with the signals Cout and S where . Following is the logic
table for a half adder:

Inputs Outputs
A B C S
0 0 0 0
0 1 0 1
1 0 0 1
1 1 1 0

Example half adder circuit diagram

As an example, a Half Adder can be built with an XOR gate and an AND gate.

___________
A ------| |
| Half |-----
-----
| Adder |
| |-----
-----
B ------|___________|

[edit] Full adder


Schematic symbol for a 1-bitbit full adder with Cin and Cout drawn on sides of block to emphasize
their use in a multi-bit adder.

A full adder is a logical circuit that performs an addition operation on three one
one--bit binary
numbers often written as A, B,, and Cin. The full adder produces a two-bit
bit output sum typically
represented with the signals Cout and S where . The full adder's truth
table is:

Inputs Outputs
A B Ci Co S
0 0 0 0 0
0 1 0 0 1
1 0 0 0 1
1 1 0 1 0
0 0 1 0 1
0 1 1 1 0
1 0 1 1 0
1 1 1 1 1

A full adder can be implemented in many different ways such as with a custom transistor-level
transistor
circuit or composed of other gates. One example implementation is with
and .

Example full adder circuit diagram


Inputs: {A, B, Cin} → Outputs: {S, Cout}

In this implementation, the final OR gate before the carry


carry-out
out output may be replaced by an
XOR gate without altering the resulting logic. Using only two types of gates is convenient if the
circuit is being implemented using
sing simple IC chips which contain only one gate type per chip.

A full adder can be constructed from two half adders by connecting A and B to the input of one
half adder, connecting the sum from that to an input to the second adder, connecting Ci to the
other input and OR the two carry outputs. Equivalently, S could be made the three-bit XOR of A,
B, and Ci, and Co could be made the three-bit majority function of A, B, and Ci.

You might also like