Download Full-Text PDF Cite this Publication
- Open Access
- Total Downloads : 9
- Authors : Chenna Kesavan P, Dr.S.Kaja Mohideen
- Paper ID : IJERTCONV2IS05004
- Volume & Issue : NCICCT – 2014 (Volume 2 – Issue 05)
- Published (First Online): 30-07-2018
- ISSN (Online) : 2278-0181
- Publisher Name : IJERT
- License: This work is licensed under a Creative Commons Attribution 4.0 International License
Design of High Speed and Area Efficient Modified Carry Select Adder
Design of High Speed and Area Efficient Modified Carry Select Adder
CHENNA KESAVAN P
VLSI & Embedded Systems
Abdur Rahman University Chennai, India
Department of Electronics and Communication Engg B.S.Abdur Rahman University
Abstract Adders are commonly used in many data- processing processors to perform arithmetic operations. Regular Carry Select Adder is one of the techniques used to perform addition faster and computes n+1 bit sum for two n-bit numbers. Regular Carry Select are faster than the ripple carry adder. The Modified Carry Select adders are area efficient when compared to the regular carry select adder which used two ripple carry adder. Modified carry select adder uses BEC to add one circuit and reduces area furthermore, such that total gate count is reduced. Area efficient modified carry select adder further reduces area by modifying the circuit. The result shows that the area efficient modified carry select adder is better than the modified carry select adder.
Key words Regular Carry Select adder, Modified Carry Select adder, Area Efficient Modified Carry Select adder.
The optimization of gates in digital circuits is essential. In VLSI system design the design of area and power efficient high speed logic systems are most essential. In digital adders, the speed of addition is limited by the time required to propagate a carry through the adder. The sum for each bit position in an elementary adder is generated sequentially only after the previous bit position has been summed and a carry propagated into the next position.
The regular CSA which uses two sets of Ripple carry adders for cin=0 and cin=1. The CSLA is used in many systems to overcome the problem of carry propagation delay by independently generating multiple carries and then select a carry to generate the sum.
The Modified Carry Select Adder replaces the RCA block with the Binary to Excess-1 converter to reduce the area. The gates utilization in the BEC block is less compared to the RCA block. The main advantage of this BEC logic comes from the lesser number of logic gates than Full Adder (FA) structure.
The Area Efficient Modified Carry select adder further reduces the usage of gates. The full adders are replaced by the half adders, thus the area can be greatly reduced.
The outline of the paper is as follows. In this paper the section II describes the evaluation of gates in the adder block; the section III describes the evaluation of gates in the Modified Carry select adder, and section IV describes the evaluation of gates in the area efficient modified carry select adder, and section V describes the result. Finally; the conclusion of the paper.
EVALUATION OF GATES
The utilization of gates for the various adder structures are listed out in the table I.
Table1. Adder Block:
From the table I we can come to know that how many gates are been utilized for the half adder, full adder, multiplexers structures.
GATE EVALUATION IN MCSLA:
The modified carry select adder uses RCA block for the carry cin=0 and BEC-1 converter block for the carry cin=1. The structure of group 1 Modified carry Select Adder is shown in fig 1a.
The Boolean expressions of the 4-bit BEC is listed as
X0 = ~B0
X1 = B0 ^ B1
X2 = B2 ^ (B0 & B1)
X3 = B3 ^ (B0 & B1 & B2)
Fig 1a. Group 1
The group 1 structure uses a half adder and a full adder to perform the carry cin=0 operation and for carry cin=1 the BEC- 1 converter block is used.
Fig 1b. Group 2
The group 2 structure uses a half adder and two full adders for cin=0 and BEC-1 block for cin=1.
Fig 1c. Group 3
The fig 1c shows the group 3 structure. The group 3 consist of a half adder and a three full adder for cin=0 and the BEC-1 block for the cin=1.
The table 2 shows the gates required for Modified Carry Select Adder for the various groups.
Table 2. Gate count for MCSLA:
GATE EVALUATION IN AREA EFFICIENT MCSLA:
The area efficient modified carry select adder is shown in the fig. The group 1 structure has been shown Fig 2a. Two input variables of 2-bit length.
Fig 2a.Group 1
The group 1 structure uses Two half adder for cin=0 and BEC-1 block for cin=1. The MUX are used to select the sum and the carry for cin=0 or cin=1 depending upon the select input to the MUX. One full adder has been replaced with the half adder in order reduce the gate count. The group 2 structure has been shown in the Fig 2b.
Fig 2b. Group 2
The group 2 structure uses Three half adder for cin=0 and BEC-1 block for cin=1. Two full adders have been replaced with the half adder in order to reduce the area.
The group 3 structure uses four half adder and the BEC1 converter and the MUX to select the required sum and the Carry. Three full adders have been replaced by the half adder in this structure.
Fig 2c. Group 3
The Table 3 shows the total gates required for the Area Efficient Modified Carry Select Adder for various groups.
Table 3. Gate count for AE-MCSLA:
The total gate count for the regular carry select adder, modified carry select adder and area efficient modified carry select adder are shown in the table 4.
Table 4. Comparison of Gates Used in adders:
The proposed design has been successfully tested using the Xilinx tool. The simulated results have been shown in the Fig
The proposed design requires less number of gates to compare to the existing technique. Thus the area can be greatly reduced by using the area efficient modified carry select adder. The simulation results for various groups have been shown in the fig 3a, fig 3b, fig 3c.
Table 5: area comparison of various adder:
Groups Cell area
Table 6: delay comparison of various adder:
Fig 3a.Simulation Result of Group 3 AE-MCSA
A simple approach is proposed in this paper to reduce the area of modified carry select adder architecture. The vast reduction in the total number of gates is advantageous in terms of both area and power..
Fig 3a.Simulation Result of Group 1 AE-MCSA
Fig 3a.Simulation Result of Group 2AE-MCSA
L.Mugilvannan ,S.Ramasamy ,low power and area efficient carry select adder using modified BEC-1 Converter,ICCNT july 2013
Parmar.s,Design of High Speed Hybrid Carry Select Adder, Advanced computing conference,feb 2013.
K.Rawat, Darwish, T. ; Bayoumi, M.,A Low Power and Reduced area carry select Adder,circuits and system .volume 1.4-7 Aug
Morinaka, H. Makino, H. Nakase, Y. Suzuki, H.,A 64-bit Decarry look ahead CMOS adder using modified carry select adder,custom integrated circuits, 1-4 May.
O. J. Bedrij, Carry-select adder, IRE Trans. Electron. Comput., pp. 340344, 1962.
B. Ramkumar and H. M. Kittur,modified carry select adder(CSLA).
parhi .k.k Low Energy CSMT Carry Generators and Binary Adders,Very large scale integration system,IEEE transaction on (volume :21,issue:4),april 2013.
Manju.SAn Efficient SQRT Archtitecture of Carry Select Adder Design by common Boolean logic,Emerging trends in VLSI,embedded systems,nano electronics and telecommunication system,jan 2013.
Priya.Renhanced Area Efficient Architecture for 128 bit Modified CSLA,circuits,power and computing technologies,march 2013.
Akbar M.A Self-Checking Carry Select Adder with Fault Localization,Digital System Design,sep 2013.
Ramakrishna Reddy Efficient Carry Select Adder using 0.12Âµm technology for low power applications,Advances in computing,communications and informatics,aug 2013.
B. Ramkumar, H. M. Kittur, and P. M. Kannan, ASIC implementation of modified faster carry save adder, Eur. J. Sci. Res., vol. 42, no. 1, pp. 5358, 2010.
Y. Kim and L.-S. Kim, 64-bit carry-select adder with reduced area, Electron. Lett., vol. 37, no. 10, pp. 614615, May 2001.
Y. He, C. H. Chang, and J. Gu, An area efficient 64-bit square root carry-select adder for lowpower applications, in Proc. IEEE Int. Symp. Circuits Syst., 2005, vol. 4, pp. 40824085.