Fast Generalized Fourier Transforms
暂无分享,去创建一个
[1] M. D. ATKINSON,et al. The Complexity of Group Algebra Computations , 1977, Theor. Comput. Sci..
[2] Mit Press,et al. A Linear Filtering Approach to the Computation of the Discrete Fourier Transform , 1969 .
[3] Michael Clausen. Fast Fourier Transforms for Metabelian Groups , 1989, SIAM J. Comput..
[4] L. Bluestein. A linear filtering approach to the computation of discrete Fourier transform , 1970 .
[5] Stanley L. Hurst,et al. Spectral techniques in digital logic , 1985 .
[6] H. Nussbaumer. Fast Fourier transform and convolution algorithms , 1981 .
[7] C. Rader. Discrete Fourier transforms when the number of data samples is prime , 1968 .
[8] B. Huppert. Endliche Gruppen I , 1967 .
[9] Jacques Morgenstern,et al. Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform , 1973, JACM.
[10] Thomas Beth,et al. On the Computational Complexity of the General Discrete Fourier Transform , 1987, Theor. Comput. Sci..
[11] R. Thrall,et al. Young’s semi-normal representation of the symmetric group , 1941 .
[12] Mark G. Karpovsky,et al. Fast Fourier Transforms on Finite Non-Abelian Groups , 1977, IEEE Transactions on Computers.
[13] C. Curtis,et al. Representation theory of finite groups and associated algebras , 1962 .
[14] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .