Pipelining Saturated Accumulation
Papadantonakis, K.
Kapre, N.
Chan, S.
DeHon, A.
Myricom, Inc., Arcadia, CA;
This paper appears in: Computers, IEEE Transactions on
Publication Date: Feb. 2009
Volume: 58,
Issue: 2
On page(s): 208-219
ISSN: 0018-9340
INSPEC Accession Number: 10370200
Digital Object Identifier: 10.1109/TC.2008.110
First Published: 2008-08-01
Current Version Published: 2009-01-06
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
