You are on page 1of 7

Design and implementation of BCD Adders using Quantum Dot

Cellular Automata for Area Efficient Applications


T Sravani P Abhishek
PG Scholar-VLSI System Design Assistant Professor
Dept., of Electronics & Communication Engg. Dept., of Electronics & Communication Engg.
Ashoka Institute of Engineering and Technology Ashoka Institute of Engineering and Technology
ssravani290@gmail.com p.abhiemails@gmail.com

ABSTRACT:
Significant scale systems plan -
Quantum Dot Cellular Automat is essentially, due to the presence of VLSI.
one of the promising solutions for ultralow
power applications as the channel width of The amount of employments of
the cmos transistors reached to 14nm and joined circuits in prevalent figuring, media
research is going on 7nm and further correspondences, and buyer contraptions has
decreasing of this channel width is no where been rising reliably, and at a speedy pace.
possible. As the logic gates are the basic Frequently, the required computational
building blocks for implementation of any of power (or, so to speak, the understanding) of
the digital circuits, having these gates these applications is the principle driving
implementation using these technology force for the fast headway of this field.
further improves the efficiency if the Gives an audit of the prominent examples in
circuits. In this paper we are implementing information headways all through the
a new method for QCA-based BCD adders. accompanying couple of decades. The
Exploiting innovative logic formulations and present driving edge advancements, (for
purpose-designed QCA modules, example, low piece rate video and cell
computational speed significantly higher correspondences) beginning at now give the
than existing counterparts is achieved end-clients a specific extent of dealing with
without sacrificing either the occupied area power and settlement.
or the cell count.
This example is depended upon to
Keywords continue, with fundamental consequences on
VLSI and structures layout. A champion
BCD adders, decimal arithmetic, quantum- among the most basic qualities of
dot cellular automata (QCA). information organizations is their extending
I.INTRODUCTION necessity for high getting ready power and
exchange speed (with a particular true
The gadgets business has achieved objective to manage progressing video, for
an astounding improvement all through the example). The other indispensable
latest two decades, basically in light of the trademark is that the information
snappy advances in coordination propels, organizations tend to wind up progressively
redid (rather than total organizations, for
instance, imparting), which suggests that the In this manner Verilog has turned into a n
contraptions must be more smart to answer worldwide standard - which will
particular solicitations, and meanwhile they additionally expand its business
ought to be minimized to allow more improvement and utilize. At present, there is
prominent flexibility/transportability. norms movement to broaden Verilog past
absolutely computerized circuits. This
Very Large-scale integration (VLSI) incorporates Verilog-MS for "blended flag
is the path toward making composed circuits determination" and Verilog-A for "simple"
by joining countless based circuits into a outline; the last was as of late affirmed (June
single chip. VLSI began in the 1970s when 1996) by the leading body of Open Verilog
complex semiconductor and correspondence International and is currently under thought
progressions were being delivered. The chip by the IEEE. Likewise, work is in progress
is a VLSI contraption. The term is no longer to computerize the confirmation of
as consistent as it once may have been, as "comparability conduct and synthesizable
chips have extended in desire quality into determinations" (see the Cambridge site
the immense number of transistors. VLSI beneath) to which Verilog promptly loans
stays for "Significant Scale Integration". itself.
This is the field which incorporates
II.EXISTING SYSTEM
squeezing progressively method of
reasoning devices into smaller and more The Existing adder layout follows
diminutive areas. As a result of VLSI, that of a traditional ripple deliver adder,
circuits that would have taken board stacked however with a brand new Layout optimized
with space would now have the capacity to to QCA era. The proposed adder layout
be put into a little space couple of shows that a completely excessive delay
millimeters over! This has opened up a cans be acquired with an optimized layout.
noteworthy opportunity to do things that This is in contrast to the conventional ripple
were unreasonable already. deliver adder. To keep away from confusion,
the brand new layout is known as the Carry
In 1989, Gateway Design Flow Adder (CFA) here. In this Carry Flow
Automation (and rights to Verilog) was Adder occupy more Number of gate Counts
acquired by Cadence who place Verilog in and More Delay.
people in general area in the next year. This
FULL ADDER:
move did much to advance the utilization of
Verilog since different organizations could We saw how a 1/2 adder may be
create options instruments to those of used to decide the sum and deliver of two
Cadence which, thusly, enabled clients to input bits. What if we have three input
embrace Verilog without reliance on a bits—X, Y, and CI , in which CI is a convey
solitary (basically workstation-device) in that represents the deliver-out from the
provider. In 1992, work started to make an previous much less great bit addition. In this
IEEE standard (IEEE-1364) and in situation, we've got what's known as a
December 1995 the last draft was affirmed.
FULL ADDER—a circuit that provides 3
one-bit values. These values are the addends
X and Y, and deliver-in C.

