Design of a fully-pipelined systolic array for flexible transposition-free VLSI of 2-D DFT

A novel approach to design an efficient systolic structure to implement the two-dimensional discrete Fourier transform (DFT) is presented. The proposed systolic structure consists of (N/spl times/N) simple locally connected processing elements that perform two complex multiplications and two additions during a cycle period. It does not involve any transposition operation and, therefore, the corresponding hardware and time is saved by the structure. It offers full pipelining, and computes a two-dimensional DFT of size (N/spl times/N) in every N cycles without interruption, since the first stage of operations for one input array may be performed concurrently with second stage of operations of its preceding input array.

[1]  John A. Canaris A VLSI architecture for the real time computation of discrete trigonometric transforms , 1993, J. VLSI Signal Process..

[2]  S.A. White,et al.  Applications of distributed arithmetic to digital signal processing: a tutorial review , 1989, IEEE ASSP Magazine.

[3]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[4]  Huang Liusheng,et al.  A new approach for computing the discrete Fourier transform of arbitrary length , 2000, WCC 2000 - ICSP 2000. 2000 5th International Conference on Signal Processing Proceedings. 16th World Computer Congress 2000.

[5]  Chein-Wei Jen,et al.  Hardware-efficient DFT designs with cyclic convolution and subexpression sharing , 2000 .

[6]  M.N.S. Swamy,et al.  Vector computation of the discrete Fourier transform , 1999 .

[7]  T. Kailath,et al.  VLSI and Modern Signal Processing , 1984 .

[8]  Chein-Wei Jen,et al.  The efficient memory-based VLSI array designs for DFT and DCT , 1992 .

[9]  Jr. Earl E. Swartzlander,et al.  VLSI Signal Processing Systems , 1985 .

[10]  Keshab K. Parhi,et al.  VLSI digital signal processing systems , 1999 .

[11]  H. T. Kung Why systolic architectures? , 1982, Computer.

[12]  C. Burrus Index mappings for multidimensional formulation of the DFT and convolution , 1977 .

[13]  Hyesook Lim,et al.  Multidimensional systolic arrays for the implementation of discrete Fourier transforms , 1999, IEEE Trans. Signal Process..

[14]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[15]  Martin Vetterli,et al.  Fast Fourier transforms: a tutorial review and a state of the art , 1990 .

[16]  T. Parks,et al.  A prime factor FFT algorithm using high-speed convolution , 1977 .

[17]  Harvey F. Silverman,et al.  An introduction to programming the Winograd Fourier transform algorithm (WFTA) , 1977 .

[18]  Mark G. Karpovsky,et al.  Multidimensional fourier transforms by systolic architectures , 1992, J. VLSI Signal Process..