A low-cost, low-complexity, and memory-free architecture of novel recursive DFT and IDFT algorithms for DTMF application

Authors:
Shin-Chi Lai;Sheau-Fang Lei;Wen-Ho Juang;Ching-Hsing Luo
Affiliations:
Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan;Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan;Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan;Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan
Venue:
IEEE Transactions on Circuits and Systems II: Express Briefs
Year:
2010

Citing 6
Cited 0

Recursive discrete Fourier transform with unified IIR filter structures

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

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Low-computation-cycle, power-efficient, and reconfigurable design of recursive DFT for portable digital radio mondiale receiver

IEEE Transactions on Circuits and Systems II: Express Briefs
Number Theory in Science and Communication: With Applications in Cryptography, Physics, Digital Information, Computing, and Self-Similarity

Number Theory in Science and Communication: With Applications in Cryptography, Physics, Digital Information, Computing, and Self-Similarity
Prime factor algorithm for multidimensional discrete cosinetransform

IEEE Transactions on Signal Processing
Design of a mixed prime factor FFT for portable digital radio mondiale receiver

IEEE Transactions on Consumer Electronics

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.