Hard ware implementation of area and power efficient Carry Select Adder using reconfigurable adder structures

Similar documents
An Efficient Carry Select Adder with Less Delay and Reduced Area Application

Implementation of CMOS Adder for Area & Energy Efficient Arithmetic Applications

Low-Power And Area-Efficient Of 128-Bit Carry Select Adder

Implementation of CMOS Adder for Area & Energy Efficient Arithmetic Applications

Design of an Efficient 128-Bit Carry Select Adder Using Bec and Variable csla Techniques

Design and Verification of Area Efficient High-Speed Carry Select Adder

Design and Characterization of High Speed Carry Select Adder

Anisha Rani et al., International Journal of Computer Engineering In Research Trends Volume 2, Issue 11, November-2015, pp.

ASIC IMPLEMENTATION OF 16 BIT CARRY SELECT ADDER

Design of Delay Efficient Carry Save Adder

Carry Select Adder with High Speed and Power Efficiency

A High Speed Design of 32 Bit Multiplier Using Modified CSLA

Area-Delay-Power Efficient Carry-Select Adder

Area Delay Power Efficient Carry Select Adder

FPGA Implementation of Efficient Carry-Select Adder Using Verilog HDL

Area Delay Power Efficient Carry-Select Adder

Implementation of Regular Linear Carry Select Adder with Binary to Excess-1 Converter

Area Delay Power Efficient Carry-Select Adder

International Journal of Innovative Research in Computer Science & Technology (IJIRCST) ISSN: , Volume-3, Issue-5, September-2015

A New Architecture Designed for Implementing Area Efficient Carry-Select Adder

Implementation of 64-Bit Kogge Stone Carry Select Adder with ZFC for Efficient Area

An Optimized Montgomery Modular Multiplication Algorithm for Cryptography

DESIGN AND PERFORMANCE ANALYSIS OF CARRY SELECT ADDER

DESIGN OF HYBRID PARALLEL PREFIX ADDERS

AREA-DELAY-POWER EFFICIENT CARRY SELECT ADDER

VLSI Arithmetic Lecture 6

Power Optimized Programmable Truncated Multiplier and Accumulator Using Reversible Adder

Design and Implementation of CVNS Based Low Power 64-Bit Adder

A Novel Design of 32 Bit Unsigned Multiplier Using Modified CSLA

Design and Implementation of Signed, Rounded and Truncated Multipliers using Modified Booth Algorithm for Dsp Systems.

An Efficient Design of Sum-Modified Booth Recoder for Fused Add-Multiply Operator

16 Bit Low Power High Speed RCA Using Various Adder Configurations

AN EFFICIENT REVERSE CONVERTER DESIGN VIA PARALLEL PREFIX ADDER

High-Performance Full Adders Using an Alternative Logic Structure

Implimentation of A 16-bit RISC Processor for Convolution Application

A High-Speed FPGA Implementation of an RSD-Based ECC Processor

An Efficient Hybrid Parallel Prefix Adders for Reverse Converters using QCA Technology

High Speed Han Carlson Adder Using Modified SQRT CSLA

Low Power Circuits using Modified Gate Diffusion Input (GDI)

Implementation of Discrete Wavelet Transform for Image Compression Using Enhanced Half Ripple Carry Adder

Implementation of Efficient Modified Booth Recoder for Fused Sum-Product Operator

II. MOTIVATION AND IMPLEMENTATION

R. Solomon Roach 1, N. Nirmal Singh 2.

DESIGN AND IMPLEMENTATION OF ADDER ARCHITECTURES AND ANALYSIS OF PERFORMANCE METRICS

Performance Evaluation of Guarded Static CMOS Logic based Arithmetic and Logic Unit Design

High Performance and Area Efficient DSP Architecture using Dadda Multiplier

Design and Analysis of Kogge-Stone and Han-Carlson Adders in 130nm CMOS Technology

A Ripple Carry Adder based Low Power Architecture of LMS Adaptive Filter

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN

A Simple Method to Improve the throughput of A Multiplier

An Efficient Fused Add Multiplier With MWT Multiplier And Spanning Tree Adder

