• Cite Icon30
  • https://doi.org/10.1109/tc.2012.168Copy DOI Icon

Multioperand Redundant Adders on FPGAs

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Although redundant addition is widely used to design parallel multioperand adders for ASIC implementations, the use of redundant adders on Field Programmable Gate Arrays (FPGAs) has generally been avoided. The main reasons are the efficient implementation of carry propagate adders (CPAs) on these devices (due to their specialized carry-chain resources) as well as the area overhead of the redundant adders when they are implemented on FPGAs. This paper presents different approaches to the efficient implementation of generic carry-save compressor trees on FPGAs. They present a fast critical path, independent of bit width, with practically no area overhead compared to CPA trees. Along with the classic carry-save compressor tree, we present a novel linear array structure, which efficiently uses the fast carry-chain resources. This approach is defined in a parameterizable HDL code based on CPAs, which makes it compatible with any FPGA family or vendor. A detailed study is provided for a wide range of bit widths and large number of operands. Compared to binary and ternary CPA trees, speedups of up to 2.29 and 2.14 are achieved for 16-bit width and up to 3.81 and 3.11 for 64-bit width.

Similar Papers
  • PDF
  • Research Article
  • Citations2

Core-Level Modeling and Frequency Prediction for DSP Applications on FPGAs

  • Jan 01, 2015
  • International Journal of Reconfigurable Computing
  • Gongyu Wang +3
  • PDF
  • Research Article
  • Citations22

Development and Testing on the European Space-Grade BRAVE FPGAs: Evaluation of NG-Large Using High-Performance DSP Benchmarks

  • Jan 01, 2021
  • IEEE Access
  • Vasileios Leon +7
  • Research Article
  • Citations52

Enhanced FPGA reliability through efficient run-time fault reconfiguration

  • Jan 01, 2000
  • IEEE Transactions on Reliability
  • J Lach +2
  • Conference Article
  • Citations1

The research of direct digital frequency synthesis based on FPGA

  • Dec 01, 2013
  • Ningzhuang Liu
  • Research Article
  • Citations13

I/sub DDQ/ testing of bridging faults in logic resources of reconfigurable field programmable gate arrays

  • Jan 01, 1998
  • IEEE Transactions on Computers
  • Lan Zhao +2
  • Conference Article
  • Citations8

A self-reconfigurable platform for general purpose image processing systems on low-cost spartan-6 FPGAs

  • Jun 01, 2011
  • Salih Bayar +2
  • Conference Article
  • Citations7

Securing Boot of an Embedded Linux on FPGA

  • May 01, 2011
  • Florian Devic +2
  • PDF
  • Research Article
  • Citations26

Efficient Smart CMOS Camera Based on FPGAs Oriented to Embedded Image Processing

  • Feb 24, 2011
  • Sensors
  • Ignacio Bravo +5
  • Conference Article
  • Citations5

Low power reconfigurable FPGA based on SRAM

  • Jan 01, 2013
  • A Priadarshini +1
  • Book Chapter
  • Citations2

Field-Programmable Gate Array

  • Jan 01, 2021
  • Mário Pereira Véstias
  • Research Article
  • Citations6

STT-MRAM-Based Multicontext FPGA for Multithreading Computing Environment

  • May 01, 2022
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Jeongbin Kim +5
  • Research Article

Designing of input/output port based on FPGA with handshaking capability

  • Apr 01, 2020
  • Journal of Physics: Conference Series
  • S A Che Kar +5
  • Research Article
  • Citations12

Resource-Efficient Parallel Tree-Based Join Architecture on FPGA

  • Jan 01, 2019
  • IEEE Transactions on Circuits and Systems II: Express Briefs
  • Huan Zhang +4
  • Conference Article
  • Citations4

Exploring Efficiency of Ring Oscillator-Based Temperature Sensor Networks on FPGAs (Abstract Only)

  • Feb 22, 2015
  • Navid Rahmanikia +3
  • Conference Article
  • Citations2

Design and implementation of an RGB to HMMD color conversion module on FPGA

  • Mar 01, 2014
  • Lamjed Touil +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.