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.>
No takes yet. Share an insight, caveat, or question.
Wu et al. (1989) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: