SlideShare ist ein Scribd-Unternehmen logo
1 von 10
Downloaden Sie, um offline zu lesen
INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN
  International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976
  – 6480(Print), ISSN 0976 – 6499(Online)AND TECHNOLOGY (IJARET) IAEME
                  ENGINEERING Volume 3, Number 2, July-December (2012), ©
ISSN 0976 - 6480 (Print)
ISSN 0976 - 6499 (Online)                                             IJARET
Volume 3, Issue 2, July-December (2012), pp. 01-10
© IAEME: www.iaeme.com/ijaret.html
Journal Impact Factor (2012): 2.7078 (Calculated by GISI)
                                                                     ©IAEME
www.jifactor.com




            HIGH PERFORMANCE PARALLEL PREFIX ADDERS WITH
                       FAST CARRY CHAIN LOGIC
              Anitha R1,                                       V Bagyaveereswaran2
             AP(Sr), SENSE,                                   AP(Sr), SELECT

                     VIT University, Vellore – 632014, TamilNadu, India.
  1                                                   2
      eranitharavi@gmail.com,                           bagyaveereswaran@gmail.com,

  ABSTRACT

  Binary adders are the basic and vital element in the circuit designs. Prefix adders are the
  most efficient binary adders for ASIC implementation. But these advantages are not
  suitable for FPGA implementation because of CLBs and routing constraints on FPGA.
  This paper presents different types of parallel prefix adders and compares them with the
  Simple Adder. The adders are designed using Verilog HDL code and simulated and
  synthesized using Xilinx ISE13.2 software tool and Cadence RTL compiler. Among all
  the adders, Kogge-Stone adder provides better performance in ASIC implementation but
  it is not suitable for FPGA implementation. In order to make it suitable for FPGA
  implementation, Kogge-Stone adder is modified using fast carry logic technique. The
  modified adder provides better performance over the Simple adder for the higher order
  bit widths.
  Keywords- FPGA, Binary addition, Carry tree adders, Prefix computation, Prefix
  addition.

       I.      INTRODUCTION
      Adders are the most important element in all the digital circuit design. Among the
  various types of adders, Carry Tree Adder which is also known as Parallel Prefix Adders
  provide high performance in terms of speed in ASIC implementation. The Carry Tree
  adder performs three stage operations such as Pre-computation stage, Prefix-
  computation stage and Post-computation stage. The Pre-computation stage generates and
  propagates the carry signal, the Prefix computation stage generates the carry signal using
  prefix cells and the Post-computation stage generates the sum. This is shown in Fig.1
  and the equation for these three stage addition operation is given in equation 1, 2 &3.
      Field Programmable Gate Array [10] offers low cost and less development time over
  ASIC implementation. In this paper, the most efficient adder i.e., the carry tree adder
  like Kogge-Stone, Brent-Kung, Ladner-Fischer and Han-Carlson adders are designed
  and implemented on FPGA.


                                               1
International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976
– 6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME

    The problems involved in FPGA implementation are investigated and the possible
FPGA architecture which can make the Carry Tree Adder to provide high performance
over the Simple adder is explored. The possible trade-offs like area, power, delay,
interconnect count and fan-out involved in the adders are examined.




                               Fig.1. Block Diagram of Prefix addition

       The three stages addition consists of the following computations:

              •   Pre-computation:        Gm:n=An and Bn, G0=cin;  Pm:n=An xor Bn, P0=0;
                  ……...(1)
              •   Prefix-computation: (Gm, Pm) ο (Gn, Pn)= (Gn:k + Pn:k· Gk-1:n, Pn:k·Pk-1:j)
                  (or) Gm:n=Gn:k + Pn:k· Gk-1:nPm:n=Pn:k·Pk-1:j ……...(2)

              •   Post-computation: Sn=Pn xor Gn-1:0                     ……...(3)

 II.      CARRY TREE ADDERS
    The various types of carry tree adders are shown in Fig.2. Each carry tree adder
consists of three parts. They are: Upper part, Middle part, Lower part. Using these parts
the carry tree adders computes N outputs from N inputs as shown in Fig.1. The Upper
part generates and propagates the carry signal from the input to the prefix stage using the
formula given in equation (1). The propagated and generated carry signals are combined
using the associate operator “ο”. This operation is performed in the middle part using the
formula given in equation (2). The Middle part consists of prefix cells such as black
cells, grey cells and white buffers [1]. The arrangement of these prefix cells in different
order results in various types of Carry Tree adders. where the carry signals need not to
be propagated. Such operations are performed by grey cells. The grey cells generate the
carry signal only.Black cell generates and propagates the carry signal. There are some
places The white buffers are used to reduce the loading effect for the further stages. The
Lower part generates the overall sum using the formula given in equation (3).
    Depends on the arrangement of prefix cells, the carry tree adders involves in trade-
offs like area, power, delay, interconnect count, fan-out and logic depth [3 & 4]. Fig.2
(a) shows the Brent-Kung The dark black line in the figure indicates the critical path of
the adder. The critical path for Han-Carlson and Kogge-Stone are less. So these two

                                                 2
International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976
   – 6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME

   adders are expected to be the fastest adder. The power utilized by all the Carry Tree
   Adder is more than the Simple Adder.




                                        (a)Brent Kung




                                       (b) Kogge Stone
minimum area and maximum logic depth. Due to the maximum logic depth, the delay of this
adder is expected to be high. Fig.2 (b) shows the Kogge-Stone adder. adder. It is designed in
such a way that it provides It provides maximum interconnect count and area but minimum
logic depth and fan-out. Ladner-Fischer adder as shown in Fig.2 (c) provides minimum logic
depth with improved area. Han-Carlson adder as shown in Fig. 2(d) provides minimum logic
depth and minimum interconnect count.




                                                3
International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 –
6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME




                                        (c) Ladner Fischer




                                          (d)Han Carlson

                                   Fig.2. (a-f) Carry Tree adders

   Simple adder is designed using Verilog HDL ‘+’ operator. The carry chain structure on
FPGA makes Simple Adder to provide high performance. But this is not an efficient adder for
VLSI implementation. In this paper, Carry Tree Adder is compared with Simple Adder for
both ASIC and FPGA implementation.

III.   RELATED RESEARCH AND PROPOSED WORK
    The different types of carry tree adders are discussed in [4]. In [5], the authors
