Low computation cycle and high speed recursive DFT/IDFT: VLSI algorithm and architecture

In this paper, we propose two low-computation cycle and high-speed recursive discrete Fourier transform (DFT)/inverse DFT (IDFT) architectures adopting the hybrid of Chebyshev polynomial and register-splitting scheme. The proposed core-type recursive architecture achieves half computation-cycle reduction as well as less critical period compared with the conventional second-order DFT/IDFT architecture. So as to further reduce the number of computation cycles, based on the new core-type design, we develop the folded-type recursive DFT/IDFT architecture with the same operating frequency. Moreover, from the derivation results, the operation of DFT and IDFT can be performed with the same structure under different configurations.

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

[2]  Lap-Pui Chau,et al.  Recursive algorithm for the discrete cosine transform with general lengths , 1994 .

[3]  Ramjee Prasad,et al.  OFDM for Wireless Multimedia Communications , 1999 .

[4]  A. W. M. van den Enden,et al.  Discrete Time Signal Processing , 1989 .

[5]  Chih-Chyau Yang,et al.  High-speed area-efficient recursive DFT/IDFT architectures , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[6]  B.L. Evans,et al.  Efficient dual-tone multifrequency detection using the nonuniform discrete Fourier transform , 1998, IEEE Signal Processing Letters.

[7]  T. E. Curtis,et al.  Recursive implementation of prime radix and composite radix Fourier transforms , 1989 .

[8]  V. V. Cizek.  Recursive calculation of Fourier transform of discrete signal , 1982, ICASSP.

[9]  Bin-Da Liu,et al.  Efficient recursive structures for forward and inverse discrete cosine transform , 2004, IEEE Transactions on Signal Processing.

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

[11]  Chih-Peng Fan,et al.  Novel recursive discrete Fourier transform with compact architecture , 2004, The 2004 IEEE Asia-Pacific Conference on Circuits and Systems, 2004. Proceedings..

[12]  Douglas L. Jones,et al.  Real-valued fast Fourier transform algorithms , 1987, IEEE Trans. Acoust. Speech Signal Process..

[13]  U. Jagdhold,et al.  A 64-point Fourier transform chip for high-speed wireless LAN application using OFDM , 2004, IEEE Journal of Solid-State Circuits.

[14]  Richard J. Kozick,et al.  Computation of discrete cosine transform using Clenshaw's recurrence formula , 1995, IEEE Signal Processing Letters.

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

[16]  John V. McCanny,et al.  Discrete cosine transform generator for VLSI synthesis , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).