Design and Implementation of High Speed 256-Bit Modified Square Root Carry Select Adder

Similar documents
Implementation and Analysis of Area Efficient Architectures for CSLA by using CLA

ISSN:

Implementation of Low Power and Area Efficient Carry Select Adder

An Efficient 64-Bit Carry Select Adder With Less Delay And Reduced Area Application

Research Article Low Power 256-bit Modified Carry Select Adder

An Efficient Carry Select Adder

Implementation of High Speed Adder using DLATCH

128 BIT MODIFIED CARRY SELECT ADDER USING BINARY TO EXCESS-ONE CONVERTER

DESIGN OF HIGH PERFORMANCE, AREA EFFICIENT FIR FILTER USING CARRY SELECT ADDER

128 BIT CARRY SELECT ADDER USING BINARY TO EXCESS-ONE CONVERTER FOR DELAY REDUCTION AND AREA EFFICIENCY

Design and Implementation of Low-Power and Area-Efficient for Carry Select Adder (Csla)

An optimized implementation of 128 bit carry select adder using binary to excess-one converter for delay reduction and area efficiency

FPGA IMPEMENTATION OF LOW POWER AND AREA EFFICIENT CARRY SELECT ADDER

Improved 32 bit carry select adder for low area and low power

Efficient Implementation of Multi Stage SQRT Carry Select Adder

FPGA Implementation of Low Power and Area Efficient Carry Select Adder

Implementation of efficient carry select adder on FPGA

Research Article Design and Implementation of High Speed and Low Power Modified Square Root Carry Select Adder (MSQRTCSLA)

Design of Carry Select Adder using Binary to Excess-3 Converter in VHDL

Modified128 bit CSLA For Effective Area and Speed

The main design objective in adder design are area, speed and power. Carry Select Adder (CSLA) is one of the fastest

Design And Implimentation Of Modified Sqrt Carry Select Adder On FPGA

DESIGN OF LOW POWER AND HIGH SPEED BEC 2248 EFFICIENT NOVEL CARRY SELECT ADDER

Pak. J. Biotechnol. Vol. 14 (Special Issue II) Pp (2017) Parjoona V. and P. Manimegalai

A Review on Hybrid Adders in VHDL Payal V. Mawale #1, Swapnil Jain *2, Pravin W. Jaronde #3

An MFA Binary Counter for Low Power Application

COMPUTATIONAL REDUCTION LOGIC FOR ADDERS

Design and Analysis of Modified Fast Compressors for MAC Unit

Research Article VLSI Architecture Using a Modified SQRT Carry Select Adder in Image Compression

An Efficient High Speed Wallace Tree Multiplier

Efficient Architecture for Flexible Prescaler Using Multimodulo Prescaler

Design of Modified Carry Select Adder for Addition of More Than Two Numbers

Midterm Exam 15 points total. March 28, 2011

Adaptive Fir Filter with Optimised Area and Power using Modified Inner-Product Block

Distributed Arithmetic Unit Design for Fir Filter

VLSI Technology used in Auto-Scan Delay Testing Design For Bench Mark Circuits

International Journal of Scientific & Engineering Research, Volume 5, Issue 9, September ISSN

High Performance Carry Chains for FPGAs

Clock Gating Aware Low Power ALU Design and Implementation on FPGA

LUT OPTIMIZATION USING COMBINED APC-OMS TECHNIQUE

Objectives. Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath

Performance Evolution of 16 Bit Processor in FPGA using State Encoding Techniques

CAD for VLSI Design - I Lecture 38. V. Kamakoti and Shankar Balachandran

TEST PATTERN GENERATION USING PSEUDORANDOM BIST

Design of Low Power Efficient Viterbi Decoder

Chapter 8 Functions of Combinational Logic

OF AN ADVANCED LUT METHODOLOGY BASED FIR FILTER DESIGN PROCESS

LUT Optimization for Memory Based Computation using Modified OMS Technique

Design of Memory Based Implementation Using LUT Multiplier

LFSRs as Functional Blocks in Wireless Applications Author: Stephen Lim and Andy Miller

gate symbols will appear in schematic Dierent of a circuit. Standard gate symbols have been diagram Figures 5-3 and 5-4 show standard shapes introduce

Implementation of Dynamic RAMs with clock gating circuits using Verilog HDL

A Low Power Delay Buffer Using Gated Driver Tree

Design and Implementation of Partial Reconfigurable Fir Filter Using Distributed Arithmetic Architecture

LUT Design Using OMS Technique for Memory Based Realization of FIR Filter

Low Power Approach of Clock Gating in Synchronous System like FIFO: A Novel Clock Gating Approach and Comparative Analysis

12-bit Wallace Tree Multiplier CMPEN 411 Final Report Matthew Poremba 5/1/2009