BCD Adder
Plan a direct BCD digit adder
utilizing a four piece input, five piece yield
combinational rationale. The four piece
inputs are the two BCD input digits An and
B in addition to the decimal convey input
Cin and the five piece yields are the BCD
digit of the decimal total S in addition to the
decimal do Cout.
For instance, to include (6 + 7 = 13),
this task is meant (0110 + 0111 = 10011)
BCD. The yield result (10011) BCD is the
BCD portrayal of the decimal number 13. Fig: 2.6 Block diagram for BCD adder
The hugest piece is the decimal convey yield
This adder is intended to help both
produced from the expansion task, while
twofold and decimal increases. A binary
alternate bits are the BCD summation digit.
carry look-ahead adder (CLA) is utilized to
Reality table for all yield rationale capacities
include two info operands, which are either
is built for every single conceivable blend of
double or decimal numbers. The
the sources of info. Since the sources of info
consequence of the parallel CLA is the right
are nine bits, the quantity of conceivable
outcome for twofold sources of info;
blends is 24 = 16.
however it should be amended for decimal
Huge numbers of these mixes are
information sources. This proposed design
legitimate since 4-bit number can take any
requires fewer regions contrasted with
an incentive from 0 to (15)10. For the
different setups.
situation when the info isn't legitimate, the
yield is set to couldn't care less.
The first adder configuration is the
The two information BCD digits are
conventional decimal adder. For Compare to
thought to be A =a3a2a1a0 and B =
proposed system
b3b2b1b0. The yield comprises of the BCD
 Low operation speed and more
digit aggregate S = s3s2s1s0 and the decimal
carry output. Delay

 Adders can be implemented in larger


Area
The execution and thickness of IC architecture in Fig. 1: They first add the
innovation is expanding effectively with input digits in binary format and then
CMOS gadgets for recent decades, however perform the conversion to BCD by adding 6
at nanometer scale they are confronting new if they obtained binary result is greater than
difficulties, for example, short channel 9 and 0 otherwise.
impacts like deplete actuated boundary
bringing down, punch-through, speed
immersion, hot transporter impacts, sub-
edge spillage streams and so on .

To defeat the restrictions of CMOS Fig. 1. Structure of the BCD adders.


innovation, elective nano electronic
advancements have been proposed by From the logic point of view, the
scientists to concoct another innovation aforementioned designs mainly differ from
which can work at nanometer each other in the adder structure used. In
measurements; in those the International fact, ripple-carry adders are utilized in [24]
Technology Roadmap for Semiconductors and [25], whereas the two implementations
(ITRS) has distinguished new advances to presented in [23] exploit the carry-flow[4]
supplant the transistor based innovation in and the carry-look-ahead [3] architectures.
future. Maybe a couple of them are
III. PROPOSED SYSTEM
Resonant Tunneling Diodes (RTD),
Quantum dab Cellular Automata (QCA) and
The BCD adder here presented follows the
Single Electron Transistor (SET). Out of
traditional top-level structure illustrated in
every one of these advancements QCA is by
Fig. 1, but it exploits the novel logic
all accounts appropriate novel figuring
expressions demonstrated in the following
innovation to supplant the ordinary CMOS
by Theorems 1 and 2.
innovation.
As the main result, the proposed
The fundamental logic gates
approach leads to the best tradeoff between
available within the QCA technology are the
the overall occupied area and the speed
inverter and the MG. Given three inputs a, b,
performances. To understand the new design
and c, the MG performs the logic function
strategy, let us examine first the 4-b binary
reported in (1) provided that all input cells
adderADD1. It receives the digits dA(3:0)
are associated with the same clock signal
and dB(3:0) and the carry cin as inputs and
clkx, whereas the remaining cells of the MG
computes the binary results bcout and
are associated with the clock signal clkx+1
bS(3:0). For QCA-based rippling adders, the
optimal logic structure for propagating a
carry Ci through a single bit position is
represented by (2a) that introduces only one
The 1-digit BCD adders previously MG between Ci and Ci+1.
proposed in [23]–[25] use the top-level
Consequently, the propagation of Ci
through two bit positions would require two
cascaded MGs to obtain the carry Ci+2.
Conversely, as discussed in [6] and given in
(2b), by exploiting the auxiliary generate
and propagate signals gi = dAi · dBi and pi The decimal sum dS(3:0) is
= dAi · dBi, the carry Ci+2 can be computed computed by adding bS(3:0) to the
by propagating Ci through just one MG. correction operand corr(3:0) that is equal to
Theorem 1 demonstrates a novel way to 6 when bS(3:0) > 9; otherwise, it is set to 0.
propagate Ci through two consecutive bit Due to this, dS0 = bS0 + corr0 = bS0, which
positions that also introduces just one MG trivially proves the correctness of (7a). To
between Ci and Ci+2 but avoiding the demonstrate the remaining equations, let us
computation of gi and pi. consider the binary outputs of ADD1 and
their corresponding BCD representation.
When bS(3:0) > 9, dcout = 1 and the
operand corr(3:0) can be trivially obtained
by setting corr3=corr0 = 0 and corr2 = corr1
= dcout. Considering that corr0 is always
equal to 0, it is easy to understand that
adding bS0 and corr0 will always produce a
zero carry-out. Therefore, dS1 can be
defined as the XOR between bS1 and dcout.