A High Performance Reconfigurable Data Path Architecture For Flexible Accelerator

VARUN AGGARWAL

Designing and Characterization of koggestone, Sparse Kogge stone, Spanning tree and Brentkung Adders

Study, Implementation and Survey of Different VLSI Architectures for Multipliers

FPGA Implementation of Multiplier for Floating- Point Numbers Based on IEEE Standard

FPGA IMPLEMENTATION OF FLOATING POINT ADDER AND MULTIPLIER UNDER ROUND TO NEAREST

DESIGN AND IMPLEMENTATION 0F 64-BIT PARALLEL PREFIX BRENTKUNG ADDER

INTERNATIONAL JOURNAL OF PROFESSIONAL ENGINEERING STUDIES Volume 9 /Issue 3 / OCT 2017

A Novel Efficient VLSI Architecture for IEEE 754 Floating point multiplier using Modified CSA

A General Sign Bit Error Correction Scheme for Approximate Adders

Area And Power Optimized One-Dimensional Median Filter

DESIGN AND IMPLEMENTATION OF APPLICATION SPECIFIC 32-BITALU USING XILINX FPGA

Efficient VLSI Huffman encoder implementation and its application in high rate serial data encoding

High-Performance Carry Chains for FPGA s

16 BIT IMPLEMENTATION OF ASYNCHRONOUS TWOS COMPLEMENT ARRAY MULTIPLIER USING MODIFIED BAUGH-WOOLEY ALGORITHM AND ARCHITECTURE.

A Novel Carry-look ahead approach to an Unified BCD and Binary Adder/Subtractor

AN EFFICIENT DESIGN OF VLSI ARCHITECTURE FOR FAULT DETECTION USING ORTHOGONAL LATIN SQUARES (OLS) CODES

DYNAMIC CIRCUIT TECHNIQUE FOR LOW- POWER MICROPROCESSORS Kuruva Hanumantha Rao 1 (M.tech)

DESIGN AND IMPLEMENTATION OF VLSI SYSTOLIC ARRAY MULTIPLIER FOR DSP APPLICATIONS

Design of 2-Bit ALU using CMOS & GDI Logic Architectures.

Implementation of Double Precision Floating Point Multiplier on FPGA

Resource Efficient Multi Ported Sram Based Ternary Content Addressable Memory

DESIGN AND SIMULATION OF 1 BIT ARITHMETIC LOGIC UNIT DESIGN USING PASS-TRANSISTOR LOGIC FAMILIES

Implementation of a Fast Sign Detection Algoritm for the RNS Moduli Set {2 N+1-1, 2 N -1, 2 N }, N = 16, 64

Design and Implementation of VLSI 8 Bit Systolic Array Multiplier

VLSI Implementation of Adders for High Speed ALU

FIR Filter Architecture for Fixed and Reconfigurable Applications

OPTIMIZING THE POWER USING FUSED ADD MULTIPLIER

Performance Analysis of 64-Bit Carry Look Ahead Adder

Implementation of Ripple Carry and Carry Skip Adders with Speed and Area Efficient

Design and Development of Vedic Mathematics based BCD Adder

Fault Tolerant Parallel Filters Based on ECC Codes

VHDL Design and Implementation of ASIC Processor Core by Using MIPS Pipelining

TESTING OF FAULTS IN VLSI CIRCUITS USING ONLINE BIST TECHNIQUE BASED ON WINDOW OF VECTORS

An RNS Based Montgomery Modular Multiplication Algorithm For Cryptography

Paper ID # IC In the last decade many research have been carried

COPY RIGHT. To Secure Your Paper As Per UGC Guidelines We Are Providing A Electronic Bar Code

VLSI Implementation of Low Power Area Efficient FIR Digital Filter Structures Shaila Khan 1 Uma Sharma 2

Design of Delay Efficient Distributed Arithmetic Based Split Radix FFT

Sum to Modified Booth Recoding Techniques For Efficient Design of the Fused Add-Multiply Operator

Optimized CAM Design

ISSN (Online)

1. Introduction. Raj Kishore Kumar 1, Vikram Kumar 2

HIGH PERFORMANCE FUSED ADD MULTIPLY OPERATOR

