A sequential multidimensional Cooley-Tukey algorithm

Author

Bernardini, Riccardo ; Cortelazzo, Guido Maria ; Mian, Gian Antonio

Author_Institution

Dipartimento di Elettronica e Inf., Padova Univ., Italy

Volume

42

Issue

9

fYear

1994

fDate

9/1/1994 12:00:00 AM

Firstpage

2430

Lastpage

2438

Abstract

This work extends the serial/parallel and parallel/serial sequential FFT algorithms proposed, in the 1-D case by Singleton (1967) to the multidimensional (MD) case. MD sequential FFT can be profitably exploited for processing large data arrays that do not fit easily into the computer memory. Such situations are typical in image sequence analysis (for instance, it is quite common with television sequences). The MD sequential FFT retains the constant geometry characteristics of the Singleton algorithms, which is a feature that is very useful for implementation purposes

Keywords

fast Fourier transforms; image sequences; parallel algorithms; Singleton algorithms; constant geometry characteristics; geometry characteristics; image sequence analysis; multidimensional sequential FFT; parallel/serial sequential FFT algorithms; sequential multidimensional Cooley-Tukey algorithm; serial/parallel sequential FFT algorithms; television sequences; Cache memory; Geometry; Helium; Image processing; Image sequence analysis; Multidimensional signal processing; Multidimensional systems; Signal processing algorithms; TV; Telecommunications;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.317864

Filename

317864