Design and Delay Analysis of Various 256-Bit Adders using Verilog

Download Full-Text PDF Cite this Publication

Text Only Version

Design and Delay Analysis of Various 256-Bit Adders using Verilog

Rachana S

Department of ECE

K S Institute of Technology Bangalore, India

Ritu Patil

Department of ECE

K S Institute of Technology

Sahana V

Department of ECE

K S Institute of Technology Bangalore, India

Abstract In this paper, several adders are being examined and compared in terms of delay of throughput. The objective of this paper is to design different architecture of adders and to observe the reliable output. Existing adders performance will widely vary with respect to their area requirements and speed of execution. The proposed adders architecture named Ripple carry adder, Carry look ahead adder, Carry skip adder, Carry save adder, Carry select adder, decomposes into blocks of carry generator, carry propagator and multiplexer. As Addition is the most important operation in data processing hence its speed has a significant impact on digital circuits. We have demonstrated the efficiency of the proposed architectures along with the design method in 256 bit operands.

Keywords Throughput, RTL schematic, Technological schematic, Simulation, Ripple carry adder, Operands, RCA (Ripple Carry Adder), CLA (Carry Look Ahead adder), CSkA (Carry Skip Adder), CSA (Carry Save Adder), CSlA (Carry Select Adder), ALU (Arithmetic Logic unit)

  1. INTRODUCTION

    Adders are called a digital circuit because they perform addition of numbers. It is a circuit that sums up the amplitude of 3 inputs that gives 2 outputs called sum and carry.They are being used in many processor architectures, ALU and computational units. Each adder creates a carry value which needs to be propagated via the circuit adders. Even though for many number of representations, adders can be constructed in the form of binary- coded decimal or excess-3, the most common adders operate on binary numbers.

    RLA is a digital adder circuit, where in the carry out of every full adder will be the carry in of the next most significant full adder. It is so called because each carry bit receives rippled into the following next stage. CLA or fast adder is a type of digital circuit. It calculates one or more carry bits earlier than the sum, which reduces the wait or delay time. CSA is a form of virtual adder used in computer microarchitecture to locate the sum of 3 extra n-bit numbers in binary. CSlA is a way to enforce an adder, which may be a logic detail that finds out the sum of numbers. CSkA is a type of adder implementation that improves on delay of RCA when compared to other adders.

    Aruna Rao B P

    Department of ECE

    K S Institute of Technology Bangalore, India

  2. EXPRESSION OF ADDER Sum = A^B^Cin

    Carry = (A&B)|(B&Cin)|(Cin&A) Carry generator = A&B

    Carry propagator = A^B

    Table 1: Truth Table

  3. METHODOLOGY

    1. Ripple Carry Adder

      Basically, a full adder plays the addition operation on three inputs and produces the two outputs. Initially, it performs the addition on two inputs such as A and B along with the third input carry as C-IN. The two outputs produced are designated as S and C-OUT, where S is sum and C-OUT as carry-out. Full adder is designed with such a logic that it is capable of taking eight inputs at a time in order to create a byte-wide adder and the output carry is cascaded from one adder to another.

      Figure 1: RTL View of RCA

      Logical Expression for SUM:

      = A B C-IN + A B C-IN + A B C-IN + A B C-IN

      = C-IN (A B + A B) + C-IN (A B + A B)

      = C-IN XOR (A XOR B)

      Logical Expression for C-OUT:

      = A B C-IN + A B C-IN + A B C-IN + A B C-IN

      = A B + B C-IN + A C-IN

      By making use of the truth table, we can implement the full adder logic. Sum expression is an XOR operation between the inputs A, B and C-IN whereas Carry-out expression is an AND&OR operation between the inputs A,B and C-IN.

      Figure 2: Technological View of RCA

    2. Carry Look Ahead adder

      A carry-look ahead adder (CLA) is also known as a fast adder which is basically used in digital logic. It is known as a fast adder because it increases the speed by reducing the time required to interpret the carry bits Working of the CLA follows like this, initially it calculates the carry bits before sum, so it is helpful in reducing the propagation delay to find the result of the larger bits of the adder.(P. Balasubramanian, 2016)

      Figure 3: RTL View of CLA

      The carry look ahead requires the additional hardware to improve its speed but it is not dependent on the number of bits. Basically this adder makes use of propagating and generating carries. Fast adder mainly depends on two things

      i.e. Calculating for each digit position whether it is going to propagate the carry, now the word digit can be replaced by the word bit since it makes use of the concepts generating

      and propagating carries. Secondly, by combining all these calculated values to deduce quickly to know whether the group is going to propagate the carry which comes in from the right.

      G (A, B) =A & B P (A, B) =A+B

      Figure 4: Technological View of CLA

    3. Carry Skip adder

      Carry Skip adder is often called as Carry by-pass adder. In this the implementation of the adder enhances the delay of RCA with less effort when compared with other adders. In the worst case, the improvement in delay is achieved by making use of several carry by- pass adders to form a block-carry-skip-adder. Unlike the other adders such as RCA, CLA etc. the performance of this carry skip adder can be enhanced with only a few combinations of input bits. The critical path in this adder begins at the first full adder. In order to reduce this critical path, block-carry-skip adders are used where the skip adders are chained.

      Figure 5: RTL View of CSkA

      Block-carry-skip adders are basically composed of many number of carry-skip adders. Mainly there are two kinds of this adder i.e. Fixed size block-carry-bypassadders and Variable size block-carry-bypass adders. The critical path in this fixed size adders consists of the ripple path and the first block consists of the skip element. The performance of this adder can be still increased by making use of the variable

      size block-carry-skip adders i.e. the preliminary blocks of this adder are made smaller to notice the carry generated quickly to propagate in addition and the middle blocks are not made small later the most significant blocks are made small so that the carry inputs arriving late is processed quickly.(Shweta Thakur, Aug 2018)

      Figure 6: Technological View of CSkA

    4. Carry Save adder

      In Ripple Carry Adder (RCA), propagation of carry from one stage to the other stage takes longer time. Due to this reasonRCA will introduce an overall delay in the circuit. In order to avoid this problem, carry save adder came into an existent. It also had sort out the delay problem up to certain extent. Due to which the propagation of carry in carry save adder can be avoided. In this adder partial sum and partial carry is generated and also get stored. The partial carry which is stored cannot be propagated to the successivebits of higher order. The generated partial carry and partial sum in last step will be get added by using any of the carry propagation adder.(Ashvin Chudasama, 2016)

      Figure 7: RTL View of CSA

      In order to avoid waiting for ripple,carry look ahead adder adds up the group generate signals and group propagate signals. Carry Look Ahead adder provides higher delay for the higher order bits when compared to other addrs due to

      the existence of large number ofgates. In digital adders, speed of the addition is defined by timeneeded to propagate the carry acrossthe adder. In case of primary adder for eachbit position the sum is generated sequentially only after the previous bit position has been summed.

      Figure 8: Technological View of CSA

    5. Carry Select adder

    The carry-select adder comprises two ripple carry adders and a multiplexer. Addition of two n-bit numbers with a carry-select adder is computed with two adders, therefore we use two ripple carry adders. In order to perform the calculation twice, one time by assuming the carry-in being zero and the other time assuming it will be one. After both the results are calculated, the correct sum, and the correct carry-out, is selected by the multiplexer once when the correct carry-in is known. Therefore the wide variety of bits in every carry select block can be uniform, or variable.(Bala Sindhuri Kandulaa, 2016)

    Figure 9: RTL View of CSlA

    Figure 9 is the RTL (register transfer level) view of the carry select adder. It has 3 inputs A, B and Cin with the sum and carry as output. Since we are working on 256 bit the inputs to A, B are 255:0 which is equal to 256 bit.

    After working with the Xilinx tool the simulation output was 5.31 secs which is the CPU execution time.

    Figure 10: Technological View of CSlA

  4. SIMULATION RESULT

    Total CPU time to Xst completion: 5.39secs

    Timing Report:

    Figure 14: CSA

    Total REAL time to Xst completion: 6.00 secs Total CPU time to Xst completion: 5.28 secs

    Timing Report:

    Figure 11: RLA

    Total REAL time to Xst completion: 6.00 secs Total CPU time to Xst completion: 5.41 secs

    Timing Report:

    Figure 15: CSlA

    Total REAL time to Xst completion: 6.00 secs Total CPU time to Xst completion: 5.31 secs

    SL.N O

    TYPES OF ADDER S

    REAL TIME EXECUTION(I N SECS)

    CPU TIME EXECUTION(I N SECS)

    1

    RCA

    6.00

    5.41

    2

    CLA

    5.00

    5.06

    3

    CSkA

    6.00

    5.39

    4

    CSA

    6.00

    5.28

    5

    CSlA

    6.00

    5.31

    SL.N O

    TYPES OF ADDER S

    REAL TIME EXECUTION(I N SECS)

    CPU TIME EXECUTION(I N SECS)

    1

    RCA

    6.00

    5.41

    2

    CLA

    5.00

    5.06

    3

    CSkA

    6.00

    5.39

    4

    CSA

    6.00

    5.28

    5

    CSlA

    6.00

    5.31

  5. CONCLUSION

