Computing discrete Fourier transform on a rectangular data array

Author

Tsai, Dwen-Ren ; Vulis, Michael

Author_Institution

Dept. of Comput. Sci., City Coll. of New York, NY, USA

Volume

38

Issue

2

fYear

1990

fDate

2/1/1990 12:00:00 AM

Firstpage

271

Lastpage

276

Abstract

The authors generalize the weighted redundancy transform (WRT) algorithm for computing the multidimensional discrete Fourier transform (DFT) in the case in which the sample size (blocklength) is not the same on every axis. The proposed algorithm, like the WRT algorithm, is based on the one-dimensional fast Fourier transform (FFT) and, compared to the traditional ways of computing the multidimensional DFT, offers substantial savings in the number of one-dimensional FFT procedure calls. While the algorithm is applicable to transforms of any dimensions, only the two-dimensional case is explored in detail

Keywords

fast Fourier transforms; WRT algorithm; discrete Fourier transform; fast Fourier transform; multidimensional DFT; one dimensional FFT; rectangular data array; weighted redundancy transform; Cities and towns; Computer science; Data structures; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Fourier transforms; Multidimensional systems; Signal processing algorithms; Tensile stress;

fLanguage

English

Journal_Title

Acoustics, Speech and Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

0096-3518

Type

jour

DOI

10.1109/29.103063

Filename

103063