Stéphane Simard
ABSTRACT
This article is a concise literature review of the actual state of the art in arithmetic for field-programmable gate arrays (FPGAs), including studies, implementation techniques, operators, and structures, in various area-time tradeoffs. It covers the integer operations of addition/subtraction, multiplication, squaring, division, and square root, in parallel, and in both serial modes (least-significant digit first, and online). Many people, including researchers in the field of computer arithmetic, parallel computing, digital signal and image processing, system-on-a-programmable chip (SoPC) designers, and other people with a need to implement special purpose arithmetic circuits on FPGAs, might find such a review useful, either as an introduction to the topic, as a knowledge update, or for reference.
- A 2005 review of FPGA arithmetic (abstract only)
Recommendations
Improving FPGA performance for carry-save arithmetic
The selective use of carry-save arithmetic, where appropriate, can accelerate a variety of arithmetic-dominated circuits. Carry-save arithmetic occurs naturally in a variety of DSP applications, and further opportunities to exploit it can be exposed ...
FPGA fault tolerant arithmetic logic: a case study using parallel-prefix adders
This paper examines fault tolerant adder designs implemented on FPGAs which are inspired by the methods of modular redundancy, roving, and gradual degradation. A parallel-prefix adder based upon the Kogge-Stone configuration is compared with the simple ...
FPGA-Specific Arithmetic Optimizations of Short-Latency Adders
FPL '11: Proceedings of the 2011 21st International Conference on Field Programmable Logic and ApplicationsInteger 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 elliptic-curve cryptography. The ...
Comments