A unified treatment of Cooley-Tukey algorithms for the evaluation of the multidimensional DFT
暂无分享,去创建一个
[1] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[2] J. O. Eklundh,et al. A Fast Computer Method for Matrix Transposing , 1972, IEEE Transactions on Computers.
[3] D.E. Dudgeon,et al. Two-dimensional digital filtering , 1975, Proceedings of the IEEE.
[4] J. McClellan,et al. Vector radix fast Fourier transform , 1977 .
[5] G. Rivard. Direct fast Fourier transform of bivariate functions , 1977 .
[6] E. Hoyer,et al. An algorithm for the two dimensional FFT , 1977 .
[7] R.M. Mersereau,et al. The processing of hexagonally sampled two-dimensional signals , 1979, Proceedings of the IEEE.
[8] H. Nussbaumer,et al. Fast computation of discrete Fourier transforms using polynomial transforms , 1979 .
[9] B. Arambepola,et al. Fast computation of multidimensional discrete fourier transforms , 1980 .
[10] G. Anderson,et al. A stepwise approach to computing the multidimensional fast Fourier transform of large arrays , 1980 .
[11] Russell M. Mersereau,et al. An interpolation technique for periodically sampled two-dimensional signals , 1981, ICASSP.