A sequential multidimensional Cooley-Tukey algorithm

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 si...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 1994-09, Vol.42 (9), p.2430-2438
Main Authors: Bernardini, R., Cortelazzo, G.M., Mian, G.A.
Format: Article
Language:English
Subjects:
Applied sciences
Cache memory
Exact sciences and technology
Geometry
Image processing
Image sequence analysis
Information, signal and communications theory
Mathematical methods
Multidimensional signal processing
Multidimensional systems
Signal processing algorithms
Telecommunications
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
ISSN:1053-587X
1941-0476
DOI:10.1109/78.317864