FPGA-Specific Arithmetic Optimizations of Short-Latency AddersReport as inadecuate

FPGA-Specific Arithmetic Optimizations of Short-Latency Adders - Download this document for free, or read online. Document in PDF available to download.

* Corresponding author 1 ARENAIRE - Computer arithmetic Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l-Informatique du Parallélisme 2 TUD - Institute of Computer Engineering

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.

Keywords : FPGA Addition Carry-chain Carry-select Carry-increment

Author: Hong Diep Nguyen - Bogdan Pasca - Thomas Preusser -

Source: https://hal.archives-ouvertes.fr/


Related documents