Decimation-in-time-frequency FFT algorithm

Author

Saidi, Ali

Author_Institution

Paging & Wireless Data Group, Motorola Appl. Res., Boynton Beach, FL, USA

fYear

1994

fDate

19-22 Apr 1994

Abstract

A new fast Fourier transform algorithm is presented. The decimation-in-time (DIT) and the decimation-in-frequency (DIF) FFT algorithms are combined to introduce a new FFT algorithm, decimation-in-time-frequency (DITF) FFT algorithm, which reduces the number of real multiplications and additions. The DITF FFT algorithm reduces the arithmetic complexity while using the same computational structure as the conventional Cooley-Tukey (CT) FFT algorithm. The algorithm is extended to radix-R FFT as well as the multidimensional FFT algorithm using the vector-radix FFT

Keywords

computational complexity; digital arithmetic; fast Fourier transforms; recursive estimation; signal processing; time-frequency analysis; Cooley-Tukey FFT algorithm; additions; arithmetic complexity; decimation-in-time-frequency algorithm; fast Fourier transform algorithm; multidimensional FFT algorithm; multiplications; radix-R FFT; vector-radix FFT; Arithmetic; Binary trees; Discrete Fourier transforms; Equations; Fast Fourier transforms; Frequency; Heart; Multidimensional systems; Paging strategies; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1994. ICASSP-94., 1994 IEEE International Conference on

Conference_Location

Adelaide, SA

ISSN

1520-6149

Print_ISBN

0-7803-1775-0

Type

conf

DOI

10.1109/ICASSP.1994.389992

Filename

389992