Design and characterization of parallel prefix adders using FPGAs

Parallel-prefix adders (also known as carry-tree adders) are known to have the best performance in VLSI designs. However, this performance advantage does not translate directly into FPGA implementations due to constraints on logic block configurations and routing overhead. This paper investigates three types of carry-tree adders (the Kogge-Stone, sparse Kogge-Stone, and spanning tree adder) and compares them to the simple Ripple Carry Adder (RCA) and Carry Skip Adder (CSA). These designs of varied bit-widths were implemented on a Xilinx Spartan 3E FPGA and delay measurements were made with a high-performance logic analyzer. Due to the presence of a fast carry-chain, the RCA designs exhibit better delay performance up to 128 bits. The carry-tree adders are expected to have a speed advantage over the RCA as bit widths approach 256.

[1]  David Harris,et al.  A taxonomy of parallel prefix networks , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[2]  Kaushik Roy,et al.  Fine-Grained Redundancy in Adders , 2007, 8th International Symposium on Quality Electronic Design (ISQED'07).

[3]  M. Bečvář,et al.  Fixed-Point Arithmetic in FPGA , 2005 .

[4]  Yervant Zorian,et al.  Easily Testable Cellular Carry Lookahead Adders , 2003, J. Electron. Test..

[5]  Shanzhen Xing,et al.  FPGA Adders: Performance Evaluation and Optimal Design , 1998, IEEE Des. Test Comput..

[6]  Earl E. Swartzlander,et al.  A Spanning Tree Carry Lookahead Adder , 1992, IEEE Trans. Computers.

[7]  Harold S. Stone,et al.  A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations , 1973, IEEE Transactions on Computers.

[8]  H. T. Kung,et al.  A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.

[9]  A.J. Al-Khalili,et al.  Performance of Parallel Prefix Adders implemented with FPGA technology , 2007, 2007 IEEE Northeast Workshop on Circuits and Systems.