implemented different types of adders like Simple Adder, Carry Look Ahead Adder, Carry
Skip Adder, and Carry Select Adder on the Virtex2 FPGAs and found that the Simple Adder
provides better performance. In [3], the authors discussed various parallel prefix networks
design and implementation on a Xilinx Virtex5 FPGA. It is observed that the Simple Adder
provides better performance over the prefix networks for the bit widths up to 256 bits. This is
due to the advantage of the carry chain structure on the FPGA. All these works by different
authors shows that the simple adder provides better performance on FPGA. The area, delay
results for these works depend upon synthesis reports. In [2], the authors described several
Carry Tree Adders implemented on a Xilinx Spartan3E FPGA. It is found that the Kogge
Stone Carry Tree Adder provide better delay performance for the higher order bits. The
results obtained for this paper is similar to those presented in [2].


                                                 4
International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 –
6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME

   Carry Tree Adders are designed, coded, simulated and synthesized and then it is
compared with the Simple Adder. The obtained area, power, delay results of various Carry
Tree Adders are compared with each other and also with the Simple Adder. Among all the
Carry Tree Adders, Kogge-Stone Adder and Han-Carlson Adder is expected to be the fastest
adder in ASIC implementation but not in FPGA implementation.

    In this paper, Kogge-Stone Adder is taken, since it is having minimum fan-out and logic
depth than Han-Carlson Adder, and modified using Fast Carry Logic technique in order to
make it suitable for FPGA implementation [6, 7, 8 & 9]. The addition operation performed by
Simple Adder, which is generated by synthesis tool, is shown in Fig.3 (a). From Fig.3 (a), it
is clear that the Prefix-computation stage of the Simple Adder uses multiplexers. Similarly,
the Prefix-computation stage of Carry Tree Adder is replaced with the Fast Carry logic
technique which uses muxes as shown in Fig.3 (b). The Fast Carry Logic architecture for 4-
bit addition is shown in Fig.3(c). Instead of using Black cells, Grey cells and White buffers to
propagate and generate the carry signals, simple muxes are used. The blocks present in Fast
Carry Logic technique also uses muxes. The input to the Fast Carry Logic is the propagated
and generated carry signal of the Pre-computation stage. The Pre-computation and Post-
computation of the modified adder is similar to that of the normal carry tree adders.

                                       IV.   RESULTS

       The delay, power and cell area results obtained by synthesizing the designed adders
for 128bits using Cadence RTL compiler (90nm technology) is shown in Table 1, 2 & 3. The
abbreviations used in the table are: KS for the Kogge Stone Adder, BK for the Brent Kung
Adder, LF for the Ladner Fischer Adder and HC for Han Carlson Adder.




                                        Fig.3(a)SimpleAdder




                                               5
International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 –
6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME




                                        Fig.3(b)Carry Tree Adder




                        Fig.3(c) Fast Carry Logic for 4-bit Carry tree addition

The delay is measured in terms of nanoseconds, power in terms of nanowatt. From the
results it is found that the Carry Tree Adders provide best delay performance than the
Simple adder. Among the Carry Tree Adders, Kogge-Stone Adder and Han-Carlson
Adder provide best delay as it is expected but the area and power utilized by those
adders are more. Comparatively, Brent-Kung Adder and Ladner-Fischer Adder
utilizes less area and power.




                                                  6
International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 –
6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME


               Table 1: Delay Results of Carry Tree Adders compared with Simple Adder




               Table2: Power Results of Carry Tree Adders compared with Simple Adder




              Table3: Cell Area Results of Carry Tree Adders compared with Simple Adder




     Fig.4 shows the simulated delay results of the adders for the bit widths up to 128bits
using Xilinx ISE13.2 software tool. From the Fig.4, it is found that the Simple Adder provide
best delay performance over the Carry Tree Adder. The obtained delay result is entirely
different from the result shown in Table 1. This is because of the presence of Fast Carry chain
structure on Xilinx FPGA. Among the Carry Tree adders, Kogge-Stone Adder provides best
delay as it is expected.

                                                 7
International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 –
6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME

Fig.5(a-d) shows the delay results of Kogge-Stone Adder, Kogge-Stone Modified Adder and
Simple Adder for the FPGA families like Spartan-3E, Virtex-4, Virtex-5 and Virtex-6 Lower
power. Some of the 64-bit adder structure cannot be fitted in to all the devices under this
family.




            Fig. 4 Simulated Delay Results of Carry Tree Adders compared with Simple Adder

Depends on the adder structure, the device and package has been selected. From the
Fig it is found that, for Spartan-3E FPGA, Kogge-Stone adder provide best
performance after it reaches 256 bits whereas Modified adder provides best
performance after it reaches 128bits, for Virtex-4 FPGA, Kogge-Stone adder provides
best performance after itreaches 128bits whereas Modified adder provides best
performance from 128bits, for Virtex-5 FPGA, Kogge-Stone adder provides best
performance after it reaches 256bits whereas Modified adder provides best
performance from 128bits, for Virtex-6 FPGA, it is able to reduce the delay of Carry
Tree Adder but Simple Adder provide better delay performance.




                                              (fig. 5.a)
                                                  8
International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 –
6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME

 V. CONCLUSION

    This paper presents different types of Carry Tree Adders. Kogge Stone adder is
the fastest carry tree adder in VLSI implementation but it provides different result for
the FPGA implementation.




                                          (Fig.5.b)

In order to make it suitable for FPGA implementation, the prefix computation stage is
modified using “Fast Carry Logic”.




                                           (Fig.5.c)




                                              9
International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 –
6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME




                                            (Fig.5.d)

                                    Fig. 5(a-d) Simulated Delay results

 The obtained delay results are compared with the Simple Adder for the various FPGA devices
like Spartan3E, Virtex4, Virtex5, Lower power Virtex6. The Lower power Virtex6 FPGA
provides best delay compared to that of all the FPGA devices. By using carry logic technique
the Carry Tree Adders are able to provide better delay performance on FPGA over the Simple
Adder for the higher order bit widths.