Timing Report:

Figure 12: CLA

Total REAL time to Xst completion: 5.00 secs Total CPU time to Xst completion: 5.06 secs

Timing Report:

Figure 13: CSkA

Table 2: Comparison Table

An extensive performance of all types of adders has been examined. Their performance was analyzed in terms of gate level and delay throughput. From this analysis, 256 bits ripple carry adder is just a series of full adder connected serially where carry propagator from first full adder to last one. Delay is maximum on this case. Carry look ahead adder is one which is calculated beforehand and of course delay is much lesser when compared to others. In carry save and carry select adder, the delay is minimum as compared to carry skip and full adder. Therefore, carry skip is faster than

Total REAL time to Xst completion: 6.00 secs

full adder. Hence it can be concluded by stating that full adder has the maximum delay when compared to other

adders (carry look ahead adder, carry skip adder, carry save adder, carry select adder)(Kunjan D. Shinde)

REFERENCES

  1. Ashvin Chudasama, T. N. (2016). Implementation of 4×4 Vedic Multiplier using Carry Save Adder in Quantum-Dot Cellular Automata . 1260-1264.

  2. Bala Sindhuri Kandulaa, K. P. (2016). Area Efcient VLSI Architecture for Square Root Carry Select Adder using Zero Finding Logic . Procedia Computer Science 89 , 640 650.

  3. D.Mohanapriya, D. (2016). A Comparative Analysis of Different 32-bit Adder Topologies with Multiplexer Based Full Adder , Volume 6 Issue No. 5. IJESC , 4850-4854.

  4. Dr. G.S. Sunitha, R. H. (2017). DESIGN AND IMPLEMENTATION OF ADDER ARCHITECTURES AND ANALYSIS OF PERFORMANCE METRICS . International Journal of Electronics and Communication Engineering and Technology (IJECET) Volume 8, Issue 5, 1-6.

  5. J. Vinoth Kumar, D. C. (2017). DESIGN OF ENHANCED SQRT CARRY SELECT ADDER FOR VLSI IMPLEMENTATION OF 2D- DISCRETE WAVELET TRANSFORM . International Journal of MC Square Scientific Research Vol.9, No.2, 64-69.

  6. K. RENUKA PRIYADARSHINI, V. N. (Jan-Dec-2018). Implementation of Area Efficient Carry-Select Adder . International Journal of VLSI System Design and Communication Systems ISSN 2322-0929 Volume-06, 226-231

    .

  7. Omid Akbari, M. K.-K. (2016). RAP-CLA: A Reconfigurable Approximate Carry Look-Ahead Adder .

  8. P. Balasubramanian, C. D. (2016). Asynchronous Early Output Section-Carry Based Carry Lookahead Adder with Alias Carry Logic .

  9. Padmanabhan Balasubramanian 1, D. M. (2018). Low Power Robust Early Output Asynchronous Block Carry Lookahead Adder with Redundant Carry Logic. electronics.

  10. PUSHPENDRA KUMAR SHARMA, M. K. (2019). Performance Analysis of Low Power and High Speed one-bit Full Adder Circuit . International Journal of Applied Engineering Research ISSN 0973-4562 Volume 14, Number 2, 116-121.

  11. R. Bala Sai Kesava, K. B. (2016). Low Power And Area Efficient Wallace Tree Multiplier Using Carry Select Adder With Binary To Excess-1 Converter. 248-253.

  12. S. M. PADMAVATHI, N. R. (2016). Design and Implementation of Carry Skip Adder using AOI and OAI . International Journal of VLSI Design and Communication Systems (IJVDCS), 0805-0809 .

  13. Shweta Thakur, E. A. (Aug 2018). Design & Implementation of 16-bit Carry Skip Adder using Reversible Computing . Shweta Thakur Journal of Engineering Research and Application ISSN : 2248-9622, Vol. 8, Issue 8 (Part -I), 68-72 .

  14. Sujan Sarkar, J. M. (2017). Design of Hybrid (CSA-CSkA) Adder for Improvement of Propagation Delay . 332-336.

  15. Ubaidulla, P. A. (August 2016). Implementation of High Speed and EnergyEfficient Carry Skip Adder using Verilog HDL . IJSTE – International Journal of Science Technology & Engineering | Volume 3 | Issue 02, 156-159.

Leave a Reply

Your email address will not be published. Required fields are marked *