DocumentCode :
1221809
Title :
Synthesis of minimum-area folded architectures for rectangular multidimensional multirate DSP systems
Author :
Sundararajan, Vijay ; Parhi, Keshab K.
Author_Institution :
Wireless Infrastructure Branch, Texas Instrum. Inc., Dallas, TX, USA
Volume :
51
Issue :
7
fYear :
2003
fDate :
7/1/2003 12:00:00 AM
Firstpage :
1954
Lastpage :
1965
Abstract :
In this paper, we formalize a novel multirate multidimensional folding (MMF) transformation, which is a tool used to systematically synthesize control circuits for pipelined very large scale integrated (VLSI) architectures that implement a restricted but immensely practical class, namely, rectangular decimators/expandors with line-by-line scan, of multirate multidimensional algorithms. Although multirate multidimensional algorithms contain decimators and expanders that change the effective sample rate of a discrete-time signal, it is possible using MMF to time multiplex the algorithm to hardware in such a manner that the resulting synchronous architecture requires only a single-clock signal. MMF constraints are derived, and these constraints are used to address two related issues. The first issue is memory requirements in the folded architectures. We derive expressions for the minimum number of memory units required by a folded architecture that implements a multirate multidimensional algorithm. The second issue is retiming. Based on the noble identities of multirate signal processing, we derive retiming for folding constraints that indicate how a multirate multidimensional data flow graph must be retimed for a given schedule to be feasible. The techniques introduced in this paper can be used to synthesize architectures for a wide variety of DSP applications that are based on multirate multidimensional algorithms, such as signal analysis and coding based on subband decompositions and wavelet transforms. Many design examples are considered to demonstrate the viability of MMF. It is shown that MMF is able to save 18-25% area for 1-4 level two-dimensional (2-D) discrete wavelet transforms (DWTs). A tradeoff between computational and storage area is highlighted by our study of a 2064×2064 4-level 2-D DWT. We also present a few 2-D IIR filter designs, where we are able to exploit the throughput bottleneck of these filters to derive extremely low area designs.
Keywords :
IIR filters; VLSI; data flow graphs; discrete wavelet transforms; integrated circuit layout; pipeline processing; two-dimensional digital filters; MMF constraints; VLSI architectures; coding; control circuits; data flow graph; memory requirements; memory units; minimum-area folded architectures; multirate multidimensional algorithm; multirate signal processing; pipelined very large scale integrated architectures; rectangular decimators/expandors; rectangular multidimensional multirate DSP systems; retiming; signal analysis; single-clock signal; subband decompositions; synchronous architecture; wavelet transforms; Control system synthesis; Digital signal processing; Discrete wavelet transforms; IIR filters; Integrated circuit synthesis; Multidimensional signal processing; Multidimensional systems; Signal processing algorithms; Signal synthesis; Very large scale integration;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/TSP.2003.810289
Filename :
1206703
Link To Document :
بازگشت