REFERENCES

   1. N. H. E. Weste and D. Harris, CMOS VLSI Design, 4th edition, Pearson–Addison-
       Wesley, 2011.
   2. FPGAs David H. K. Hoe, Chris Martinez and Sri Jyothsna Vundavalli, “Design and
       Characterization of Parallel Prefix Adders”, IEEE 43rd Southeastern Symposium
       on system theory, March 2011.
   3. K. Vitoroulis and A. J. Al-Khalili, “Performance of Parallel Prefix Adders Implemented
       with FPGA technology,” IEEE Northeast Workshop on Circuits and Systems, pp. 498-
       501, Aug. 2007.
   4. D. Harris, “A Taxonomy of Parallel Prefix Networks,” in Proc. 37th Asilomar Conf.
       Signals Systems and Computers, pp. 2213–7, 2003.
   5. M. Becvar and P. Stukjunger, “Fixed-Point Arithmetic in FPGA,” Acta Polytechnica,
       vol. 45, no. 2, pp. 67-72, 2005.
   6. Spartan-3E Generation FPGA User Guide, Xilinx Inc., June 2011, UG331 (v1.8):
       http://www.xilinx.com/support/documentation/user_guides/ug331.pdf
   7. Virtex-4 FPGA User Guide, Xilinx Inc., Dec 2008, UG070
       (V2.6):http://www.xilinx.com/support/documentation/user_guides/ug070.pdf.
   8. Virtex-5 FPGA User Guide, Xilinx Inc., May 2010, UG190 (V5.3):
       http://www.xilinx.com/support/documentation/userguides/ug190.pdf.
   9. Virtex-6 FPGA User Guide, Xilinx Inc., Sep. 2009, UG364 (v1.1):
       http://www.xilinx.com/support/documentation/user guides/ug364.pdf.
   10. www.xilinx.com
                                               10

Weitere ähnliche Inhalte

Was ist angesagt?

IRJET - High Speed Inexact Speculative Adder using Carry Look Ahead Adder...
IRJET -  	  High Speed Inexact Speculative Adder using Carry Look Ahead Adder...IRJET -  	  High Speed Inexact Speculative Adder using Carry Look Ahead Adder...
IRJET - High Speed Inexact Speculative Adder using Carry Look Ahead Adder...IRJET Journal
 
Designing of Adders and Vedic Multiplier using Gate Diffusion Input
Designing of Adders and Vedic Multiplier using Gate Diffusion InputDesigning of Adders and Vedic Multiplier using Gate Diffusion Input
Designing of Adders and Vedic Multiplier using Gate Diffusion InputIRJET Journal
 
Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...
Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...
Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...IJERA Editor
 
IRJET- FPGA Implementation of Low Power Configurable Adder for Approximate Co...
IRJET- FPGA Implementation of Low Power Configurable Adder for Approximate Co...IRJET- FPGA Implementation of Low Power Configurable Adder for Approximate Co...
IRJET- FPGA Implementation of Low Power Configurable Adder for Approximate Co...IRJET Journal
 
IRJET- Low Power Adder and Multiplier Circuits Design Optimization in VLSI
IRJET- Low Power Adder and Multiplier Circuits Design Optimization in VLSIIRJET- Low Power Adder and Multiplier Circuits Design Optimization in VLSI
IRJET- Low Power Adder and Multiplier Circuits Design Optimization in VLSIIRJET Journal
 
IRJET - High Speed Approximation Error Tolerance Adders for Image Processing ...
IRJET - High Speed Approximation Error Tolerance Adders for Image Processing ...IRJET - High Speed Approximation Error Tolerance Adders for Image Processing ...
IRJET - High Speed Approximation Error Tolerance Adders for Image Processing ...IRJET Journal
 
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGAEFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGAVLSICS Design
 
Modeling design and_performance_analysis_of_various_8_bit_adders_for_embedded...
Modeling design and_performance_analysis_of_various_8_bit_adders_for_embedded...Modeling design and_performance_analysis_of_various_8_bit_adders_for_embedded...
Modeling design and_performance_analysis_of_various_8_bit_adders_for_embedded...Kunjan Shinde
 
NCRTS'14-IJERT-683-688
NCRTS'14-IJERT-683-688NCRTS'14-IJERT-683-688
NCRTS'14-IJERT-683-688Kunjan Shinde
 
Design of High Speed 128 bit Parallel Prefix Adders
Design of High Speed 128 bit Parallel Prefix AddersDesign of High Speed 128 bit Parallel Prefix Adders
Design of High Speed 128 bit Parallel Prefix AddersIJERA Editor
 
IRJET- Design of Memristor based Multiplier
IRJET- Design of Memristor based MultiplierIRJET- Design of Memristor based Multiplier
IRJET- Design of Memristor based MultiplierIRJET Journal
 
Paper id 37201520
Paper id 37201520Paper id 37201520
Paper id 37201520IJRAT
 

Was ist angesagt? (15)

IRJET - High Speed Inexact Speculative Adder using Carry Look Ahead Adder...
IRJET -  	  High Speed Inexact Speculative Adder using Carry Look Ahead Adder...IRJET -  	  High Speed Inexact Speculative Adder using Carry Look Ahead Adder...
IRJET - High Speed Inexact Speculative Adder using Carry Look Ahead Adder...
 
1 5
1 51 5
1 5
 
Designing of Adders and Vedic Multiplier using Gate Diffusion Input
Designing of Adders and Vedic Multiplier using Gate Diffusion InputDesigning of Adders and Vedic Multiplier using Gate Diffusion Input
Designing of Adders and Vedic Multiplier using Gate Diffusion Input
 
Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...
Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...
Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...
 
IRJET- FPGA Implementation of Low Power Configurable Adder for Approximate Co...
IRJET- FPGA Implementation of Low Power Configurable Adder for Approximate Co...IRJET- FPGA Implementation of Low Power Configurable Adder for Approximate Co...
IRJET- FPGA Implementation of Low Power Configurable Adder for Approximate Co...
 
IRJET- Low Power Adder and Multiplier Circuits Design Optimization in VLSI
IRJET- Low Power Adder and Multiplier Circuits Design Optimization in VLSIIRJET- Low Power Adder and Multiplier Circuits Design Optimization in VLSI
IRJET- Low Power Adder and Multiplier Circuits Design Optimization in VLSI
 
R04605106110
R04605106110R04605106110
R04605106110
 
IRJET - High Speed Approximation Error Tolerance Adders for Image Processing ...
IRJET - High Speed Approximation Error Tolerance Adders for Image Processing ...IRJET - High Speed Approximation Error Tolerance Adders for Image Processing ...
IRJET - High Speed Approximation Error Tolerance Adders for Image Processing ...
 
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGAEFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
 
