Abstract
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