Lecture 21: Combinational Circuits. Integrated Circuits. Integrated Circuits, cont. Integrated Circuits Combinational Circuits

IMPLEMENTATION OF AN ADAPTIVE FIR FILTER USING HIGH SPEED DISTRIBUTED ARITHMETIC

Detection Of Fault In Self Checking Carry Select Adder

The Serial Commutator FFT

IJSRD - International Journal for Scientific Research & Development Vol. 4, Issue 05, 2016 ISSN (online):

Transcription:

International Journal of Scientific and Research Publications, Volume 4, Issue 6, June 014 1 Hard ware implementation of area and power efficient Carry Select Adder using reconfigurable adder structures Neelima.V *, R. Ramesh Babu ** * ECE, Jagruthi Institute of Engineering & Technology (JIET) ** ECE, Jagruthi Institute of Engineering & Technology (JIET) Abstract- In data processing processors, adder is a basic digital circuit. To perform any arithmetic operation, addition is the basic operation to perform. To compute fast arithmetic operations adder must be fastest. CSLA is the fastest adder when compare to RCA and CLA. From the structure of CSLA it is observed that there is a scope to reduce area further so that power can be lowered [3-4]. This paper proposes a new architecture of CSLA using reconfigurable adder structures (RAS) and is compared with regular SQRT CSLA, BEC [7]. The experimental analysis shows that the proposed RAS is having advantages regarding area and power. Index Terms- area efficient, low power, CSLA, BEC, SQRT CSLA and RAS I.INTRODUCTION In VLSI designing, most important areas of research is to design area and power efficient data processors. In digital adders, speed of addition operation depends on the propagation of carry bit through the adder. In a conventional RCA sum of each bit is generated only after the previous bit has been summed and carry propagated into the next position. Next position bits has to wait until it found the previous carry bit takes longer computation time to perform addition. For fast addition operation CLA is designed which occupies more area and consumes more power. CSLA is designed to compromise between small delay and large area of CLA and longer delay and small area of RCA [5-6]. This paper provides comparison of existed designs and proposed design of RAS. This paper structured as follows. Section II deals with literature survey. Section III deals with dual RCA. Section IV explains about BEC. Section V deals with RAS. Section VI deals with the delay and area evaluation of all groups of RAS. Simulation results are mentioned in section VII. Results are compared and analyzed in section VIII and section IX concludes the work. Section X indicates the future scope of this work II.LITERATURE SURVEY By generating multiple sums by considering Cin=0 and Cin=1 and then select a carry to generate sum so that the carry propagation delay has been overcome which is proposed by o.j.bedrij.196 [1]. Maximum carry propagation delay in last stage of carry save adder is to be reduced through BEC method which is proposed by Ram Kumar.010 []. Instead of using dual RCA in SQRT CSLA, BEC method is proposed which replaces one set of RCAs thus the total area and power will be reduced to great extent which is proposed by B. Ram Kumar and Harish.M.kittur.011 [7]. III.CSLA USING DUAL RCA Structure of dual RCA is shown in fig.1. It consists of five groups with different sizes of RCAs. The delay and area evaluation of basic blocks used in regular CSLA is shown in table I[7]. The numerals with in square braces of fig.1. specifies the delay. The structure of group is shown in fig.. Consists of two sets of bit RCA. Selection input c1 arrival time is t=7 which is later than s[t=6] but earlier than s3[t=8]. Therefore sum[t=10] is the summation of delay of mux[t=3]. Similar evaluation can be done for remaining other groups[7]. Area and delay evaluation of all groups listed in table II. TABLE I Delay and area of basic blocks of dual RCA Basic blocks TABLE II Delay(number of gates in critical path) Delay and area count of groups in 16bit dual RCA Area (total number of gates) XOR 3 5 :1 MUX 3 4 Half adder 3 6 Full adder 6 13 Delay (number of gates present in critical path) 1 7 6 13 57 3 16 87 4 19 117 5 147 Area (number of gates)