Modeling design and_performance_analysis_of_various_8_bit_adders_for_embedded...
Modeling design and_performance_analysis_of_various_8_bit_adders_for_embedded...Modeling design and_performance_analysis_of_various_8_bit_adders_for_embedded...
Modeling design and_performance_analysis_of_various_8_bit_adders_for_embedded...
 
NCRTS'14-IJERT-683-688
NCRTS'14-IJERT-683-688NCRTS'14-IJERT-683-688
NCRTS'14-IJERT-683-688
 
Design of High Speed 128 bit Parallel Prefix Adders
Design of High Speed 128 bit Parallel Prefix AddersDesign of High Speed 128 bit Parallel Prefix Adders
Design of High Speed 128 bit Parallel Prefix Adders
 
SFQ MULTIPLIER
SFQ MULTIPLIERSFQ MULTIPLIER
SFQ MULTIPLIER
 
IRJET- Design of Memristor based Multiplier
IRJET- Design of Memristor based MultiplierIRJET- Design of Memristor based Multiplier
IRJET- Design of Memristor based Multiplier
 
Paper id 37201520
Paper id 37201520Paper id 37201520
Paper id 37201520
 

Ähnlich wie High performance parallel prefix adders with fast carry chain logic

Evaluation of High Speed and Low Memory Parallel Prefix Adders
Evaluation of High Speed and Low Memory Parallel Prefix AddersEvaluation of High Speed and Low Memory Parallel Prefix Adders
Evaluation of High Speed and Low Memory Parallel Prefix AddersIOSR Journals
 
Designing and Characterization of koggestone, Sparse Kogge stone, Spanning tr...
Designing and Characterization of koggestone, Sparse Kogge stone, Spanning tr...Designing and Characterization of koggestone, Sparse Kogge stone, Spanning tr...
Designing and Characterization of koggestone, Sparse Kogge stone, Spanning tr...IJMER
 
Design of 32 bit Parallel Prefix Adders
Design of 32 bit Parallel Prefix AddersDesign of 32 bit Parallel Prefix Adders
Design of 32 bit Parallel Prefix AddersIOSR Journals
 
Design and Estimation of delay, power and area for Parallel prefix adders
Design and Estimation of delay, power and area for Parallel prefix addersDesign and Estimation of delay, power and area for Parallel prefix adders
Design and Estimation of delay, power and area for Parallel prefix addersIJERA Editor
 
Analysis of different bit carry look ahead adder using verilog code 2
Analysis of different bit carry look ahead adder using verilog code 2Analysis of different bit carry look ahead adder using verilog code 2
Analysis of different bit carry look ahead adder using verilog code 2IAEME Publication
 
Design Of 64-Bit Parallel Prefix VLSI Adder For High Speed Arithmetic Circuits
Design Of 64-Bit Parallel Prefix VLSI Adder For High Speed Arithmetic CircuitsDesign Of 64-Bit Parallel Prefix VLSI Adder For High Speed Arithmetic Circuits
Design Of 64-Bit Parallel Prefix VLSI Adder For High Speed Arithmetic CircuitsIJRES Journal
 
Design of high speed adders for efficient digital design blocks
Design of high speed adders for efficient digital design blocksDesign of high speed adders for efficient digital design blocks
Design of high speed adders for efficient digital design blocksBharath Chary
 
IRJET- FPGA Implementation of High Speed and Low Power Speculative Adder
IRJET-  	  FPGA Implementation of  High Speed and Low Power Speculative AdderIRJET-  	  FPGA Implementation of  High Speed and Low Power Speculative Adder
IRJET- FPGA Implementation of High Speed and Low Power Speculative AdderIRJET Journal
 
Design the High Speed Kogge-Stone Adder by Using
Design the High Speed Kogge-Stone Adder by UsingDesign the High Speed Kogge-Stone Adder by Using
Design the High Speed Kogge-Stone Adder by UsingIJERA Editor
 
LOGIC OPTIMIZATION USING TECHNOLOGY INDEPENDENT MUX BASED ADDERS IN FPGA
LOGIC OPTIMIZATION USING TECHNOLOGY INDEPENDENT MUX BASED ADDERS IN FPGALOGIC OPTIMIZATION USING TECHNOLOGY INDEPENDENT MUX BASED ADDERS IN FPGA
LOGIC OPTIMIZATION USING TECHNOLOGY INDEPENDENT MUX BASED ADDERS IN FPGAVLSICS Design
 
MODIFIED CARRY SELECT ADDER WITH BKA AND MGDI TECHNIQUE
MODIFIED CARRY SELECT ADDER WITH BKA AND MGDI TECHNIQUEMODIFIED CARRY SELECT ADDER WITH BKA AND MGDI TECHNIQUE
MODIFIED CARRY SELECT ADDER WITH BKA AND MGDI TECHNIQUEIRJET Journal
 
Performance evaluation of full adder
Performance evaluation of full adderPerformance evaluation of full adder
Performance evaluation of full adderIOSRJECE
 
Implementation of Carry Skip Adder using PTL
Implementation of Carry Skip Adder using PTLImplementation of Carry Skip Adder using PTL
Implementation of Carry Skip Adder using PTLIRJET Journal
 
kunjan elsevier paper
kunjan elsevier paperkunjan elsevier paper
kunjan elsevier paperKunjan Shinde
 
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGAEFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGAVLSICS Design
 
Design and Implementation of Different types of Carry skip adder
Design and Implementation of Different types of Carry skip adderDesign and Implementation of Different types of Carry skip adder
Design and Implementation of Different types of Carry skip adderIRJET Journal
 
IRJET- Implementation and Analysis of Hybridization in Modified Parallel Adde...
IRJET- Implementation and Analysis of Hybridization in Modified Parallel Adde...IRJET- Implementation and Analysis of Hybridization in Modified Parallel Adde...
IRJET- Implementation and Analysis of Hybridization in Modified Parallel Adde...IRJET Journal
 
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGAEFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGAVLSICS Design
 

Ähnlich wie High performance parallel prefix adders with fast carry chain logic (20)

IMPLEMENTATION OF 128-BIT SPARSE KOGGE-STONE ADDER USING VERILOG
IMPLEMENTATION OF 128-BIT SPARSE KOGGE-STONE ADDER USING VERILOGIMPLEMENTATION OF 128-BIT SPARSE KOGGE-STONE ADDER USING VERILOG
IMPLEMENTATION OF 128-BIT SPARSE KOGGE-STONE ADDER USING VERILOG
 