Fig. 2. New ADD1 module.


The equations demonstrated earlier RTL Schematic:
have been exploited to design the correction
module CL and the 4-b adder ADD2, as
illustrated in Fig. 3. It is worth noting that
the proposed circuit allows transforming the
binary results coming from ADD1 to the
BCD format through only four cascaded
MGs, which are well below the eight and
seven required by the ADD2 adders used
with the same objective.

TECHNOLOGY Schematic:

Fig. 3. Module CL and ADD2 of the new BCD adder.

SIMULATION Results:

Fig. 4. n-digit BCD adder.

V.CONCLUSION
IV. RESULTS
This paper displays an inventive
AREA Report:
thought regarding convey chain compose
calculations for including BCD numbers.
New revision rationale is proposed to
configuration single and multi-digit BCD
adders and executed utilizing QCA. The
proposed configuration is essentially quicker
contrasted with the regular plans and Computer., vol. 58, no. 6, pp. 721–727, Jun.
furthermore more productive for decimal 2009.
number juggling expansion. In this venture,
we have thought about natives in QCA and [5] V. Pudi and K. Sridharan, “Efficient
have introduced an effective QCA plan for a design of a hybrid adder in quantum dot
n-bit BCD snake. The BCD snake worked in cellular automata,” IEEE Trans. Very Large
the RCA mold, yet it could spread a bring Scale Integr. (VLSI) Syst., vol. 19, no. 9, pp.
signal through various fell MGs 1535–1548, Sep. 2011.
fundamentally lower than regular RCA [6] S. Perri, P. Corsonello, and G.
adders. Thus, from the outcomes we can see Cocorullo, “Area-delay efficient binary
that the QCA viper will involve fewer zones adders in QCA,” IEEE Trans. Very Large
than the ordinary adders and furthermore Scale Integr. (VLSI) Syst., vol. 22, no. 5, pp.
deliver less defer when contrasted with the 1174–1179, May 2014.
typical snake. Subsequently, the proposed
configuration has less deferral, and this [7] L. Lu,W. Liu,M. O’Neill, and E. E.
outline can be utilized in all rapid BCD Swartzlander, Jr., “QCAsystolic array
adder circuits. design,” IEEE Trans. Comput., vol. 62, no.
3, pp. 548–560, Mar. 2013.

[8] S. Perri, P. Coronels, and G. Cocorullo,


VI. REFERENCES
“Design of efficient binary comparators in
[1] C. S. Lent, P. D. Tougaw, W. Porod, and quantum-dot cellular automata,” IEEE
G. H. Bernestein, “Quantum cellular Trans. Nanotechnol., vol. 13, no. 2, pp. 192–
automata,” Nanotechnology, vol. 4, no. 1, 202, Feb. 2014.
pp. 49–57, 1993. [9] S. Perri and P. Corsonello, “New
[2] V. Pudi and K. Sridharan, “New methodology for the design of effic ient
decomposition theorems on majority logic binary addition in QCA,” IEEE Trans.
for low-delay adder design in quantum dot Nanotechnol., vol. 11, no. 6, pp. 1192–1200,
cellular automata,” IEEE Trans. Circuits Jun. 2012.
Syst. II, Exp. Brief , vol. 59, no. 10, pp. [10] C. A. Krygowski et al., “Functional
678–682, Oct. 2012. verification of the IBM system z10
[3] H. Cho and E. E. Swartzlander, Jr., processor chipset,” IBM J. Res. Dev., vol.
“Adder design and analyses for quantum-dot 53, no. 1, pp. 1–11, Jan. 2009.
cellular automata,” IEEE Trans.
Nanotechnol., vol. 6, no. 3, pp. 374–383,
May 2007.

[4] H. Cho and E. E. Swartzlander, Jr.,


“Adder and multiplier design in quantum-
dot cellular automata,” IEEE Trans.

You might also like