Effective Area and Delay Optimized Three-Operand

Binary Adder
V.Srinivasa rao G.Prasanna kumar V.Mervin Lincoln R.Viswanadham

Dept of ECE Dept of ECE Dept of CSE Dept of ECE

Shri Vishnu Engineering Vishnu Institute of Tech AU College of Engg BVRIT for women

college for women Bhimavaram Visakhapatnam Hyderabad

Bhimavaram, AP, India AP, India AP, India Telangana,India

Abstract
In the advanced plan circuits routinely contains at least one number juggling tasks. In this
viper assumes an essential part and known to be a significant component in numerous
applications particularly in computerized signal handling and chip. Region, deferral, and
power utilization are basic variables in the plan of quick adders, and they address the
compromises that fashioners should consider. Three-operand parallel viper is utilized to play
out the particular math in different cryptography and pseudorandom bit generator (PRBG)
calculations. In the PC design. Totally, the ascent in processor execution throughout the years
has to be sure accompanied a critical development in both equipment and programming
intricacy. Expanding intricacy prompts huge advancement costs, trouble with testability,
certainty and diminished versatility by utilizing Equal Prefix three-operand paired adder.To
tackle these issues, proposing another strategy for planning three Operand parallel viper
utilizing changed convey skip adder. The structure is depend on the link and the improvement
plans with the Traditional CSKA structure and subsequently signified by CI-CSKA. This
design can utilize less complex convey skip rationales. This design utilizes AOI/OAI
compound doors rather than 2:1 multiplexers. At the point when looked at Equal Prefix three-
operand paired adder, CI-CSKA comprises of less semiconductors, have less postponement,
region and more modest power utilization.

Key words: Adder, CSKA, pseudorandom bit generator (PRBG)

I. Introduction

In the set of experiences, the quickest two operand snake strategies are equal prefix or logarithmic
prefix adders [16],[17]. There are six distinct geographies, like Brent-Kung, Sklansky, Knowles,
Ladner-Fischer, Kogge-Stone (KS) and Han-Carlson (HC) for these viper strategies. Han-Carlson is
the quickest one among all when touch size increments (for example n > 16) [1], [2]. Karthik.D
proposed a strategy in which they are changing the construction of the regular convey skip viper and
they are supplanting the middle phases of the snake with equal prefix snake (PPA). In this paper,
rather than PPA, a 8 bit larger part entryway based viper has been utilized. For performing recreation,
Xilinx ISE instrument and Modelsim has been utilized [14],[15]. Subsequently, the idea of equal
prefix adders, otherwise called logarithmic or convey look forward adders, is a deep rooted method in
computerized circuit plan for upgrading the basic way defer in two-operand adders [16],[17]. Totally,
adders assume a basic part in Number-crunching Rationale Units (ALUs), which are key parts of
processors liable for performing math and rationale tasks [18], [11]. Upgrading the speed and
decreasing the power/energy utilization of adders straightforwardly influence the general exhibition
and productivity of processors. In view of this, the paper is coordinated as follows. In segment 2
leaving Equal Prefix three-operand twofold viper is talked about. In segment 3 proposed three
Operand double snake utilizing altered convey skip viper is made sense of. Reenactment results are
attracted Segment 4. In segment 5 end and comments are summed up.

II. Existing work

To play out the measured math, Equal Prefix three-operand double snake has been utilized. So, this
snake procedure is known as equal prefix viper. This viper contains the four-stage structures named as
spot expansion rationale, base rationale, PG (spread and produce) rationale and aggregate rationale,
rather than three-stage structures in prefix snake to figure the expansion of three twofold information
operands. The logical expressions of all these four stages are defined as follows :

All through these stages, there is a convey engendering system where the complete from one phase is
taken care of into the convey in of the following stage. In the primary stage (bit-expansion rationale),
the bitwise extension of three n-digit twofold info operands is performed with the group of full
adders. As displayed in fig 1,sum and convey will create after allotting contributions to the principal
stage full viper. Legitimate outline of the piece expansion rationale is displayed in Fig. 2. In second
stage, the produce (Gi) and engender (Pi) signals are created by utilizing the main stage yield signals
total and convey. Aggregate came from current full viper and convey came from right-contiguous full
snake. Here, "squared saltire-cell" model has been utilized to address Gi and Pi signals as displayed in
Fig.1 and Fig. 2.And there are n +1 number of saltire-cells in the base logic stage. And its logical
expression is

