CaltechAUTHORS
  A Caltech Library Service

Pipelining Saturated Accumulation

Papadantonakis, Karl and Kapre, Nachiket and Chan, Stephanie and DeHon, André (2009) Pipelining Saturated Accumulation. IEEE Transactions on Computers, 58 (2). pp. 208-219. ISSN 0018-9340. https://resolver.caltech.edu/CaltechAUTHORS:PAPieeetc09

[img]
Preview
PDF - Published Version
See Usage Policy.

2429Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:PAPieeetc09

Abstract

Aggressive pipelining and spatial parallelism allow integrated circuits (e.g., custom VLSI, ASICs, and FPGAs) to achieve high throughput on many Digital Signal Processing applications. However, cyclic data dependencies in the computation can limit parallelism and reduce the efficiency and speed of an implementation. Saturated accumulation is an important example where such a cycle limits the throughput of signal processing applications. We show how to reformulate saturated addition as an associative operation so that we can use a parallel-prefix calculation to perform saturated accumulation at any data rate supported by the device. This allows us, for example, to design a 16-bit saturated accumulator which can operate at 280 MHz on a Xilinx Spartan-3(XC3S-5000-4) FPGA, the maximum frequency supported by the component's DCM.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/TC.2008.110DOIUNSPECIFIED
http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=4585362PublisherUNSPECIFIED
Additional Information:© Copyright 2009 IEEE. Reprinted with permission. Manuscript received 22 July 2007; revised 31 Dec. 2007; accepted 25 June 2008; published online 16 July 2008. Recommended for acceptance by P. Kornerup, P. Montuschi, J.-M. Muller, and E. Schwarz. This research was funded in part by the US National Science Foundation under Grant CCR-0205471. Stephanie Chan was supported by the Marcella Bonsall SURF Fellowship. Karl Papadantonakis was supported by a Moore Fellowship. Scott Weber and Eylon Caspi developed early FPGA implementations of ADPCM which helped identify this challenge. Michael Wrighton provided VHDL coding and CAD tool usage tips.
Funders:
Funding AgencyGrant Number
National Science FoundationCCR-0205471
Marcella Bonsall SURF Fellowship, CaltechUNSPECIFIED
Gordon and Betty Moore FoundationUNSPECIFIED
Subject Keywords:High-speed arithmetic; pipeline and parallel arithmetic and logic structures; saturated arithmetic; accumulation; parallel prefix
Issue or Number:2
Record Number:CaltechAUTHORS:PAPieeetc09
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:PAPieeetc09
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:13060
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:16 Jan 2009 23:18
Last Modified:03 Oct 2019 00:34

Repository Staff Only: item control page