arithmetic circuit addition subtraction division multiplication
TRANSCRIPT
![Page 1: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/1.jpg)
Adders
![Page 2: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/2.jpg)
Binary Adders
Arithmetic circuit Addition Subtraction Division Multiplication
![Page 3: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/3.jpg)
0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 10
One bit in sum
Two bit in sum
![Page 4: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/4.jpg)
Half Adder
A combinational circuit that performs the addition of two bits.
Two inputs and two outputs.
Augend and Addend
Sum and Carry
![Page 5: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/5.jpg)
Truth table of Half Adder
X Y C S0 0 0 0
0 1 0 1
1 0 0 1
1 1 1 0
![Page 6: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/6.jpg)
Circuit Diagram
![Page 7: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/7.jpg)
Full Adder
A combinational circuit that performs the addition of three input bits.
Three inputs and two outputs.
Sum and Carry
![Page 8: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/8.jpg)
Truth table of Full Adder
X Y Z C S0 0 0 0 00 0 1 0 10 1 0 0 10 1 1 1 01 0 0 0 11 0 1 1 01 1 0 1 01 1 1 1 1
![Page 9: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/9.jpg)
Circuit Diagram
![Page 10: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/10.jpg)
Binary Ripple Carry Adder
Adders connected in cascade. Carry output from one full adder
connected to carry input of next full adder.
![Page 11: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/11.jpg)
Binary Ripple Carry Adder
![Page 12: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/12.jpg)
Input carry 0110 A 1011 B 0011 Sum 1110 Output carry 0011
![Page 13: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/13.jpg)
Input carry in the least significant position is 0.
Simple in concept. Long circuit delay.
Many gates in the carry path.
![Page 14: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/14.jpg)
Why a Carry Lookahead Adder?
Practical design with reduced delay.
For a n- bit ripple carry adder The longest delay path is 2n + 2. 16 – bit ripple carry adder - delay is 34
gate delays
![Page 15: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/15.jpg)
Carry Lookahead Adder
Designed by a transformation of the ripple carry adder design in which the carry logic over fixed groups of bits of the adder is reduced to two-level logic.
![Page 16: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/16.jpg)
Design
OR gate and one of the AND gates are removed to form each of the full adders to form the ripple carry adder.
Separate the parts of full adders not involving the carry propagation path from those containing the path.
First part of each full adder partial full adder - PFA
![Page 17: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/17.jpg)
Two outputs Pi and Gi
From each PFA to ripple carry path
One input Ci
From the carry path to each PFA
![Page 18: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/18.jpg)
Pi = Ai XOR Bi - Propagate function Gi = Ai . Bi - Generate function
![Page 19: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/19.jpg)
Whenever Pi = 1 Incoming carry is propagated through bit
position from Ci+1.
Whenever Pi = 0 carry propagation through bit position is
blocked.
![Page 20: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/20.jpg)
Whenever Gi = 1 Carry output from the position is 1. Regardless of value of Pi.
A Carry has been generated. Whenever Gi = 0
carry is not generated. Ci+1 is 0.
Ci is also 0.
![Page 21: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/21.jpg)
Generate and propagate functions correspond exactly to the half adder.
Essential in controling the values in ripple carry path.
PFA generates sum function by XOR of incoming carry, Ci and propagate function, Pi.
![Page 22: Arithmetic circuit Addition Subtraction Division Multiplication](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649db35503460f94aa2c65/html5/thumbnails/22.jpg)