In the Equal Prefix three-operand parallel adder, the outside convey input signal (Cin ) is consider as
the contribution to base rationale while processing the G0G0 (S0 1 • Cin ).And it tends to be
considered as the primary saltire-cell of the base rationale. The third stage shows the "create and
spread rationale" (PG) via convey calculations. In this stage pre-processes the convey digit and is the
blend of dark and dim cell rationales. Significant sensible graph shows in Fig.2.that figures the
convey create Gi: j and engender Pi: j signals with the accompanying legitimate articulation,

In the Equal Prefix three-operand parallel adder, the outside convey input signal (Cin ) is consider as
the contribution to base rationale while processing the G0G0 (S0 1 • Cin ).And it tends to be
considered as the primary saltire-cell of the base rationale. The third stage shows the "create and
spread rationale" (PG) via convey calculations. In this stage pre-processes the convey digit and is the
blend of dark and dim cell rationales. Significant sensible graph shows in Fig.2.that figures the
convey create Gi: j and engender Pi: j signals with the accompanying legitimate articulation,

Fig.1.Parallel PrefixThree-operand binary adder

Fig.2.Logical diagram of bit addition, base logic, sum logic, black-cell and grey-cell
 III. Proposed work
A Carry-Skip Adder (CSKA) is indeed a technique used for binary addition, and it's an extension of
the carry-look ahead adder (CLA). While the carry-look ahead adder is efficient for two-operand
addition, the carry skip adder is designed to handle the addition of three or more operands.Based on
the drawback of the CSKA, CLA has more delay and power consumption. The critical path delay in
three-operand adders directly affects the latency of modular addition operations in congruential
modular arithmetic-based cryptography and PRBG (Pseudo random bit generator) architectures.
Designers must consider these factors carefully to strike the right balance between speed, security,
and overall system performance. In these cryptographic systems, the speed of arithmetic operations,
particularly modular addition, is crucial for their efficiency and security. Here introducing a new
adder named as modified carry skip adder to perform the three-operand binary addition. In this,
simply modifying the structure of the conventional CSKA in two stages based on the reduction of
delay and power. In the first stage, the proposed design makes use of AOI (and-or-invert) and OAI
(or-and –invert) compound gates in the skip logic.A carry-skip adder is a design choice that can
influence the overall efficiency and performance of the adder. It's often made in the context of
optimizing for area and critical path delay in specific technology or design constraints. This will
reduces the critical path delay considerably but not the power as expected. Hence in the second stage,
designing an 8-bit adder using majority gate and replacing the middle 8-bit RCA blocks with the
designed one.

The Regular CSKA design can be changed over as altered convey skip viper by the implication and
the link plans [10],[13]. The recently planned structure is meant by CI-CSKA. The less difficult
convey skip rationales can be gotten by this recently planned structure. The convey skip rationale,
replaces 2:1 multiplexers by AOI/OAI compound doors (Fig.3). Here hardly any number of semi
conductors are utilized to carry out the doors that have lower region, deferral and power utilization. In
this construction, as the bring proliferates through the skip rationales, it becomes supplemented.
Consequently the supplement of the convey is created at the result of the skip rationale of even stages.
In standard cell libraries, skip rationales is the transforming elements of these doors because of this
reason we are utilizing both AOI and OAI compound entryways here. It is required for an inverter
entryway, which expands the deferral and power utilization, is disposed of. As displayed in Fig 2, on
the off chance that an AOI is utilized as the skip rationale, the following skip rationale ought to utilize
OAI entryway. Here RCA block have a convey contribution of nothing (utilizing the link approach)
by this way the skip rationale (AOI or OAI compound entryways) can sidestep the zero convey input
until the zero convey input spreads from the comparing RCA block. The utilization of the static AOI
and OAI doors (six semiconductors) prompts diminishes in the space use and postponement of the
skip rationale. Here the (Q − 1) FAs in the customary design are supplanted with a similar number of
HAs in the proposed structure diminishing the region use.

