Abstract:
A general form of the matrix representation for multidimensional, vector-radix, fast Fourier transform (FFT) algorithms using decimation-in-frequency is presented. A stru...Show MoreMetadata
Abstract:
A general form of the matrix representation for multidimensional, vector-radix, fast Fourier transform (FFT) algorithms using decimation-in-frequency is presented. A structure theorem is devised to construct systematically various vector-radix decimation-in-frequency FFT algorithms from their 1-D counterparts. Logic diagrams are provided to facilitate the software and hardware implementation of the algorithms. The computational complexity of several of the algorithms is considered.<>
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing ( Volume: 37, Issue: 9, September 1989)
DOI: 10.1109/29.31295