Abortion Pill for sale in Riyadh ((+918761049707) Get Cytotec in Dammam
dpss 2.pptx
1. PERFORM THE ADDITION ON BINARY
BITS THE ARITHMETIC AND LOGIC
UNIT PRESENT IN THE COMPUTER
PREFERS THIS ADDER CIRCUIT.
BY
R.SURIYA (
713620104029)
V.SURIYA
(713620104030)
2. AIM:
💥 In the case study of full
Adder for k-Map,Truth
table,and logic diagram
3. ABSTRACT :
💥 A new circuit based on combining XOR gate
and double Pass transistor logic has been
developed for implementing a full Adder.
💥 The proposed full Adder circuit is compared
with previouly known circuit and is show to
provide superior performance.
4. ADDER :
💥 The basic operation a addition of two or more digits .
💥 Lower Significant bit is called sum.
💥 The higher Significant bit called carry.
💥 The two classicfication of adder:
1. Half adder.
2. Full adder.
💥 Example :
0+0=0
0+1=1
1+0=1
1+1=1 0
5. FULL ADDER:
• Full adder is the adder which adds three inputs and
produce two output.
• The first input is A, B and C.
• The output is sum and carry.
6. TRUTH TABLE :
• If two inputs are low the sum is
generate.
•If two inputs are high the carry is
generate.
12. APPLICATIONS:
•Along with cpu the full adder are seen
in Graphical processing units (GPU).
•In the timing and the counting
applications,this circuit are utilized.
13. ADVANTAGES OF FULL ADDER:
•Full Swing output
•Low power consumption
•High speed
•Robustness to supply voltage scaling
•Transistor sizing
14. DIS-ADVANTAGES FULL ADDER:
•It does not incorporate previous carry
for addition.
•Hence it is not suitable for cascading
for multibit addition.
15. CONCLUSION:
We can study about full adder of
circuit is truth table and logic
diagram, applications and
advantages& disadvantages for
circuit.