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