VLSI Architecture for the Low-Computation Cycle and Power-Efficient Recursive DFT/IDFT Design

In this paper, we propose one low-computation cycle and power-efficient recursive discrete Fourier transform (DFT)/inverse DFT (IDFT) architecture adopting a hybrid of input strength reduction, the Chebyshev polynomial, and register-splitting schemes. Comparing with the existing recursive DFT/IDFT architectures, the proposed recursive architecture achieves a reduction in computation-cycle by half. Appling this novel low-computation cycle architecture, we could double the throughput rate and the channel density without increasing the operating frequency for the dual tone multi-frequency (DTMF) detector in the high channel density voice over packet (VoP) application. From the chip implementation results, the proposed architecture is capable of processing over 128 channels and each channel consumes 9.77 μW under 1.2 [email protected] in TSMC 0.13 1P8M CMOS process. The proposed VLSI implementation shows the power-efficient advantage by the low-computation cycle architecture.

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

[2]  D. Vazquez,et al.  A low-voltage low-power high performance fully integrated DTMF receiver , 2001, Proceedings of the 27th European Solid-State Circuits Conference.

[3]  Min Ju Park,et al.  Signal detection and analysis of DTMF receiver with quick Fourier transform , 2004, 30th Annual Conference of IEEE Industrial Electronics Society, 2004. IECON 2004.

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

[5]  Fu-Kun Chen,et al.  Recursive discrete Fourier transform with unified IIR filter structures , 2002, Signal Process..

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

[7]  B.L. Evans,et al.  Unification and evaluation of equalization structures and design algorithms for discrete multitone modulation systems , 2005, IEEE Transactions on Signal Processing.

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

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

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

[11]  Chun-Ming Huang,et al.  Low computation cycle and high speed recursive DFT/IDFT: VLSI algorithm and architecture , 2005, IEEE Workshop on Signal Processing Systems Design and Implementation, 2005..

[12]  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..

[13]  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).

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

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

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

[17]  Ming Ding,et al.  An achievable performance upper bound for discrete multitone equalization , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..