High-performance carry chains for FPGA's
- 1 April 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 8 (2), 138-147
- https://doi.org/10.1109/92.831434
Abstract
Carry chains are an important consideration for most computations, including FPGA's. Current FPGA's dedicate a portion of their logic to support these demands via a simple ripple carry scheme. In this paper, we demonstrate how more advanced carry constructs can he embedded into PPGA's, providing significantly higher performance carry computations. We redesign the standard ripple carry chain to reduce the number of logic levels in each cell. We also develop entirely new carry structures based on high-performance adders such as carry select, carry lookahead, and Brent-Kung. Overall, these optimizations achieve a speedup in carry performance of 3.8 times over current architectures.Keywords
This publication has 6 references indexed in Scilit:
- An algorithm and design procedure for high speed carry select adders using FPGA technologyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- FPGA adders: performance evaluation and optimal designIEEE Design & Test of Computers, 1998
- Performance evaluation of FPGA implementations of high-speed addition algorithmsPublished by SPIE-Intl Soc Optical Eng ,1996
- On implementing addition in VLSI technologyJournal of Parallel and Distributed Computing, 1988
- A Regular Layout for Parallel AddersIEEE Transactions on Computers, 1982
- Conditional-Sum Addition LogicIEEE Transactions on Electronic Computers, 1960