The delay (TD) can be expressed as

Certain types of gates, such as AOI and OAI gates, may offer advantages in terms of power
consumption compared to multiplexers. However, the actual power efficiency depends on various
factors, and designers need to carefully consider these factors when making design choices to
optimize power consumption in a specific context.

Fig. 3.Three Operand binary adder using Modified Carry Skip Adder

Here we designing the an 8 bit adder using majority gate and replacing the middle 8 bit RCA blocks
with the designed one in the second stage to getting less delay and less power consumptions. Here
majority gates like only basic gates AND gate, OR gate etc used to design the adder .Majority gate is
the one its output will be one if the majority of the inputs are one. This 8 bit adder replaces the
intermediate stage of the 16 bit carry skip adder.

Fig.4.High Speed Energy Efficient Three Operand binary adder using modified Carry Skip

Adder

IV. Results

Proposed Method Results

a) Simulation results
For the three operand twofold snake, reproduction results are displayed in fig 5. The information
sources are assigned as a, b, c and result assigned as operation. Operation has communicated as the
amount of the information sources. One potential mix of data sources are a=8, b=2, c=15 creating a
result of op=25 which is in decimal configuration. By utilizing two "two operand adjusted convey
skip snake", expansion among operands a, b and c has been occurred. Moderate signs of proposed
technique addressed by staying variable 'OP1".

Fig.5 Recreation results for three operand parallel snake with inputs a, b, c
what's more, yield assigned as operation which is an amount of those sources of info
b) Area utilization summary

Results displayed in fig 6 are for three operand parallel viper with inputs a, b, c and
operation as result which is the amount of those data sources

Fig.6 Region usage rundown for the three operand double snake with inputs a, b, c
furthermore, operation as result which is amount of those data sources

c) Schematic diagram
 Fig 7 shows region usage results for the three operand twofold viper with inputs a, b,
c sources of info and operation as result which is the amount of those sources of info

Fig.7 Schematic graph for the three operand paired viper with inputs a, b, c
information sources and operation as result which is the amount of those sources
of info

d) Comparison of results

The table 1 shows the Comparison between existing and proposed methods. The no. of

gates required in the proposed method are 44 and the delay time is 38.227ms.

Parameter Parallel Prefix Adder Modified Carry Skip

Adder

Area (No.of 135 44

gates
required)
Delay 57.606 ms 38.227 ms

Table1: Comparison between existing and proposed methods

V. Conclusion

The noticed contrasts in proliferation deferral and region between the Adjusted Convey Skip Viper
and the Equal Prefix Snake probably come from the particular plan decisions and advancements made
in every engineering. The decision between them relies upon the necessities and qualities of the
application or responsibility. In the Equal Prefix three-operand double snake, third stage is the half
and half Han-Carlson adder (HHC3A) rationale which diminishes the basic way postpone in the
request for O(log2 n) yet builds the region in the request for O(n log2 n). In any case, the proposed
three operand double snake utilizing adjusted convey skip viper is altogether lessens the region and
deferral of the plan. What's more, it gives productive power results from fast energy effective three
operand parallel snake utilizing adjusted convey skip viper.

References

[1] Amit Kumar Panda, Rakesh Palisetty and Kailash Chandra Ray,"HighSpeed Area Efficient VLSI
Architecture of Three-Operand Binary Adder", IEEE Transactions on Circuits and Systems I: Regular
Papers, pp. 3944-3953, Aug 2020.

[2] K. S. Pandey, D. K. B. N. Goel, and H. Shrimali, “An ultra-fast parallel prefix adder” in Proc.
IEEE 26 th Symp. Comput. Arithmetic (ARITH), Kyoto, Japan, Jun. 2019.
[3] Duncan J. M. Moss , David Boland, and Philip H. W. Leong, “A Two-Speed, Radix-4, Serial–
Parallel Multiplier”, IEEE Transactions On Very Large Scale Integration (VLSI) Systems, Volume:
27 , Issue: 4 , April 2019, Page no. 769 – 777.

