A Low-Cost, Low-Complexity, and Memory-Free Architecture of Novel Recursive DFT and IDFT Algorithms for DTMF Application

A low-computational complexity and low-cost recursive discrete Fourier transform (RDFT) design using the Chinese remainder theorem is proposed in this brief. The proposed algorithm reduces multiplications by 74% and additions by 73% compared to the latest RDFT algorithms. For computing the 212- and 106-point DFT coefficients, the proposed design can shorten computing cycles by 47% compared with the latest architectures. The hardware resources for the proposed design only require 2 multipliers and 12 adders. The coefficient read-only memory storing the sine and cosine values can be reduced by 100% compared with other recursive algorithms. Therefore, the proposed algorithm is more suitable than other very large scale integration realizations.

[1]  P.K. Meher,et al.  Novel Recursive Solution for Area-Time Efficient Systolization of Discrete Fourier Transform , 2007, 2007 International Symposium on Signals, Circuits and Systems.

[2]  Wen-Hsien Fang,et al.  Recursive fast computation of the two-dimensional discrete cosine transform , 1999 .

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

[4]  Andrew G. Dempster,et al.  Novel recursive-DCT implementations: a comparative study , 2001, Proceedings of the International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications. IDAACS'2001 (Cat. No.01EX510).

[5]  M.R. Schroeder,et al.  Number theory , 1989, IEEE Potentials.

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

[7]  Wen-Ho Juang,et al.  Low-Computation-Cycle, Power-Efficient, and Reconfigurable Design of Recursive DFT for Portable Digital Radio Mondiale Receiver , 2010, IEEE Transactions on Circuits and Systems II: Express Briefs.

[8]  Dong-Sun Kim,et al.  Design of a mixed prime factor FFT for portable digital radio mondiale receiver , 2008, IEEE Transactions on Consumer Electronics.

[9]  Ching-Hsing Luo,et al.  Low Computational Complexity, Low Power, and Low Area Design for the Implementation of Recursive DFT and IDFT Algorithms , 2009, IEEE Transactions on Circuits and Systems II: Express Briefs.

[10]  Yonghong Zeng,et al.  Prime factor algorithm for multidimensional discrete cosine transform , 2001, IEEE Trans. Signal Process..

[11]  Chin-Teng Lin,et al.  VLSI Architecture for the Low-Computation Cycle and Power-Efficient Recursive DFT/IDFT Design , 2007, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[12]  Manfred R. Schroeder.  Number theory in science and communication - with applications in cryptography, physics, digital information, computing, and self-similarity, 4th Edition , 2006, Springer series in information sciences.

[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]  B.L. Evans,et al.  Efficient dual-tone multifrequency detection using the nonuniform discrete Fourier transform , 1998, IEEE Signal Processing Letters.

[15]  Wen-Hsing Hsu,et al.  Parallel implementation of prime-factor discrete cosine transform on the orthogonal multiprocessor , 1993, IEEE Trans. Circuits Syst. Video Technol..

[16]  M. N. Shanmukha Swamy,et al.  New Systolic Algorithm and Array Architecture for Prime-Length Discrete Sine Transform , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

[17]  M. Schroeder.  Number Theory in Science and Communication , 1984 .

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

[19]  Shu-Nung Yao,et al.  A memory-free modified discrete cosine transform architecture for MPEG-2/4 AAC , 2010, IET Circuits Devices Syst..