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...Show MoreMetadata
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.
Date of Conference: 09-11 May 1977
Date Added to IEEE Xplore: 29 January 2003
Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA
Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA
Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA
Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA
Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA
Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA
Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA
Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA
