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

Transcription

1 ISSN: X CODEN: IJPTFI Available Online through Research Article IMPLEMENTATION OF FAST SQUARE ROOT SELECT WITH LOW POWER CONSUMPTION V.Elanangai*, Dr. K.Vasanth Department of Electrical and Electronics, Sathyabama University, Chennai-119. Department of Electrical and Electronics, Sathyabama University, Chennai Received on Accepted on Abstract The main design objective in adder design are area, speed and power. Carry Select Adder (CSLA) is one of the fastest adders which carry out fast arithmetic functions in many data processing processors. However CSLA is not area efficient since many pairs of Ripple carry adders (RCA) are used to generate partial sum and carry which are selected by the multiplexers. From the structure of the CSLA, it is clear that there is scope to reduce area and consumption of power in the CSLA. The result shows that proposed design has occupied less area and consumed less power as compared to regular SQRT CSLA. Keywords: CSLA, fast arithmetic function, SQRT CSLA. I. Introduction Addition of numbers is performed by an adder circuit in electronics. In modern computers adders are placed in arithmetic logic unit (ALU). Although adders are used to represent numeric values, the most common adders operate on binary numbers. In digital adders the speed of addition is reduced since a carry has to propagate through the adder. Similar to other circuit designs, the high performance adder design can be approached at different levels. As a result there is always a tradeoff between the design parameters area, power and speed [1]. There are many ways to design an added. RCA is more compact but speed is less. Carry propagation is the main concern [3]. This brief is structured as follows. Section II deals with the detailed structure and function of BEC logic and architecture of the existing square root carry select adder. Section III presents the structure of the proposed adder. Section IV provides us the implementation results. Section V is about conclusion. IJPT June-2016 Vol. 8 Issue No Page 14679

2 II. Existing Square Root Carry Select adder The basic square-root Carry Select adder has two ripple carry adder with 2:1 multiplexer; the main disadvantage of regular CSLA is its larger area because of multiple pairs of ripple carry adder. To overcome this Binary- to Excess- 1(BEC) method is proposed to reduce the maximum delay of carry propagation in final stage of carry save adder [4]. Fig 1 shows that BEC is used in place of RCA in the regular CSLA to get less area and power consumption [4]-[6]. The advantage of BEC logic is lesser number of logic gates than the n-bit Full Adder (FA). To replace the n-bit RCA, an n+1 bit BEC is required. Fig.2 and Fig. 3 illustrates how the CSLA works basically using mux and 4-bit BEC. One input of the 8:4 mux is the BEC output and another is (B3, B2, B1, and B0). This produces two outputs in parallel and the mux selects BEC output or the direct inputs depending on the control signal Cin. The importance of the BEC logic is area reduction when the CSLA are designed with large number of bits. The Boolean expressions of the 4-bit BEC is shown below. The function table of 4-bit BEC is shown below. Table 1: Functional Table of BEC. Fig.1 Architecture of the Existing CSA. Fig.2 illustrations of 2-bit and 3-bit BEC respectively. IJPT June-2016 Vol. 8 Issue No Page 14680

3 Fig.3 illustrations of 4-bit and 5-bit BEC respectively. III. Proposed Adder From the structure shown in fig. 1, there is a scope for reducing the power and area of CSLA. In that we have replaced RCA with Conditional sum adder (CSA). Fig. 4 gives us the structure of the proposed square root CSLA. Fig.5 shows the Circuit diagram of the proposed adder and Fig.6 shows the layout diagram of the proposed adder. Fig. 5. Circuit Diagram- Proposed square root CSLA. Fig. 6. Layout Diagram- Proposed square root CSLA. IJPT June-2016 Vol. 8 Issue No Page 14681

4 IV. Results and Discussions A. Tabulation The results of the implementation of various fast adders have been done down. Table 2 shows that the square root CSLA is fastest and area efficient. Hence conditional sum adder is implemented in square root CSLA. And when high speed adders are executed using conditional sum adder, square root carry select adder shows better performance than other adders with less combinational delay time ns and relatively less number of slices occupied. Table 3 gives us the amount of power consumed by conventional square root CSLA and Proposed square root CSLA. Table-2. Overall Comparison. 16 BIT S RIPPLE LOOK AHEAD SKIP SELECT SQUARE ROOT CSLA SQUARE ROOT CSLA (CONDITIONAL) XOR AFTER SYNTHESIS 1. NO. OF SLICES NO. OF I/P LUT BONDED IOB DELAY ns ns ns ns ns ns AFTER MAP 1. 4 I/P LUT SLICES OCCUPIED BONDED IOB EQUIVALENT GATE COUNT MAX FAN OUT PLACE AND ROUTE 1. EXTERNAL IOB NO. OF SLICES IJPT June-2016 Vol. 8 Issue No Page 14682

