FPGA-Specific Arithmetic Optimizations of Short-Latency Adders

Hong Diep Nguyen 1 Bogdan Pasca 1 Thomas Preusser 2, *
* Corresponding author
1 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Integer addition is a pervasive operation in FPGA designs. The need for fast wide adders grows with the demand for large precisions as, for example, required for the implementation of IEEE-754 quadruple precision and eliptic-curve cryptography. The FPGA realization of fast and compact binary adders relies on hardware carry chains. These provide a natural implementation environment for the ripple-carry addition (RCA) scheme. As its latency grows linearly with the operand width, wide additions call for acceleration, which is quite reasonably achieved by addition schemes built from parallel RCA blocks. This study presents FPGA-specific arithmetic optimizations for the mapping of carry-select/increment adders targeting the hardware carry chains of modern FPGAs. Different trade-offs between latency and area are presented. The proposed architectures represent attractive alternatives to deeply pipelined RCA schemes.
Document type :
Conference papers
Complete list of metadatas

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00542389
Contributor : Bogdan Pasca <>
Submitted on : Thursday, December 2, 2010 - 2:37:57 PM
Last modification on : Thursday, February 7, 2019 - 4:49:24 PM
Long-term archiving on : Monday, November 5, 2012 - 11:10:28 AM

File

short_latency_adders.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Hong Diep Nguyen, Bogdan Pasca, Thomas Preusser. FPGA-Specific Arithmetic Optimizations of Short-Latency Adders. 2011 International Conference on Field Programmable Logic and Applications (FPL), Sep 2011, Chania, Greece. pp.232 - 237, ⟨10.1109/FPL.2011.49⟩. ⟨ensl-00542389⟩

Share

Metrics

Record views

404

Files downloads

1193