Recursive discrete Fourier transform with unified IIR filter structures

In this paper, we propose two unified IIR filters to recursively compute the discrete Fourier transform (DFT). With the advantage of local connection, regularity and modularity, the proposed methods can compute all DFT coefficients with the same filter structure. Based on stability behavior, the proposed IIR filter structures with optimal coefficients can achieve more accurate results than the traditional ones whose filter coefficients should be changed for computing the different DFT coefficients. Simulation results verify the aforementioned theoretical observations.

[1]  G. Goertzel.  An Algorithm for the Evaluation of Finite Trigonometric Series , 1958 .

[2]  S. Winograd.  On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Lap-Pui Chau,et al.  Efficient implementation of discrete cosine transform using recursive filter structure , 1994, IEEE Trans. Circuits Syst. Video Technol..

[4]  Graham A. Jullien,et al.  Recursive algorithm for the discrete cosine transform with regular structure , 1993, Proceedings of 36th Midwest Symposium on Circuits and Systems.

[5]  Yiyan Wu,et al.  COFDM: an overview , 1995, IEEE Trans. Broadcast..

[6]  Y. Z. Zhang,et al.  Fast implementation of recursive DFTs , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

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

[8]  T. E. Curtis,et al.  Hardware-based Fourier transforms: algorithms and architectures , 1983 .

[9]  C. Y. Hsiung,et al.  Elementary theory of numbers , 1992 .

[10]  C. Sidney Burrus,et al.  On computing the split-radix FFT , 1986, IEEE Trans. Acoust. Speech Signal Process..

[11]  I. R. Mactaggart,et al.  A single chip radix-2 FFT butterfly architecture using parallel data distributed arithmetic , 1984, IEEE Journal of Solid-State Circuits.

[12]  Lap-Pui Chau,et al.  Direct formulation for the realization of discrete cosine transform using recursive structure , 1995 .

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

[14]  Charles G. Boncelet.  A rearranged DFT algorithm requiring N2/6 multiplications , 1986, IEEE Trans. Acoust. Speech Signal Process..

[15]  John S. Baras,et al.  Time-recursive computation and real-time parallel architectures: a framework , 1995, IEEE Trans. Signal Process..

[16]  Steven Kay,et al.  Modern Spectral Estimation: Theory and Application , 1988 .

[17]  Graham A. Jullien,et al.  Recursive algorithms for the forward and inverse discrete cosine transform with arbitrary length , 1994, IEEE Signal Processing Letters.