5 Table-3. Power Consumption Comparison. DIFFERENT POWER S SQUARE ROOT 0.220MW CSLA USING BEC SQUARE ROOT CSLA USING 0.163MW CONDITIONAL SUM The proposed adder is observed to have less delay time (14.863ns) and low power (0.163mW) consumption capability if we take the existing adder for comparison. Hence the proposed square root carry select adder using conditional sum adder is proved to be power and time efficient. B. Graph The graph shown in fig 7 proves that when compared to the existing adders the proposed square root csla using conditional sum adder consumes less power. Fig. 7. Power consumption of various 16 bit adders. Fig. 8 Combinational delay path of various 16 bit adders. IJPT June-2016 Vol. 8 Issue No Page 14683

6 The graph shown in fig 8 proves that the proposed adder has less combinational delay path hence improving the speed. V. Conclusion His paper proposes an architecture to reduce the power and delay time of square root CSLA using conditional sum adder. Initially all the high speed adders are studied and the square root carry select adder is observed to be an efficient one. Various adder architectures are also studied and the conditional sum adder is observed to be the effective. This conditional sum adder is now executed in high speed adders and respective results are obtained. Front End Results: The software used for obtaining front end results are XILINX for synthesis and MODELSIM for simulation purpose. When targeted for XC3s1000-5fg900 for FPGA, the architecture consumed 25 slices of the logic having a combinational path delay of ns which is observed to be minimum. Back End Results: Since the power obtained using XILINX is not accurate, back end tools called Dschematic and Micro wind are used. The power results obtained here shows that the proposed architecture consumes 0.163mW of power which is very less. As compared to the regular SQRT CSLA the proposed design has reduced power and delay time with only a slight increase in the area. The proposed adder is observed to have less delay time (14.863ns) and consumes less power (0.163mW) compared to the existing adder. Therefore the proposed square root carry select adder using conditional sum adder is proved to be power and time efficient. References 1. I-Chyn Wey, Cheng-chen Ho, Yi-Sheng Lin and Chien-Chang Peng, An area Efficient Carry Select Adder Design by Sharing the common Boolean Logic Term, International MultiConference of Engineers and Computer Scientists, Vol.II, March AmauryNève, Thomas Ludwig, Denis Flandre, Power- Delay Product Minimization In High-Performance 64-Bit Carry-Select Adders, Ieee Transactions On Very Large Scale Integration (Vlsi) Systems, Vol. 12, No. 3, March Basant Kumar Mohanty,Sujit Kumar Patel, Area Delay Power Efficient Carry Select Adder, Ieee Transactions On Circuits And Systems Ii: Express Briefs, Vol. 61, No. 6, June IJPT June-2016 Vol. 8 Issue No Page 14684

7 4. 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 , T.Y. Ceing and M.J.Hsiao, carry-select adder using single ripple carry adder, Electron. Lett., Vol. 34, No.22, pp , Oct Y. Kim and L. S. Kim, 64-bit carry select adder with Reduced area, Electron, Lett., Vol.37, No. 10, pp , May B.Ram kumar And Harish M Kittur, Low-Power and Area-Efficient Carry Select Adder,Ieee Transactions On Very Large Scale Integration (Vlsi) Systems, Vol. 20, No.2, February Jin-Fu Li, Jiunn-Der Yu, And Yu-Jen Huang, A Design Methodology For Hybrid Carry-Look ahead/carry- Select Adders With Reconfigurability, in Proc. IEEE Int. Symp. Circuits Syst., 2005, vol. 4, pp Johannes Grad And James E. Stine, A Hybrid Ling Carry-Select Adder., Version 6.2.4, March Reza Hashemian, A New Design For High Speed And High-Density Carry Select Adders, 43rdIeee Midwest Symp On Circuits And Systems, Aug- 8-11, RomanaYousuf And Najeeb-Ud-Din, Synthesis of Carry Select Adder In 65 Nm Fpga, in Proc. IEEE Int. Symp. Circuits Syst., 2005, vol. 4, pp Shmuel Wimer,Amnonstanislavsky, Energy Efficient Hybrid adder architecture,thevlsijournal48(2015) Yajuan He, Chip-Hong Chang and JiangminGu, An Area Efficient 64-Bit Square Root Carry-Select Adder For Low Power Applications, A Design Perspective. Upper Saddle River, NJ: Prentice-Hall, YotmgjoonKim And Lee-Sup Kim, A Low Power Carry Select Adder With Reduced Area, Eur. J. Sci. Res., vol. 42, no. 1, pp , Yuke Wang, C. Pai, And Xiaoyu Song, The Design Of Hybrid Carry-Look ahead/carry Select Adders, Ieee Transactions On Circuits And Systems Ii: Analog And Digital Signal Processing, Vol. 49, No. 1, January Yuke Wang, Keshab K. Parhi, A Unified Adder Design, Electron. Lett., vol. 34, no. 22, pp ,oct Corresponding Author: V.Elanangai*, elanangai123@gmail.com IJPT June-2016 Vol. 8 Issue No Page 14685