Keywords Xilinx ISE, LUT, FIR System, SDR, Spectrum- Sensing, FPGA, Memory- optimization, A-OMS LUT.

Design of Polar List Decoder using 2-Bit SC Decoding Algorithm V Priya 1 M Parimaladevi 2

Advanced Devices. Registers Counters Multiplexers Decoders Adders. CSC258 Lecture Slides Steve Engels, 2006 Slide 1 of 20

SA4NCCP 4-BIT FULL SERIAL ADDER

Bit Swapping LFSR and its Application to Fault Detection and Diagnosis Using FPGA

Reconfigurable FPGA Implementation of FIR Filter using Modified DA Method

Metastability Analysis of Synchronizer

Design of a High Frequency Dual Modulus Prescaler using Efficient TSPC Flip Flop using 180nm Technology

Available online at ScienceDirect. Procedia Computer Science 46 (2015 ) Aida S Tharakan a *, Binu K Mathew b

High Speed 8-bit Counters using State Excitation Logic and their Application in Frequency Divider

Efficient Test Pattern Generation Scheme with modified seed circuit.

AN EFFICIENT LOW POWER DESIGN FOR ASYNCHRONOUS DATA SAMPLING IN DOUBLE EDGE TRIGGERED FLIP-FLOPS

TIME SCHEDULE. MODULE TOPICS PERIODS 1 Number system & Boolean algebra 17 Test I 1 2 Logic families &Combinational logic

Gated Driver Tree Based Power Optimized Multi-Bit Flip-Flops

ENGG2410: Digital Design Lab 5: Modular Designs and Hierarchy Using VHDL

A High-Speed Low-Power Modulo 2 n +1 Multiplier Design Using Carbon-Nanotube Technology

THE USE OF forward error correction (FEC) in optical networks

CHAPTER 4 RESULTS & DISCUSSION

R13 SET - 1 '' ''' '' ' '''' Code No: RT21053

CS/ECE 250: Computer Architecture. Basics of Logic Design: ALU, Storage, Tristate. Benjamin Lee

POWER AND AREA EFFICIENT LFSR WITH PULSED LATCHES

Design of BIST with Low Power Test Pattern Generator

A Novel Low Power pattern Generation Technique for Concurrent Bist Architecture

High Performance Dynamic Hybrid Flip-Flop For Pipeline Stages with Methodical Implanted Logic

An Efficient Reduction of Area in Multistandard Transform Core

Lab #6: Combinational Circuits Design

L11/12: Reconfigurable Logic Architectures

Combinational Logic Design

Encoders and Decoders: Details and Design Issues

Reconfigurable Architectures. Greg Stitt ECE Department University of Florida

Memory efficient Distributed architecture LUT Design using Unified Architecture

VLSI IEEE Projects Titles LeMeniz Infotech

Design of an Area-Efficient Interpolated FIR Filter Based on LUT Partitioning

WINTER 15 EXAMINATION Model Answer

Computer Organization & Architecture Lecture #5

LUT Optimization for Distributed Arithmetic-Based Block Least Mean Square Adaptive Filter

MODEL QUESTIONS WITH ANSWERS THIRD SEMESTER B.TECH DEGREE EXAMINATION DECEMBER CS 203: Switching Theory and Logic Design. Time: 3 Hrs Marks: 100

R13. II B. Tech I Semester Regular Examinations, Jan DIGITAL LOGIC DESIGN (Com. to CSE, IT) PART-A

ALONG with the progressive device scaling, semiconductor

Further Details Contact: A. Vinay , , #301, 303 & 304,3rdFloor, AVR Buildings, Opp to SV Music College, Balaji

International Journal of Engineering Research-Online A Peer Reviewed International Journal

Implementation of Memory Based Multiplication Using Micro wind Software

Novel Low Power and Low Transistor Count Flip-Flop Design with. High Performance

Transcription:

Design and Implementation of High Speed 256-Bit Modified Square Root Carry Select Adder Muralidharan.R [1], Jodhi Mohana Monica [2], Meenakshi.R [3], Lokeshwaran.R [4] B.Tech Student, Department of Electronics and Communication, SRM University, Chennai, India [1] B.Tech Student, Department of Electrical and Electronics, SRM University, Chennai, India [2] B.Tech Student, Department of Electronics and Communication, Ramakrishna College, Coimbatore, India [3] B.Tech Student, Department of Electronics and Communication, SNS Technology, Coimbatore, India [4] ABSTRACT: Adders are the most widely used digital component. Carry Select Adder (CSLA) is one of the fast adders which is used for the fast arithmetic operations. The carry-select adder is simple but rather fast, having a gate level depth of O( n). The area and the power consumption of the Ripple carry adders of CSLA are more. By modifying structure of CSLA in gate level, the power and the area of the adder is reduced. The square root CSLA is modified with BEC for reduction of area and power consumption. The modified square root CSLA is designed for 8- bit, 16-bit, 32-bit, 64 bit, 128-bit and 256-bit. The performance of modified square root CSLA improved than the regular CSLA. The proposed design is implemented in Xilinx ISE. KEYWORDS:Binary to Excess-1 Converter (BEC), Ripple Carry Adder (RCA), Carry Select Adder (CSLA), Modified Square root CSLA (Modified SQRT CSLA). I. INTRODUCTION Digital adders are the heart of the processors. The carry propagation adder constitutes many full adders and other components and consumes large area and generates large delay and giving the low performance. But designing of a low area, high speed, less power consuming data path logic system are one of the most substantial areas of research in VLSI system design. Addition operation is the core of computer arithmetic. Arithmetic components are the necessary units of the microprocessor. In digital adders the speed is limited by the time delays. To overcome these problems the various adders are used. One of the adder used is the CSLA. It is classified into two types linear CSLA and non-linear CSLA. The speed of the CSLA is reduced due to the use of the Ripple Carry Adder (RCA) and the CSLA is not efficient due to the use of the more amount of the RCA occupying the large amount of the area. Here in the linear CSLA the huge amount of the RCA is replaced by the Binary to Excess Converters (BEC) reducing the little amount of time delay and the area of the CSLA and increasing the performance. CSLA is used to rectify the problems of carry propagation delay by generating multiple carries and then select a carry to generate the sum [5]. It uses multiple pairs of RCA to generate partial sum and carry by considering carrying 0 and carry in 1, then the final sum and carry are selected by the multiplexers (Mux). Now a day s mobile electronics require the reduce area and decreased use of the components for the portability and the battery life. The Carry Select Adder is used in the many system to overcome the problem of the carry propagation delay by generating multiple carries. II. COMPONENT LEVEL EXPLANATION 1. BINARY TO EXCESS-1 CONVERTER: The main aim of this work is to implement the use of the BEC instead of the RCA in order to reduce the area consumption and power consumption than the regular CSLA. To replace a N-bit RCA, N-1 bits of BEC are required which is more efficient than the regular RCA. Since the RCA has the more delay time the BEC are used in the design. The structure of the 4-bit BEC is shown in the figure 1. Copyright to IJIRSET DOI:10.15680/IJIRSET.2017.0611093 21634

Functional Symbols: & - AND ~ - NOT ^ - E-XOR 2. EVALUTION OF DEALY AND AREA OF THE BASIC ADDER: The E-XOR gate is implemented using the basic gates such as AND, OR and the Inverter (NOT) shown in the figure 2. This implementation is also known as AOI implementation. The gates that present between the dotted lines perform the parallel operations. The area evaluation is done by counting the total number of AND, OR and Inverter (NOT) gates required for each logic block having the delay and the area equal to 1 unit. 3. COMPARISION BETWEEN RCA AND BEC: 4-bit RCA: RCA is made up of the full adders connected in a cascade in which the output from the one full adder is the input to another adder. Therefore the gates require for the building of 4-bit RCA is given by TABLE 1, 4-bit BEC: The 4-bit BEC can be obtained by the Boolean equations from the Fig 1. Therefore the gates required for the building of a 4-bit BEC is given by, TABLE 1: TABLE 2: AND, OR AND INV GATES IN 4-bit RCA AND, OR AND INV GATES IN 4-bit RCA AND 28 OR 16 INV 16 AND 09 OR 03 INV 07 Figure 1. Binary to Excess-1converter Figure 2. Design of E-XOR using AOI The Boolean equations of the BEC are given by X0 = ~B0 X1 = B0 ^ B1 X2 = B2 ^ (B0 & B1) X3 = B3 ^ (B0 & B1 & B2) Copyright to IJIRSET DOI:10.15680/IJIRSET.2017.0611093 21635