International Journal of Scientific and Research Publications, Volume 4, Issue 6, June 014 A[15:11] B[15:11] A[10:7] B[10:7] A[6:4] B[6:4] A[3:] B[3:] A[1:0] B[1:0] A[15:11] B[15:11] A[10:7] B[10:7] A[6:4] B[6:4] A[3:] B[3:] A[1:0] B[1:0] Cin= 0 Cin Cin 6-b BEC 5-b BEC 4-b BEC 3-b BEC 5 5 4 4 3 3 5 5 4 4 3 3 MUX 1:6 CY MUX 10:5 CY MUX 8:4 CY MUX 6:3 CY MUX 1:6 CY MUX 10:5 CY MUX 8:4 CY MUX 6:3 Cyout sum[15:11] sum[10:7] sum[6:4] sum[3:] sum[1:0] Cyout sum[15:11] sum[10:7] sum[6:4] sum[3:] sum[1:0] Fig.1. 16bit SQRT dual RCA A3 B3 A B Fig.3. 16bit SQRT BEC A3 B3 A B CY 6:3 MUX[3] CY 6:3 MUX[3] C3[10] Sum3[11] Sum[10] Fig.. Delay and Area evaluation of of dual RCA B3 B B1 B0 B0 B1 B0 C3[13] Fig 5. Delay and Area evaluation of of BEC H is a Half Adder F is a Full Adder Sum3[1] Sum[10] the BEC is shown in fig.5. Area and delay evaluation of each group is done manually by referring table1 and listed in table III. a sum Fig.4. BEC logic X3 X X1 X0 b IV.SQRT CSLA USING BEC Structure of 16bit SQRT BEC logic is shown in fig.3. It also consists of 5 groups with different sizes of RCAs. Structure of BEC logic is shown in fig.4. In regular CSLA second set of RCA with Cin=1 can be replaced with BEC logic to reduce the area and power of conventional CSLA[]. of Fig.6. Reconfigured Half Adder carry 1 3 delay

International Journal of Scientific and Research Publications, Volume 4, Issue 6, June 014 3 of 16bit SQRT RAS is shown in fig.9. Total gate area and delay for each group is mentioned in table V. A[15:11] B[15:11] A[10:7] B[10:7] A[6:4] B[6:4] A[3:] B[3:] A[1:0] B[1:0] 6-b RAS 5-b RAS 4-b RAS 3-b RAS Cin 5 5 4 4 3 3 CY MUX1:6 CY MUX 10:5 CY MUX 8:4 CY MUX 6:3 5 4 Cyout sum[15:11] sum[10:7] 3 sum[6:4] sum[3:] sum[1:0] Fig.7. 16bit SQRT RAS TABLE III Delay and area count of groups in 16bit BEC a b c sum carry 1 3 4 5 Delay (number of gates present in critical path) 7 6 13 43 16 66 19 89 11 Area (number of gates) Fig.8. Reconfigured Full Adder A3 B3 A B V.SQRT CSLA USING RAS Simple gate level modification of half adder, full adder blocks can reduces total gate area without affecting the delay. Reconfigurable half adder and full adder structures are shown in fig.6.and fig.8. The structure of SQRT RAS is shown in fig.7. First set of RCAs consists of all full adders can be replaced with reconfigurable adder structures hence the area reduced further. The second set of RCA of regular CSLA, BEC logic of CSLA using BEC is replaced with RAS logic consists of only half adders and not gate. Hence the area reduced furthermore. The delay and area evaluation of reconfigurable adder structures is shown in table IV. Calculation procedure of delay and area is similar to the methods followed for SQRT BEC[7]. CY MUX 6:3 C3[13] Sum3[1] Sum[10]

