Open Access Open Access  Restricted Access Subscription or Fee Access

Gassed Up (High Speed) Carry Select Adder for ALU Blocks

T. Prabakaran, I. Thahirabanu, G. Usha, G. Vishnupriya

Abstract


The regular SQRT CSLA consists of two RCA blocks with carry input as 0 and 1.The Final sum will be selected from multiplexers (MUX) by the carry out generated by the pervious block. This paper, proposes an area and delay efficient carry select adder with logical reduction of excess redundant hardware. In the proposed architecture, we had implemented the RCA with carry input as 1, only with MUX, OR gate and AND gate. For 16-bit regular SQRT CSLA there is a reduction of basic logic gates from 434 to 323.The delay is reduced by replacing Full-adder with half-adder in first bit of every RCA in the proposed architecture. This will reduces the number of Iterations required to get the final sum. The proposed architecture shows that there is reduction of area and delay. Based on this architecture, we designed 4-bit,8-bit,16 -bit and 32-bit Square-root CSLA (SQRT CSLA) and compared with the regular SQRT CSLA. In this work, we evaluated the performance of the proposed design in 90-ηm CMOS Technology in Xilinx Tools. The result analysis shows that, the proposed SQRT CSLA of 4-bit, 8-bit 16-bit and 32-bit has a reduction of 31.74%, 30.13%, 21.92% and 21.76 % respectively compared with regular SQRT CSLA in area. The delay of Proposed SQRT CSLA of 4-bit,8-bit 16-bit and 32-bit are reduce by 27.47%, 17.23%, 14.32% and 11.63% respectively.


Keywords


Application-Specific Integrated Circuit (ASIC), Carry Select Adder (CSLA), Logic Reduction, Redundant Hardware. RippleCarryAdder(RCA), Arithmetic logic unit(ALU)[2].

Full Text:

PDF

References


Ram Kumar, Harish M Kittur, “Low-Power and Area-Efficient Carry Select Adder”, IEEE transaction on very large scale integration (VLSI) systems, vol.20, no.2, pp.371-375, Feb 2012.

O. J. Bedrij, “carry-select adder”, IRE Trans. Electron. Comput, pp.340-344, 1962.

J. M. Rabaey, “Digital Integrated Circuits— A Design perspective”, New Jersey, Prentice-Hall, 2001.

Y. He, C. H. Chang, and J. Gu, “An area efficient 64-bit square root carry-select adder for low power applications”, in Proc. IEEE Int. Symp. Circuits Syst.,2005, vol. 4 ,pp. 4082-4085.

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.

T. Y. Ceiang and M. J. Hsiao,”Carry-select adder using single ripple carry adder”, Electron. Let., vol. 34, no. 22, pp. 2101-2013, Oct. 1998.

Barry W. Johnson, James H. Aylor, Haytham H. Hana, “Efficient Use of Time and Hardware Redundancy for Concurrent Error Detection in a 32-bit VLSI Adder”, IEEE journal of solid-state circuits, Vol. 23No.1, Feb 1988.

Cadence, “Encounter user guide”, Version 4.1.5, May 2005.

Prashant Gurjar, Rashmi Solanki, Pooja Kansliwal, and Mahendra Vucha ,”VLSI Implementation of adders for high speed ALU”, India Conference (INDICON), 2011 Annual IEEE, vol., no., 1,6, 16-18 Dec. 2011.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.