A new design for high speed and high-density carry select adders

An algorithm with logarithmic carry propagation delay is developed for high-density adders. The design procedure is introduced for the construction of a 64-bit adder with maximum path delay equivalent to 8 gate delays. The algorithm is based on the carry select technique with operands partitioned into very fine slices for both quick response and low gate counts. Another property observed in this algorithm is resource (hardware) sharing which is due to regularity of the carry channel structure. The design is coded in Verilog, simulated and implemented using XC4010E Xilinx FPGA technology.

[1]  Reza Hashemian.  An algorithm and design procedure for high speed carry select adders using FPGA technology , 1994, Proceedings of 1994 37th Midwest Symposium on Circuits and Systems.

[2]  Orest J. Bedrij.  Carry-Select Adder , 1962, IRE Trans. Electron. Comput..

[3]  Behrooz Parhami,et al.  Computer arithmetic - algorithms and hardware designs , 1999 .

[4]  Neil Weste,et al.  Principles of CMOS VLSI Design , 1985 .

[5]  Norman R. Scott.  Computer Number Systems and Arithmetic , 1984 .

[6]  Reza Hashemian.  A new algorithm to construct parallel adder for high density codes , 1993, Proceedings of 36th Midwest Symposium on Circuits and Systems.

[7]  Harvey L. Garner,et al.  A Survey of Some Recent Contributions to Computer Arithmetic , 1976, IEEE Transactions on Computers.

[8]  E.E. Swartzlander,et al.  Variable spanning tree adder , 1995, Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers.

[9]  A. El Gamal,et al.  Architecture of field-programmable gate arrays , 1993, Proc. IEEE.

[10]  Bruce Gilchrist,et al.  Fast Carry Logic for Digital Computers , 1955, IRE Trans. Electron. Comput..