Adder (electronics)

An adder, or summer, is a digital circuit that performs addition of numbers. In many computers and other kinds of processors, adders are used in the arithmetic logic units (ALUs). They are also used in other parts of the processor, where they are used to calculate addresses, table indices, increment and decrement operators and similar operations.

Although adders can be constructed for many number representations, such as binary-coded decimal or excess-3, the most common adders operate on binary numbers.

In cases where two's complement or ones' complement is being used to represent negative numbers, it is trivial to modify an adder into an adder–subtractor.

Other signed number representations require more logic around the basic adder.

History

George Stibitz invented the 2-bit binary adder (the Model K) in 1937.

Binary adders

Half adder

The half adder adds two single binary digits

A

{\displaystyle A}

and

B

{\displaystyle B}

. It has two outputs, sum (

S

{\displaystyle S}

) and carry (

C

{\displaystyle C}

). The carry signal represents an overflow into the next digit of a multi-digit addition. The value of the sum is

2

C

S

{\displaystyle 2C+S}

. The simplest half-adder design incorporates an XOR gate for

S

{\displaystyle S}

and an AND gate for

C

{\displaystyle C}

. The Boolean logic for the sum (in this case

S

{\displaystyle S}

) will be

A

⊕

B

{\displaystyle A\oplus B}

whereas for the carry (

C

{\displaystyle C}

) will be

A

⋅

B

{\displaystyle A\cdot B}

. With the addition of an OR gate to combine their carry outputs, two half adders can be combined to make a full adder.

The truth table for the half adder is:

Various half adder digital logic circuits:

Full adder

A full adder adds binary numbers and accounts for values carried in as well as out. A one-bit full-adder adds three one-bit numbers, often written as

A

{\displaystyle A}

,

B

{\displaystyle B}

, and

C

i

n

{\displaystyle C_{in}}

;

A

{\displaystyle A}

and

B

{\displaystyle B}

are the operands, and

C

i

n

{\displaystyle C_{in}}

is a bit carried in from the previous less-significant stage. The circuit produces a two-bit output. Output carry and sum are typically represented by the signals

C

o

u

t

{\displaystyle C_{out}}

and

S

{\displaystyle S}

, where the sum equals

2

C

o

u

t

S

{\displaystyle 2C_{out}+S}

. The full adder is usually a component in a cascade of adders, which add 8, 16, 32, etc. bit binary numbers.

A full adder can be implemented in many different ways such as with a custom transistor-level circuit or composed of other gates. The most common implementation is with:

S

=

A

⊕

B

⊕

C

i

n

{\displaystyle S=A\oplus B\oplus C_{in}}

C

o

u

t

=

(

A

⋅

B

)

(

C

i

n

⋅

(

A

⊕

B

)

)

{\displaystyle C_{out}=(A\cdot B)+(C_{in}\cdot (A\oplus B))}

The above expressions for

S

{\displaystyle S}

and

C

i

n

{\displaystyle C_{in}}

can be derived from using a Karnaugh map to simplify the truth table.

In this implementation, the final OR gate before the carry-out output may be replaced by an XOR gate without altering the resulting logic. This is because when A and B are both 1, the term

(

A

⊕

B

)

{\displaystyle (A\oplus B)}

is always 0, and hence

(

C

i

n

⋅

(

A

⊕

B

)

)

{\displaystyle (C_{in}\cdot (A\oplus B))}

can only be 0. Thus, the inputs to the final OR gate can never be both 1 (this is the only combination for which the OR and XOR outputs differ).

Due to the functional completeness property of the NAND and NOR gates, a full adder can also be implemented using nine NAND gates, or nine NOR gates.

Using only two types of gates is convenient if the circuit is being implemented using simple integrated circuit chips which contain only one gate type per chip.

A full adder can also be constructed from two half adders by connecting

A

{\displaystyle A}

and

B

{\displaystyle B}

to the input of one half adder, then taking its sum-output

S

{\displaystyle S}

as one of the inputs to the second half adder and

C

i

n

{\displaystyle C_{in}}

as its other input, and finally the carry outputs from the two half-adders are connected to an OR gate. The sum-output from the second half adder is the final sum output (

S

{\displaystyle S}

) of the full adder and the output from the OR gate is the final carry output (

C

o

u

t

{\displaystyle C_{out}}

). The critical path of a full adder runs through both XOR gates and ends at the sum bit

S

{\displaystyle S}

. Assumed that an XOR gate takes 1 delays to complete, the delay imposed by the critical path of a full adder is equal to:

T

FA

=

2

⋅

T

XOR

=

2

D

{\displaystyle T_{\text{FA}}=2\cdot T_{\text{XOR}}=2D}

The critical path of a carry runs through one XOR gate in adder and through 2 gates (AND and OR) in carry-block and therefore, if AND or OR gates take 1 delay to complete, has a delay of:

T

c

=

T

XOR

T

AND

T

OR

=

D

D

D

=

3

D

{\displaystyle T_{\text{c}}=T_{\text{XOR}}+T_{\text{AND}}+T_{\text{OR}}=D+D+D=3D}

The truth table for the full adder is:

Inverting all inputs of a full adder also inverts all of its outputs, which can be used in the design of fast ripple-carry adders, because there is no need to invert the carry.

Various full adder digital logic circuits:

Adders supporting multiple bits

Ripple-carry adder

It is possible to create a logical circuit using multiple full adders to add N-bit numbers. Each full adder inputs a

C

i

n

{\displaystyle C_{in}}

, which is the

C

o

u

t

{\displaystyle C_{out}}

of the previous adder. This kind of adder is called a ripple-carry adder (RCA), since each carry bit "ripples" to the next full adder. The first (and only the first) full adder may be replaced by a half adder (under the assumption that

C

i

n

=

0

{\displaystyle C_{in}=0}

).