[4] Martin Kumm and Johannes Kappauf.” Advanced Compressor Tree Synthesis for FPGAs”, IEEE
Transactions on Computers ,Volume: 67 , Issue: 8 , Aug 1,2018.

[5] Suhas B. Shirol, S. Ramakrishna and Rajashekar B. Shettar, “Design and Implementation of
Adders and Multiplier in FPGA Using Chip Scope: A Performance Improvement”, Information and
Communication Technology for Competitive Strategies pp 11-19,31, August, 2018.

[6] S. D. Thabah; M. Sonowal and P. Saha , “Experimental Studies On Multi-Operand Adders”,

International Journal On Smart Sensing And Intelligent Systems Vol. 10, No. 2, June 2017.

[7] J. Hormigo, J. Villalba, and E. L. Zapata, “Multi operand Redundant Adders on FPGAs,”
submitted to IEEE Transactions on Computers, vol. 62, no. 10, pp. 2013– 2025, April,2013.

[8] Soumya ganguly etc. “A Reconfigurable Parallel Prefix Ling Adder with modified Enhanced
Flagged Binary logic”, IEEE Microelectronics and Electronics (PrimeAsia), 2012.

[9] F. de Dinechin, H. D. Nguyen and B. Pasca, Pipelined FPGA Adders, LIP Research Report no.
Ens l00475780, Apr. 2010.

[10] J. Hormigo, M. Ortiz, F. Quiles, F. J. Jaime, J. Villalba and E.L. Zapata, “Efficient
Implementation of Carry Save Adders in FPGAs”, 20th IEEE international Conference on
Application-Specific Systems, Architectures and Processors, pp. 207–210, Jul. 2009.

[11] W. Kamp, A. Bainbridge-Smith, and M. Hayes, “Efficient Implementation of Fast Redundant

Number Adders for Long Word- Lengths in FPGAs”, in 2009 International Conference on Field-
Programmable Technology (FPT). IEEE, 2009, pp. 239–246.

[12] M. Ortiz, F. Quiles, J. Hormigo, F. J. Jaime, J. Villalba, and E. L. Zapata, “Efficient

Implementation of Carry Save Adders in FPGAs,” in IEEE International Conference on Application-
specific Systems Architectures and Processors (ASAP), 2009, pp. 207–210.

[13] H. Parandeh-Afshar, P. Brisk, and P. Ienne, “Efficient Synthesis of Compressor Trees on

FPGAs”, in Asia and South Pacific Design Automation Conference (ASPDAC), IEEE, 2008, pp.
138–143.

[14] G Prasanna kumar and Krishna T Battula, “Low Complexity Algorithm For Updating The
Coefficients Of Adaptive Filter”, International Journal of Advanced Research in Computer
Engineering & Technology, Volume 4, Issue 3, pp. 63-69, May – June, 2013.

[15] Jin-Fu Li, Jiunn-Der Yu, and Yu-Jen Huang, "A Design Methodology for Hybrid Carry-look
ahead/Carry-Select Adders with reconfigurability", in IEEE International Symposium on Circuits and
Systems, Vol. 1, pp. 77-80, May-2005. 79

[16] R. D. Kenney and M. J. Schulte, “High-Speed Multi operand Decimal Adders”, IEEE
Transactions on Computers, vol. 54, no. 8, pp. 953-963, Aug. 2005.
 [17] J. Villalba, J. Hormigo, J. M. Prades and E. L. Zapata, “On–line Multi operand Addition Based
on On–line Full Adders”, in Proc. Int. Conf. on Application Specific Systems, Architecture Processors
(ASAP'05), pp. 322-327, 2005.

[18] G Prasanna kumar, Krishna T Battula and Pushpa Kotipalli, “Radix-4 Feed Back Design using
Four Parallel adders with efficient Reordering module for Fast Fourier Transform”, Journal of
Advanced Research in Dynamical and Control Systems 12(3):593-598,jan 2020.