Vector radix fast Fourier transform
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 548-551
- https://doi.org/10.1109/icassp.1977.1170349
Abstract
A new radix-2 two-dimensional direct FFT developed by Rivard is generalized in this paper to include arbitrary radices and non-square arrays. It is shown that the radix-4 version of this algorithm may require significantly fewer computations than conventional row-column transform methods. Also, the new algorithm eliminates the matrix transpose operation normally required when the array must reside on a bulk storage device. It requires the same number of passes over the array on bulk storage as efficient matrix transpose routines, but produces the transform in bit-reversed order. An additional pass over the data is necessary to sort the array if normal ordering is desired.Keywords
This publication has 3 references indexed in Scilit:
- Direct fast Fourier transform of bivariate functionsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- A Fast Computer Method for Matrix TransposingIEEE Transactions on Computers, 1972
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965