DocumentCode :
822043
Title :
Pipelining saturated accumulation
Author :
Papadantonakis, Karl ; Kapre, Nachiket ; Chan, Shing-Chow ; DeHon, Andre
Author_Institution :
Myricom, Inc., Arcadia, CA, USA
Volume :
58
Issue :
2
fYear :
2009
Firstpage :
208
Lastpage :
219
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.
Keywords :
digital signal processing chips; integrated circuits; pipeline arithmetic; signal processing; aggressive pipelining; cyclic data dependencies; digital signal processing; integrated circuits; parallel-prefix calculation; pipelining saturated accumulation; spatial parallelism; Adders; Delay; Equations; Field programmable gate arrays; Logic gates; Pipeline processing; Throughput; Algorithms; High-speed arithmetic; Pipeline; accumulation; parallel prefix.; pipeline and parallel arithmetic and logic structures; saturated arithmetic;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.2008.110
Filename :
4585362
Link To Document :
بازگشت