The layout of a ripple-carry adder is simple, which allows fast design time; however, the ripple-carry adder is relatively slow, since each full adder must wait for the carry bit to be calculated from the previous full adder. The gate delay can easily be calculated by inspection of the full adder circuit. Each full adder requires three levels of logic. In a 32-bit ripple-carry adder, there are 32 full adders, so the critical path (worst case) delay is 3 (from input to

C

o

u

t

{\displaystyle C_{out}}

of first adder) + 31 × 2 (for carry propagation in latter adders) = 65 gate delays.

The general equation for the worst-case delay for a n-bit carry-ripple adder, accounting for both the sum and carry bits, is:

T

CRA

(

n

)

=

T

HA

(

n

−

1

)

⋅

T

c

T

s

=

{\displaystyle T_{\text{CRA}}(n)=T_{\text{HA}}+(n-1)\cdot T_{\text{c}}+T_{\text{s}}=}

T

FA

(

n

−

1

)

⋅

T

c

=

{\displaystyle T_{\text{FA}}+(n-1)\cdot T_{c}=}

3

D

(

n

−

1

)

⋅

2

D

=

(

2

n

1

)

⋅

D

{\displaystyle 3D+(n-1)\cdot 2D=(2n+1)\cdot D}

A design with alternating carry polarities and optimized AND-OR-Invert gates can be about twice as fast.

Carry-lookahead adder (Weinberger and Smith, 1958)

To reduce the computation time, Weinberger and Smith invented a faster way to add two binary numbers by using carry-lookahead adders (CLA). They introduced two signals (

P

{\displaystyle P}

and

G

{\displaystyle G}

) for each bit position, based on whether a carry is propagated through from a less significant bit position (at least one input is a 1), generated in that bit position (both inputs are 1), or killed in that bit position (both inputs are 0). In most cases,

P

{\displaystyle P}

is simply the sum output of a half adder and

G

{\displaystyle G}

is the carry output of the same adder. After

P

{\displaystyle P}

and

G

{\displaystyle G}

are generated, the carries for every bit position are created.

Mere derivation of Weinberger-Smith CLA recurrence, are: Brent–Kung adder (BKA), and the Kogge–Stone adder (KSA).

This was shown in Oklobdzija and Zeydel paper in IEEE Journal of Solid-State Circuits.

Some other multi-bit adder architectures break the adder into blocks. It is possible to vary the length of these blocks based on the propagation delay of the circuits to optimize computation time. These block based adders include the carry-skip (or carry-bypass) adder which will determine

P

{\displaystyle P}

and

G

{\displaystyle G}

values for each block rather than each bit, and the carry-select adder which pre-generates the sum and carry values for either possible carry input (0 or 1) to the block, using multiplexers to select the appropriate result when the carry bit is known.

By combining multiple carry-lookahead adders, even larger adders can be created. This can be used at multiple levels to make even larger adders. For example, the following adder is a 64-bit adder that uses four 16-bit CLAs with two levels of lookahead carry units.

Other adder designs include the carry-select adder, conditional sum adder, carry-skip adder, and carry-complete adder.

Carry-save adders

If an adding circuit is to compute the sum of three or more numbers, it can be advantageous to not propagate the carry result. Instead, three-input adders are used, generating two results: a sum and a carry. The sum and the carry may be fed into two inputs of the subsequent 3-number adder without having to wait for propagation of a carry signal. After all stages of addition, however, a conventional adder (such as the ripple-carry or the lookahead) must be used to combine the final sum and carry results.

3:2 compressors

A full adder can be viewed as a 3:2 lossy compressor: it sums three one-bit inputs and returns the result as a single two-bit number; that is, it maps 8 input values to 4 output values. (the term "compressor" instead of "counter" was introduced in). Thus, for example, a binary input of 101 results in an output of 1 + 0 + 1 = 10 (decimal number 2). The carry-out represents bit one of the result, while the sum represents bit zero. Likewise, a half adder can be used as a 2:2 lossy compressor, compressing four possible inputs into three possible outputs.

Such compressors can be used to speed up the summation of three or more addends. If the number of addends is exactly three, the layout is known as the carry-save adder. If the number of addends is four or more, more than one layer of compressors is necessary, and there are various possible designs for the circuit: the most common are Dadda and Wallace trees. This kind of circuit is most notably used in multiplier circuits, which is why these circuits are also known as Dadda and Wallace multipliers.

Quantum adders

Using only the Toffoli and CNOT quantum logic gates, it is possible to produce quantum full- and half-adders. The same circuits can also be implemented in classical reversible computation, as both CNOT and Toffoli are also classical logic gates.

Since the quantum Fourier transform has a low circuit complexity, it can efficiently be used for adding numbers as well.

Analog adders

Just as in Binary adders, combining two input currents effectively adds those currents together. Within the constraints of the hardware, non-binary signals (i.e. with a base higher than 2) can be added together to calculate a sum. Also known as a "summing amplifier", this technique can be used to reduce the number of transistors in an addition circuit.

See also

Binary multiplier

Subtractor

Electronic mixer — for adding analog signals

References

Further reading

External links

Media related to Adders (digital circuits) at Wikimedia Commons

8-bit Full Adder and Subtractor, a demonstration of an interactive Full Adder built in JavaScript solely for learning purposes.

Brunnock, Sean. "Interactive demonstrations of half and full adders in HTML5".

Shirriff, Ken (November 2020). "Reverse-engineering the carry-lookahead circuit in the Intel 8008 processor".

Source

• Wikipedia page: https://en.wikipedia.org/wiki/Adder_(electronics)
• Wikipedia API endpoint: https://en.wikipedia.org/w/api.php