* Arithmetic Circuits
Adder/subtractor unit
*4-bit full adder
*Simplest design: cascade full adders
*Critical path goes from Cin to Cout
*Design full adder to have fast carry delay
A 4 B4 A 3 B 3 A 2 B2 A 1 B1
Cout Cin
C3 C2 C1
S4 S3 S2 S1
*Ripple Carry Adder
* CMOS gate delays and areas
normalized relative to an inverter
*Full Adder – TT
*Carry Look Ahead adder
*Carry Look Ahead adder
* Cout=G+PCin
* We can also replace Ex-or operation with OR
operation. It can also computes the carry out
* Cout=AB+(A+B)Cin
* G = AB
* P = A Exor B or P = A + B
*Carry Look Ahead adder
*Carry Look Ahead adder
* The carry-select adder generally
consists of ripple-carry adders and
a multiplexer.
* Adding two n-bit numbers with a
carry-select adder is done with two
adders (therefore two ripple-carry
adders), in order to perform the
calculation twice, one time with
the assumption of the carry-in
being zero and the other assuming
it will be one.
* After the two results are
calculated, the correct sum, as well
as the correct carry-out, is then
selected with the multiplexer once
the correct carry-in is known.
*Carry Select Adder
*Uniform, Variable -sized adder
* A carry select adder (CSA) has several advantages, including:
* Fast: CSAs are one of the fastest adders available and are used
in many data-processing processors to perform fast arithmetic
functions.
* Low power: CSAs can be designed to consume less power.
* Reduced propagation delay: CSAs use parallel stages that
reduce propagation delay compared to other adders, such as
ripple carry adders and carry save adders.
* Reduced area: CSAs can be designed to take up less space.
*Advantages of CSA
