Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
5 views1 page

Full Adder Using CMOS Mirror Logic

Uploaded by

asekhar946
Copyright
© © All Rights Reserved
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
0% found this document useful (0 votes)
5 views1 page

Full Adder Using CMOS Mirror Logic

Uploaded by

asekhar946
Copyright
© © All Rights Reserved
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/ 1

Design Of 1-Bit Full Adder Using CMOS Mirror Logic

Yajnesh K, Mangalore Institute Of Technology & Engineering


April 17, 2022

Abstract
This paper presents a 1-bit full adder cell designed by using 2. Circuit
the CMOS mirror technique. The full adder circuit is one of
the most widely used building blocks in all arithmetic and
digital data processing systems. This circuit accepts two 1-
bit inputs and produces two 1-bit outputs i.e. sum and
carry. We use the property of inversion and self-duality to
design this circuit. Because nowadays we have to deal with
huge bits of data, we can switch to more advanced adder
architectures like RIPPLE CARRY, CARRY SKIP, CARRY
SELECT, CARRY LOOK AHEAD, etc. The major drawback of
the CMOS mirror circuit is that it consumes more power
and occupies more area due to the greater number of
transistors used.

1. Reference Circuit Details


3. Waveform
Transistor level implementation of full adder using CMOS
mirror logic uses 28 transistors out of which 14 are nmos
and 14 are pmos. By using CMOS mirror design we can save
an area of 12 transistors as compared to the conventional
CMOS approach. If a function obeys both inversion and self-
duality properties then we can mirror the nmos stack to
pmos i.e. pull-up stack is symmetrical to pull-down, unlike
the opposite to pull-down stack in conventional CMOS. By
this approach, we can reduce pmos stack size and can have
equal rise and fall delays. Instead of realizing two functions
independently, we will use cout signal to generate sum
signal. The full adder circuit presented in this paper can be
further used as a building block to generate an N-bit adder, References
which accepts two n-bit inputs and produces n-bit sum.
One such adder architecture is known as ripple carry adder 1. S. Dhanjal. 1-bit full adder transistor level
where these full adder blocks are cascaded one after the implementation using CMOS mirror logic.
other. Each full adder in this architecture produces a 1-bit https://youtu.be/BflzLRjsECM.
sum and passes the carry to the subsequent full adder. In 2. International Journal Of Advance Research In Science &
this way carry ripples through each of the full adder stages. Engineering.http://www.ijarse.com/images/fullpdf/14
Speed of this carry rippling through each stage define the 44293364_4_Research_Paper.pdf
speed of the adder. Nowadays there are some advanced 3. Sung-Mo-Kang and Y. Leblebici. combinational mos
static CMOS techniques like CPL, TG, GDI, etc., to design a logic circuit. Book- Cmos digital integrated circuit
high speed and low power consumption full adder but analysis and design.
tuning the circuit alone is not the feasible solution as we
have to deal with huge bits of data at a time. In this case,
optimizing the architecture of the adder circuit can come in
handy.

You might also like