A general scrambling rule for multidimensional FFT algorithms

This work determines the scrambling rule of the multidimensional Cooley-Tukey FFT, and of the multidimensional prime factor FFT, in complete generality, i.e., for signals defined on lattices of general type. The characteristics of the scrambling rule bear interesting similarities with the 1-D case:...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 1994-07, Vol.42 (7), p.1786-1794
Main Authors: Bernardini, R., Cortelazzo, G.M., Mian, G.A.
Format: Article
Language:English
Subjects:
Applied sciences
Array signal processing
Computational efficiency
Convolution
Exact sciences and technology
Information, signal and communications theory
Lattices
Mathematical methods
Multidimensional signal processing
Multidimensional systems
Signal processing
Signal processing algorithms
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 determines the scrambling rule of the multidimensional Cooley-Tukey FFT, and of the multidimensional prime factor FFT, in complete generality, i.e., for signals defined on lattices of general type. The characteristics of the scrambling rule bear interesting similarities with the 1-D case: the scrambling can be performed on the input data and it can be eliminated from the operations requiring pairs of FFT and inverse FFT (e.g. convolutions and correlations). The results of this work allow one to derive the most efficient way of performing multidimensional scrambling. The consequent memory access savings are relevant, especially with arrays of sizable dimensions.< >
ISSN:1053-587X
1941-0476
DOI:10.1109/78.298284