Evaluation of High Speed and Low Memory Parallel Prefix Adders
Evaluation of High Speed and Low Memory Parallel Prefix AddersEvaluation of High Speed and Low Memory Parallel Prefix Adders
Evaluation of High Speed and Low Memory Parallel Prefix Adders
 
Designing and Characterization of koggestone, Sparse Kogge stone, Spanning tr...
Designing and Characterization of koggestone, Sparse Kogge stone, Spanning tr...Designing and Characterization of koggestone, Sparse Kogge stone, Spanning tr...
Designing and Characterization of koggestone, Sparse Kogge stone, Spanning tr...
 
Design of 32 bit Parallel Prefix Adders
Design of 32 bit Parallel Prefix AddersDesign of 32 bit Parallel Prefix Adders
Design of 32 bit Parallel Prefix Adders
 
Design and Estimation of delay, power and area for Parallel prefix adders
Design and Estimation of delay, power and area for Parallel prefix addersDesign and Estimation of delay, power and area for Parallel prefix adders
Design and Estimation of delay, power and area for Parallel prefix adders
 
Analysis of different bit carry look ahead adder using verilog code 2
Analysis of different bit carry look ahead adder using verilog code 2Analysis of different bit carry look ahead adder using verilog code 2
Analysis of different bit carry look ahead adder using verilog code 2
 
Design Of 64-Bit Parallel Prefix VLSI Adder For High Speed Arithmetic Circuits
Design Of 64-Bit Parallel Prefix VLSI Adder For High Speed Arithmetic CircuitsDesign Of 64-Bit Parallel Prefix VLSI Adder For High Speed Arithmetic Circuits
Design Of 64-Bit Parallel Prefix VLSI Adder For High Speed Arithmetic Circuits
 
Design of high speed adders for efficient digital design blocks
Design of high speed adders for efficient digital design blocksDesign of high speed adders for efficient digital design blocks
Design of high speed adders for efficient digital design blocks
 
IRJET- FPGA Implementation of High Speed and Low Power Speculative Adder
IRJET-  	  FPGA Implementation of  High Speed and Low Power Speculative AdderIRJET-  	  FPGA Implementation of  High Speed and Low Power Speculative Adder
IRJET- FPGA Implementation of High Speed and Low Power Speculative Adder
 
Design the High Speed Kogge-Stone Adder by Using
Design the High Speed Kogge-Stone Adder by UsingDesign the High Speed Kogge-Stone Adder by Using
Design the High Speed Kogge-Stone Adder by Using
 
Hx3414601462
Hx3414601462Hx3414601462
Hx3414601462
 
LOGIC OPTIMIZATION USING TECHNOLOGY INDEPENDENT MUX BASED ADDERS IN FPGA
LOGIC OPTIMIZATION USING TECHNOLOGY INDEPENDENT MUX BASED ADDERS IN FPGALOGIC OPTIMIZATION USING TECHNOLOGY INDEPENDENT MUX BASED ADDERS IN FPGA
LOGIC OPTIMIZATION USING TECHNOLOGY INDEPENDENT MUX BASED ADDERS IN FPGA
 
MODIFIED CARRY SELECT ADDER WITH BKA AND MGDI TECHNIQUE
MODIFIED CARRY SELECT ADDER WITH BKA AND MGDI TECHNIQUEMODIFIED CARRY SELECT ADDER WITH BKA AND MGDI TECHNIQUE
MODIFIED CARRY SELECT ADDER WITH BKA AND MGDI TECHNIQUE
 
Performance evaluation of full adder
Performance evaluation of full adderPerformance evaluation of full adder
Performance evaluation of full adder
 
Implementation of Carry Skip Adder using PTL
Implementation of Carry Skip Adder using PTLImplementation of Carry Skip Adder using PTL
Implementation of Carry Skip Adder using PTL
 
kunjan elsevier paper
kunjan elsevier paperkunjan elsevier paper
kunjan elsevier paper
 
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGAEFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
 
Design and Implementation of Different types of Carry skip adder
Design and Implementation of Different types of Carry skip adderDesign and Implementation of Different types of Carry skip adder
Design and Implementation of Different types of Carry skip adder
 
IRJET- Implementation and Analysis of Hybridization in Modified Parallel Adde...
IRJET- Implementation and Analysis of Hybridization in Modified Parallel Adde...IRJET- Implementation and Analysis of Hybridization in Modified Parallel Adde...
IRJET- Implementation and Analysis of Hybridization in Modified Parallel Adde...
 
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGAEFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
EFFICIENT ABSOLUTE DIFFERENCE CIRCUIT FOR SAD COMPUTATION ON FPGA
 

Mehr von iaemedu

Tech transfer making it as a risk free approach in pharmaceutical and biotech in
Tech transfer making it as a risk free approach in pharmaceutical and biotech inTech transfer making it as a risk free approach in pharmaceutical and biotech in
Tech transfer making it as a risk free approach in pharmaceutical and biotech iniaemedu
 
Integration of feature sets with machine learning techniques
Integration of feature sets with machine learning techniquesIntegration of feature sets with machine learning techniques
Integration of feature sets with machine learning techniquesiaemedu
 
Effective broadcasting in mobile ad hoc networks using grid
Effective broadcasting in mobile ad hoc networks using gridEffective broadcasting in mobile ad hoc networks using grid
Effective broadcasting in mobile ad hoc networks using gridiaemedu
 
Effect of scenario environment on the performance of mane ts routing
Effect of scenario environment on the performance of mane ts routingEffect of scenario environment on the performance of mane ts routing
Effect of scenario environment on the performance of mane ts routingiaemedu
 
Adaptive job scheduling with load balancing for workflow application
Adaptive job scheduling with load balancing for workflow applicationAdaptive job scheduling with load balancing for workflow application
Adaptive job scheduling with load balancing for workflow applicationiaemedu
 
Survey on transaction reordering
Survey on transaction reorderingSurvey on transaction reordering
Survey on transaction reorderingiaemedu
 
Semantic web services and its challenges
Semantic web services and its challengesSemantic web services and its challenges
Semantic web services and its challengesiaemedu
 
Website based patent information searching mechanism
Website based patent information searching mechanismWebsite based patent information searching mechanism
Website based patent information searching mechanismiaemedu
 
Revisiting the experiment on detecting of replay and message modification
Revisiting the experiment on detecting of replay and message modificationRevisiting the experiment on detecting of replay and message modification
Revisiting the experiment on detecting of replay and message modificationiaemedu
 
