Recursive discrete Fourier transform with unified IIR filter structures

Authors:
Jar-Ferr Yang;Fu-Kun Chen
Affiliations:
Department of Electrical Engineering, National Cheng Kung University, 1 University Road, Tainan, Taiwan 70101;Department of Electrical Engineering, National Cheng Kung University, 1 University Road, Tainan, Taiwan 70101
Venue:
Signal Processing
Year:
2002

Citing 1
Cited 4

Time-recursive computation and real-time parallel architectures: aframework

IEEE Transactions on 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
A low-cost, low-complexity, and memory-free architecture of novel recursive DFT and IDFT algorithms for DTMF application

IEEE Transactions on Circuits and Systems II: Express Briefs
Efficient computation of the short-time DFT based on a modified radix-2 decimation-in-frequency algorithm

Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

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.