An Area and Speed Efficient Square Root Carry Select Adder Using Optimized Logic Units

Abstract

Adder is an inevitable circuit in any of the VLSI Designs. Since, the arithmetic operations such as subtraction, multiplication and division depends on the operation of addition, adder is dubbed as heart of any Digital Signal Processor (DSP), microprocesso r and VLSI Architecture. In this report, the logic formulations in regular carry select adder (CSLA) and binary to excess 1 converter (BEC) based CSLA are analysed and the data dependency, redundant logic operations were scrutinized to improve the Area - Del ay Product (ADP). All the redundant logic operations identified were removed and a new logic formulation has been proposed for the CSLA based on data dependency. In the proposed arrangement, the carry select (CS) operation is carried out before calculation of final - sum . Carry input for various selections (corresponding to C in = 0 and 1 ) and fixed C in bits are used for logic optimization of CG and CS units. An efficient CSLA scheme is obtained using optimized logic units using BEC based CSLA Approach. The propo sed CSLA design provides significant values of area and delay than the recently proposed CSLAs. Due to a small carry - output delay, the proposed CSLA design is well suited for square - root (SQRT) based variable CSLA Approach. Simulation results shows that th e proposed SQRT - CSLA involves nearly 42% less area - delay - product (ADP) than the existing CSLAs. This is best among the existing CSLA designs for different bit - widths (128, 64, 32 and 16). Area in terms of logical elements and the delay in nano - seconds were obtained through Xilinx ISE 13.2 Version.