Prediction of customer behavior using cma
Prediction of customer behavior using cmaPrediction of customer behavior using cma
Prediction of customer behavior using cmaiaemedu
 
Performance analysis of manet routing protocol in presence
Performance analysis of manet routing protocol in presencePerformance analysis of manet routing protocol in presence
Performance analysis of manet routing protocol in presenceiaemedu
 
Performance measurement of different requirements engineering
Performance measurement of different requirements engineeringPerformance measurement of different requirements engineering
Performance measurement of different requirements engineeringiaemedu
 
Mobile safety systems for automobiles
Mobile safety systems for automobilesMobile safety systems for automobiles
Mobile safety systems for automobilesiaemedu
 
Efficient text compression using special character replacement
Efficient text compression using special character replacementEfficient text compression using special character replacement
Efficient text compression using special character replacementiaemedu
 
Agile programming a new approach
Agile programming a new approachAgile programming a new approach
Agile programming a new approachiaemedu
 
Adaptive load balancing techniques in global scale grid environment
Adaptive load balancing techniques in global scale grid environmentAdaptive load balancing techniques in global scale grid environment
Adaptive load balancing techniques in global scale grid environmentiaemedu
 
A survey on the performance of job scheduling in workflow application
A survey on the performance of job scheduling in workflow applicationA survey on the performance of job scheduling in workflow application
A survey on the performance of job scheduling in workflow applicationiaemedu
 
A survey of mitigating routing misbehavior in mobile ad hoc networks
A survey of mitigating routing misbehavior in mobile ad hoc networksA survey of mitigating routing misbehavior in mobile ad hoc networks
A survey of mitigating routing misbehavior in mobile ad hoc networksiaemedu
 
A novel approach for satellite imagery storage by classify
A novel approach for satellite imagery storage by classifyA novel approach for satellite imagery storage by classify
A novel approach for satellite imagery storage by classifyiaemedu
 
A self recovery approach using halftone images for medical imagery
A self recovery approach using halftone images for medical imageryA self recovery approach using halftone images for medical imagery
A self recovery approach using halftone images for medical imageryiaemedu
 

Mehr von iaemedu (20)

Tech transfer making it as a risk free approach in pharmaceutical and biotech in
Tech transfer making it as a risk free approach in pharmaceutical and biotech inTech transfer making it as a risk free approach in pharmaceutical and biotech in
Tech transfer making it as a risk free approach in pharmaceutical and biotech in
 
Integration of feature sets with machine learning techniques
Integration of feature sets with machine learning techniquesIntegration of feature sets with machine learning techniques
Integration of feature sets with machine learning techniques
 
Effective broadcasting in mobile ad hoc networks using grid
Effective broadcasting in mobile ad hoc networks using gridEffective broadcasting in mobile ad hoc networks using grid
Effective broadcasting in mobile ad hoc networks using grid
 
Effect of scenario environment on the performance of mane ts routing
Effect of scenario environment on the performance of mane ts routingEffect of scenario environment on the performance of mane ts routing
Effect of scenario environment on the performance of mane ts routing
 
Adaptive job scheduling with load balancing for workflow application
Adaptive job scheduling with load balancing for workflow applicationAdaptive job scheduling with load balancing for workflow application
Adaptive job scheduling with load balancing for workflow application
 
Survey on transaction reordering
Survey on transaction reorderingSurvey on transaction reordering
Survey on transaction reordering
 
Semantic web services and its challenges
Semantic web services and its challengesSemantic web services and its challenges
Semantic web services and its challenges
 
Website based patent information searching mechanism
Website based patent information searching mechanismWebsite based patent information searching mechanism
Website based patent information searching mechanism
 
Revisiting the experiment on detecting of replay and message modification
Revisiting the experiment on detecting of replay and message modificationRevisiting the experiment on detecting of replay and message modification
Revisiting the experiment on detecting of replay and message modification
 
Prediction of customer behavior using cma
Prediction of customer behavior using cmaPrediction of customer behavior using cma
Prediction of customer behavior using cma
 
Performance analysis of manet routing protocol in presence
Performance analysis of manet routing protocol in presencePerformance analysis of manet routing protocol in presence
Performance analysis of manet routing protocol in presence
 
Performance measurement of different requirements engineering
Performance measurement of different requirements engineeringPerformance measurement of different requirements engineering
Performance measurement of different requirements engineering
 
Mobile safety systems for automobiles
Mobile safety systems for automobilesMobile safety systems for automobiles
Mobile safety systems for automobiles
 
Efficient text compression using special character replacement
Efficient text compression using special character replacementEfficient text compression using special character replacement
Efficient text compression using special character replacement
 
Agile programming a new approach
Agile programming a new approachAgile programming a new approach
Agile programming a new approach
 
Adaptive load balancing techniques in global scale grid environment
Adaptive load balancing techniques in global scale grid environmentAdaptive load balancing techniques in global scale grid environment
Adaptive load balancing techniques in global scale grid environment
 
A survey on the performance of job scheduling in workflow application
A survey on the performance of job scheduling in workflow applicationA survey on the performance of job scheduling in workflow application
A survey on the performance of job scheduling in workflow application
 
A survey of mitigating routing misbehavior in mobile ad hoc networks
A survey of mitigating routing misbehavior in mobile ad hoc networksA survey of mitigating routing misbehavior in mobile ad hoc networks
A survey of mitigating routing misbehavior in mobile ad hoc networks
 
A novel approach for satellite imagery storage by classify
A novel approach for satellite imagery storage by classifyA novel approach for satellite imagery storage by classify
A novel approach for satellite imagery storage by classify
 
A self recovery approach using halftone images for medical imagery
A self recovery approach using halftone images for medical imageryA self recovery approach using halftone images for medical imagery
A self recovery approach using halftone images for medical imagery
 