4. ARCHITECTURE OF REGULAR CSLA AND MODIFIED SQRT CSLA: Regular 16-bit SQRT CSLA: The carry select adder generally consists of two Ripple Carry Adders one with the input cin=1 and other with the input cin=0. From the Figure 3, the CSLA uses the multiple ripple carry adders with the inputs cin=1 and cin=0. We have used both the half adder and full adder for the input cin=0 and only the full adder for the input cin=1. The Regular 16- bit SQRT CSLA includes many ripple carry adders of various sizes consuming the large amount of the space in the design. Figure 3 shows the structure of the Regular 16-bit SQRT CSLA. In Regular CSLA there is only one RCA is present to perform the least significant addition RCA[1:0], the other RCA perform calculation twice one time with the assumption of the carry being zero cin=0 and carry being one cin=1. Then the final sum and carry are fed into the Multiplexer (MUX). Figure 3. 16-bit Regular SQRT CSLA Modified 16-bit SQRT CSLA: The architecture of modified 16-bit SQRT CSLA is as similar to the Regular 16-bit SQRT CSLA. The only change made is the Ripple Carry Adder (RCA) is replaced by Binary to Excess-1 Converter (BEC) in order to achieve the low power consumption and the less area. In the modified SQRT CSLA the number of gates used is less when compared to the regular SQRT CSLA. Thus BEC replaces the RCA with Cin=1 instead of using dual RCAs to reduce area and power consumption of the conventional CSA. To replace the N-bit RCA, an N+1 bit BEC is required. Figure 4. modified 16-bit SQRT CSLA Modified 32-bit SQRT CSLA: The modified 32-bit SQRT CSLA is as same as the regular CSLA the only change made is the RCA is replaced by the BEC with the carry input cin=1 in order to reduce the power and the area of the CSLA. Modified 64-bit and 128-bit SQRT CSLA: The modified 64-bit SQRT CSLA is constructed using two 32-bit modified SQRT CSLA. The 128-bit SQRT CSLA is constructed using the two 64-bit SQRT CSLA with the carry input cin=1 and the power is reduced very much and the area consumed is also very less Copyright to IJIRSET DOI:10.15680/IJIRSET.2017.0611093 21636

Modified 256-bit SQRT CSLA: The 256-bit SQRT CSLA is constructed using the two 128-bit SQRT CSLA with the carry input cin=1 and the cout of first 128bit module is given as input to the second 128 bit module. The power is reduced very much and the area consumed is also very less. 6. DELAY AND AREA ANALYSIS OF 128-bit SQRT CSLA: The area of the modified SQRT CSLA is very less when compared to the regular SQRT CSLA. From the simulation results the area of the modified 128-bit SQRT CSLA is greatly reduced when compared to the area occupied by the regular 128-bit SQRT CSLA. The delay and the area analysis of various bits of modified SQRT CSLA are given below: AREA OF REGULAR 16-bit SQRT CSLA: Number of Slices: 25 out of 4656 2% Number of 4 input LUT: 45 out of 9312 2% Number of IO s: 50 Fig 5. 16-bit modified SQRT CSLAFig 6. 32-bit modified SQRT CSLA Fig 7. 64-bit modified SQRT CSLAFig 8.128-bit modified SQRT CSLA Fig 9.256-bit modified SQRT CSLA Copyright to IJIRSET DOI:10.15680/IJIRSET.2017.0611093 21637

III. SIMULATION RESULTS The design implemented in this paper is programmed using the Verilog HDL and compiled using the Xilinx ISE and implemented using the Isim software. The simulation results shows there is a reduction of power in increase of each bit. The power consumption of the 256-bit modified SQRT CSLA is 0.418 watts. The simulation results show that peak memory used by the 256-bit modified SQRT CSLA is 167MB which is very low when compared to the regular CSLA. Fig 9. Area analysis Fig 10. Non Clock Nets IV. CONCLUSION The simple approach is implemented in this paper to reduce the area, power consumption and delay of regular SQRT CSLA. The synthesis results show that the modified 256-bit SQRT CSLA has a decrease in area and power with the increase in the number of bits. From the analysis of the graph, delay is reduced and the number of the input is also decreased. The utility of the power of the 256-bit modified SQRT CSLA is also less. The total RAM used in the 256-bit modified SQRT CSLA is 339MB and is low when compared to the regular SQRT CSLA. In this paper the simulation is done using SPARTAN3 family, latest versions will yield better results. The novelty of our approach is been justified by the calculated comparison made with that of the results obtained by Xilinx simulation REFERENCES [1] O. J. Bedrij, Carry-Select Adder, IRE transactions on Electronic Computer, vol.ec-11, pp. 340-346, June1962. [2]M. Moris Mano, DIGITAL DESIGN, Pearson Education, 3rd Edition. [3] Y. Kim and L.-S. Kim, 64-bit carry-select adder with reduced area, Electron. Lett., vol. 37, no. 10, pp. 614 615, May 2001. [4] Akhilesh Tyagi, A Reduced Area Scheme for Carry-Select Adders, IEEE International Conference on Computer design, pp.255-258, September 1990. [5] K.Allipeera and S Ahmed Basha, an efficient 64-bit Carry select adder with less delay and reduce area application. [6]L. Bisdounis, D.Gouvetas, and O. Koufopavlou., A Comparative study of CMOS circuit design styles for low power high speed VLSI circuits, Int. J. of Electronics, vol.84,no. 6, 1998, pp.599-613. Copyright to IJIRSET DOI:10.15680/IJIRSET.2017.0611093 21638

2024 © artsdocbox.com Privacy Policy | Terms of Service | Feedback