International Journal of Scientific and Research Publications, Volume 4, Issue 6, June 014 4 Fig.9.group of RAS TABLE IV Delay and area of reconfigurable structures of RAS Basic Delay(numb Area (total blocks er of gates in number of critical path) gates) :1 mux 3 4 Half adder 3 4 Full adder 6 9 TABLE V Delay and area count of groups in 16bit RAS Delay (number of gates present in critical path) 1 7 18 13 34 3 16 51 4 19 68 5 85 Area (number of gates) VI.DELAY AND AREA EVALUATION METHODOLOGY OF 16-BIT CSLA USING RAS Evaluation of delay and area of each group of the proposed structure is similar to the evaluation of SQRT BEC. SQRT RAS uses reconfigurable structures of half adder and full adder having less number of gates, hence area reduced to great extent. Estimation of maximum delay of 16 bit RAS is similar to the delay estimation of 16 bit BEC[7]. By referring Tables III and V, it is clear that, the gate count in CSLA using RAS is reduced without affecting the delay. VII. SIMULATION RESULTS input1 input Area evaluation has been determined as follows 1:- Gate count=* =9*=18 :- Gate count=+(*3)+not+(mux*3) =9+(4*3)+1+(4*3)=34 3:- Gate count=(*)+(*4)+not+(mux*4) =(9*)+(4*4)+1+(4*4)=51 4:- Gate count=(*3)+(*5)+not+(mux*5) =(9*3)+(4*5)+1+(4*5)=68 5:- Gate count=(*4)+(*6)+not+(mux*6) =(9*4)+(4*6)+1+(4*6)=85 (ref table IV for individual gate areas of RAS blocks) Sumout with Sumout with Cin= 1

International Journal of Scientific and Research Publications, Volume 4, Issue 6, June 014 5 TABLE VI Comparison of RAS with BEC and dual RCA dual RCA BEC RAS 1 6 6 18 57 43 34 3 87 66 51 4 117 89 68 5 147 11 85 total 434 336 56 VIII.RESULT ANALYSIS Efficiency of the SQRT CSLA can be evaluated using the comparison of number of gates utilized in the existing adders and the proposed SQRT RAS which is shown in table VI. From the comparison table it is clear that, the proposed SQRT RAS saves 178 gate areas than regular CSLA, 80 gate areas than SQRT BEC without affecting gate delays. So the proposed design has given better results as compared to existing designs. IX.CONCLUSION A simple gate level reconfigurable approach of full adder and half adder is proposed in this paper to reduce the area and power of SQRT CSLA. The proposed CSLA with RAS is simple, low power, area efficient for VLSI implementation. X.FUTURE SCOPE This proposed design is implemented for 16bit word size and parameters like area, delay, power are evaluated. This work can be further extended for 3 bit, 64 bit, 18 bit and so on. REFERENCES [1] O. J. BEDRIJ, CARRY-SELECT ADDER, IRE TRANS. ELECTRON. COMPUT. PP. 340 344, 196. [] B. RAMKUMAR, H.M. KITTUR, AND P. M. KANNAN, ASIC IMPLEMENTATION OF MODIFIED STER CARRY SAVE ADDER, EUR. J. SCI. RES., VOL. 4, NO. 1, PP. 53 58, 010. [3] T. Y. CEIANG AND M. J. HSIAO, CARRY-SELECT ADDER USING SINGLE RIPPLE CARRY ADDER, ELECTRON. LETT., VOL. 34, NO., PP. 101 103, OCT. 1998. [4] Y. KIM AND L.-S. KIM, 64-BIT CARRY-SELECT ADDER WITH REDUCED AREA, ELECTRON. LETT., VOL. 37, NO. 10, PP. 614 615, MAY 001. [5] J. M. RABAEY, DIGTAL INTEGRATED CIRCUITS A DESIGN PERSPECTIVE. UPPER SADDLE RIVER, NJ: PRENTICE-LL, 001. [6] Y. HE, C. H. CNG, AND J. GU, AN AREA EFFICIENT 64-BIT SQUARE ROOT CARRY-SELECT ADDER FOR LOW POWER APPLICATIONS, IN PROC. IEEE INT. SYMP. CIRCUITS SYST., 005, VOL. 4, PP. 408 4085. [7] Ram kumar, B. and Harish M Kittur, (011) Low Power and Area Efficient Carry Select Adder, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, pp.1-5. AUTHORS First Author Neelima.v, Mtech(VLSI), Jagruthi Institute of Engineering & Technology(JIET), neelimavlsi@gmail.com. Second Author R.Ramesh Babu, assistant professor, Jagruthi Institute of Engineering & Technology(JIET), ram4dhani@gmail.com.