High performance parallel prefix adders with fast carry chain logic

  • 1. INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 – 6480(Print), ISSN 0976 – 6499(Online)AND TECHNOLOGY (IJARET) IAEME ENGINEERING Volume 3, Number 2, July-December (2012), © ISSN 0976 - 6480 (Print) ISSN 0976 - 6499 (Online) IJARET Volume 3, Issue 2, July-December (2012), pp. 01-10 © IAEME: www.iaeme.com/ijaret.html Journal Impact Factor (2012): 2.7078 (Calculated by GISI) ©IAEME www.jifactor.com HIGH PERFORMANCE PARALLEL PREFIX ADDERS WITH FAST CARRY CHAIN LOGIC Anitha R1, V Bagyaveereswaran2 AP(Sr), SENSE, AP(Sr), SELECT VIT University, Vellore – 632014, TamilNadu, India. 1 2 eranitharavi@gmail.com, bagyaveereswaran@gmail.com, ABSTRACT Binary adders are the basic and vital element in the circuit designs. Prefix adders are the most efficient binary adders for ASIC implementation. But these advantages are not suitable for FPGA implementation because of CLBs and routing constraints on FPGA. This paper presents different types of parallel prefix adders and compares them with the Simple Adder. The adders are designed using Verilog HDL code and simulated and synthesized using Xilinx ISE13.2 software tool and Cadence RTL compiler. Among all the adders, Kogge-Stone adder provides better performance in ASIC implementation but it is not suitable for FPGA implementation. In order to make it suitable for FPGA implementation, Kogge-Stone adder is modified using fast carry logic technique. The modified adder provides better performance over the Simple adder for the higher order bit widths. Keywords- FPGA, Binary addition, Carry tree adders, Prefix computation, Prefix addition. I. INTRODUCTION Adders are the most important element in all the digital circuit design. Among the various types of adders, Carry Tree Adder which is also known as Parallel Prefix Adders provide high performance in terms of speed in ASIC implementation. The Carry Tree adder performs three stage operations such as Pre-computation stage, Prefix- computation stage and Post-computation stage. The Pre-computation stage generates and propagates the carry signal, the Prefix computation stage generates the carry signal using prefix cells and the Post-computation stage generates the sum. This is shown in Fig.1 and the equation for these three stage addition operation is given in equation 1, 2 &3. Field Programmable Gate Array [10] offers low cost and less development time over ASIC implementation. In this paper, the most efficient adder i.e., the carry tree adder like Kogge-Stone, Brent-Kung, Ladner-Fischer and Han-Carlson adders are designed and implemented on FPGA. 1
  • 2. International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 – 6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME The problems involved in FPGA implementation are investigated and the possible FPGA architecture which can make the Carry Tree Adder to provide high performance over the Simple adder is explored. The possible trade-offs like area, power, delay, interconnect count and fan-out involved in the adders are examined. Fig.1. Block Diagram of Prefix addition The three stages addition consists of the following computations: • Pre-computation: Gm:n=An and Bn, G0=cin; Pm:n=An xor Bn, P0=0; ……...(1) • Prefix-computation: (Gm, Pm) ο (Gn, Pn)= (Gn:k + Pn:k· Gk-1:n, Pn:k·Pk-1:j) (or) Gm:n=Gn:k + Pn:k· Gk-1:nPm:n=Pn:k·Pk-1:j ……...(2) • Post-computation: Sn=Pn xor Gn-1:0 ……...(3) II. CARRY TREE ADDERS The various types of carry tree adders are shown in Fig.2. Each carry tree adder consists of three parts. They are: Upper part, Middle part, Lower part. Using these parts the carry tree adders computes N outputs from N inputs as shown in Fig.1. The Upper part generates and propagates the carry signal from the input to the prefix stage using the formula given in equation (1). The propagated and generated carry signals are combined using the associate operator “ο”. This operation is performed in the middle part using the formula given in equation (2). The Middle part consists of prefix cells such as black cells, grey cells and white buffers [1]. The arrangement of these prefix cells in different order results in various types of Carry Tree adders. where the carry signals need not to be propagated. Such operations are performed by grey cells. The grey cells generate the carry signal only.Black cell generates and propagates the carry signal. There are some places The white buffers are used to reduce the loading effect for the further stages. The Lower part generates the overall sum using the formula given in equation (3). Depends on the arrangement of prefix cells, the carry tree adders involves in trade- offs like area, power, delay, interconnect count, fan-out and logic depth [3 & 4]. Fig.2 (a) shows the Brent-Kung The dark black line in the figure indicates the critical path of the adder. The critical path for Han-Carlson and Kogge-Stone are less. So these two 2
  • 3. International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 – 6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME adders are expected to be the fastest adder. The power utilized by all the Carry Tree Adder is more than the Simple Adder. (a)Brent Kung (b) Kogge Stone minimum area and maximum logic depth. Due to the maximum logic depth, the delay of this adder is expected to be high. Fig.2 (b) shows the Kogge-Stone adder. adder. It is designed in such a way that it provides It provides maximum interconnect count and area but minimum logic depth and fan-out. Ladner-Fischer adder as shown in Fig.2 (c) provides minimum logic depth with improved area. Han-Carlson adder as shown in Fig. 2(d) provides minimum logic depth and minimum interconnect count. 3
  • 4. International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 – 6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME (c) Ladner Fischer (d)Han Carlson Fig.2. (a-f) Carry Tree adders Simple adder is designed using Verilog HDL ‘+’ operator. The carry chain structure on FPGA makes Simple Adder to provide high performance. But this is not an efficient adder for VLSI implementation. In this paper, Carry Tree Adder is compared with Simple Adder for both ASIC and FPGA implementation. III. RELATED RESEARCH AND PROPOSED WORK The different types of carry tree adders are discussed in [4]. In [5], the authors implemented different types of adders like Simple Adder, Carry Look Ahead Adder, Carry Skip Adder, and Carry Select Adder on the Virtex2 FPGAs and found that the Simple Adder provides better performance. In [3], the authors discussed various parallel prefix networks design and implementation on a Xilinx Virtex5 FPGA. It is observed that the Simple Adder provides better performance over the prefix networks for the bit widths up to 256 bits. This is due to the advantage of the carry chain structure on the FPGA. All these works by different authors shows that the simple adder provides better performance on FPGA. The area, delay results for these works depend upon synthesis reports. In [2], the authors described several Carry Tree Adders implemented on a Xilinx Spartan3E FPGA. It is found that the Kogge Stone Carry Tree Adder provide better delay performance for the higher order bits. The results obtained for this paper is similar to those presented in [2]. 4
  • 5. International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 – 6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME Carry Tree Adders are designed, coded, simulated and synthesized and then it is compared with the Simple Adder. The obtained area, power, delay results of various Carry Tree Adders are compared with each other and also with the Simple Adder. Among all the Carry Tree Adders, Kogge-Stone Adder and Han-Carlson Adder is expected to be the fastest adder in ASIC implementation but not in FPGA implementation. In this paper, Kogge-Stone Adder is taken, since it is having minimum fan-out and logic depth than Han-Carlson Adder, and modified using Fast Carry Logic technique in order to make it suitable for FPGA implementation [6, 7, 8 & 9]. The addition operation performed by Simple Adder, which is generated by synthesis tool, is shown in Fig.3 (a). From Fig.3 (a), it is clear that the Prefix-computation stage of the Simple Adder uses multiplexers. Similarly, the Prefix-computation stage of Carry Tree Adder is replaced with the Fast Carry logic technique which uses muxes as shown in Fig.3 (b). The Fast Carry Logic architecture for 4- bit addition is shown in Fig.3(c). Instead of using Black cells, Grey cells and White buffers to propagate and generate the carry signals, simple muxes are used. The blocks present in Fast Carry Logic technique also uses muxes. The input to the Fast Carry Logic is the propagated and generated carry signal of the Pre-computation stage. The Pre-computation and Post- computation of the modified adder is similar to that of the normal carry tree adders. IV. RESULTS The delay, power and cell area results obtained by synthesizing the designed adders for 128bits using Cadence RTL compiler (90nm technology) is shown in Table 1, 2 & 3. The abbreviations used in the table are: KS for the Kogge Stone Adder, BK for the Brent Kung Adder, LF for the Ladner Fischer Adder and HC for Han Carlson Adder. Fig.3(a)SimpleAdder 5
  • 6. International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 – 6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME Fig.3(b)Carry Tree Adder Fig.3(c) Fast Carry Logic for 4-bit Carry tree addition The delay is measured in terms of nanoseconds, power in terms of nanowatt. From the results it is found that the Carry Tree Adders provide best delay performance than the Simple adder. Among the Carry Tree Adders, Kogge-Stone Adder and Han-Carlson Adder provide best delay as it is expected but the area and power utilized by those adders are more. Comparatively, Brent-Kung Adder and Ladner-Fischer Adder utilizes less area and power. 6
  • 7. International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 – 6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME Table 1: Delay Results of Carry Tree Adders compared with Simple Adder Table2: Power Results of Carry Tree Adders compared with Simple Adder Table3: Cell Area Results of Carry Tree Adders compared with Simple Adder Fig.4 shows the simulated delay results of the adders for the bit widths up to 128bits using Xilinx ISE13.2 software tool. From the Fig.4, it is found that the Simple Adder provide best delay performance over the Carry Tree Adder. The obtained delay result is entirely different from the result shown in Table 1. This is because of the presence of Fast Carry chain structure on Xilinx FPGA. Among the Carry Tree adders, Kogge-Stone Adder provides best delay as it is expected. 7
  • 8. International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 – 6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME Fig.5(a-d) shows the delay results of Kogge-Stone Adder, Kogge-Stone Modified Adder and Simple Adder for the FPGA families like Spartan-3E, Virtex-4, Virtex-5 and Virtex-6 Lower power. Some of the 64-bit adder structure cannot be fitted in to all the devices under this family. Fig. 4 Simulated Delay Results of Carry Tree Adders compared with Simple Adder Depends on the adder structure, the device and package has been selected. From the Fig it is found that, for Spartan-3E FPGA, Kogge-Stone adder provide best performance after it reaches 256 bits whereas Modified adder provides best performance after it reaches 128bits, for Virtex-4 FPGA, Kogge-Stone adder provides best performance after itreaches 128bits whereas Modified adder provides best performance from 128bits, for Virtex-5 FPGA, Kogge-Stone adder provides best performance after it reaches 256bits whereas Modified adder provides best performance from 128bits, for Virtex-6 FPGA, it is able to reduce the delay of Carry Tree Adder but Simple Adder provide better delay performance. (fig. 5.a) 8
  • 9. International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 – 6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME V. CONCLUSION This paper presents different types of Carry Tree Adders. Kogge Stone adder is the fastest carry tree adder in VLSI implementation but it provides different result for the FPGA implementation. (Fig.5.b) In order to make it suitable for FPGA implementation, the prefix computation stage is modified using “Fast Carry Logic”. (Fig.5.c) 9
  • 10. International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 – 6480(Print), ISSN 0976 – 6499(Online) Volume 3, Number 2, July-December (2012), © IAEME (Fig.5.d) Fig. 5(a-d) Simulated Delay results The obtained delay results are compared with the Simple Adder for the various FPGA devices like Spartan3E, Virtex4, Virtex5, Lower power Virtex6. The Lower power Virtex6 FPGA provides best delay compared to that of all the FPGA devices. By using carry logic technique the Carry Tree Adders are able to provide better delay performance on FPGA over the Simple Adder for the higher order bit widths. REFERENCES 1. N. H. E. Weste and D. Harris, CMOS VLSI Design, 4th edition, Pearson–Addison- Wesley, 2011. 2. FPGAs David H. K. Hoe, Chris Martinez and Sri Jyothsna Vundavalli, “Design and Characterization of Parallel Prefix Adders”, IEEE 43rd Southeastern Symposium on system theory, March 2011. 3. K. Vitoroulis and A. J. Al-Khalili, “Performance of Parallel Prefix Adders Implemented with FPGA technology,” IEEE Northeast Workshop on Circuits and Systems, pp. 498- 501, Aug. 2007. 4. D. Harris, “A Taxonomy of Parallel Prefix Networks,” in Proc. 37th Asilomar Conf. Signals Systems and Computers, pp. 2213–7, 2003. 5. M. Becvar and P. Stukjunger, “Fixed-Point Arithmetic in FPGA,” Acta Polytechnica, vol. 45, no. 2, pp. 67-72, 2005. 6. Spartan-3E Generation FPGA User Guide, Xilinx Inc., June 2011, UG331 (v1.8): http://www.xilinx.com/support/documentation/user_guides/ug331.pdf 7. Virtex-4 FPGA User Guide, Xilinx Inc., Dec 2008, UG070 (V2.6):http://www.xilinx.com/support/documentation/user_guides/ug070.pdf. 8. Virtex-5 FPGA User Guide, Xilinx Inc., May 2010, UG190 (V5.3): http://www.xilinx.com/support/documentation/userguides/ug190.pdf. 9. Virtex-6 FPGA User Guide, Xilinx Inc., Sep. 2009, UG364 (v1.1): http://www.xilinx.com/support/documentation/user guides/ug364.pdf. 10. www.xilinx.com 10