论文信息 - On the Computational Complexity of the General Discrete Fourier Transform

On the Computational Complexity of the General Discrete Fourier Transform

Abstract In this paper the complexity of computing the General Discrete Fourier Transform over group algebras of finite groups is studied. Starting with a short introduction to known results, the complexity gains of a new algorithm derived from Clifford's theorem are discussed. Applying these results to the class of finite solvable groups, new upper bounds, also for the complexity of the underlying group algebras, are derived.

Thomas Beth | T. Beth

[1] Thomas Beth,et al. Algebraic and Symbolic Computation in Digital Signal Processing, Coding and Cryptography , 1985, European Conference on Computer Algebra.

[2] V. Strassen. Gaussian elimination is not optimal , 1969 .

[3] Jacques Morgenstern,et al. Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform , 1973, JACM.

[4] Robert L. Griess,et al. Schur multipliers of the known finite simple groups , 1972 .

[5] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .

[6] Irving Reiner,et al. Methods of Representation Theory , 1981 .

[7] Franz Pichler,et al. Analog Scrambling by the General Fast Fourier Transform , 1982, EUROCRYPT.

[8] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.

[9] H. Nussbaumer. Fast Fourier transform and convolution algorithms , 1981 .

[10] M. D. ATKINSON,et al. The Complexity of Group Algebra Computations , 1977, Theor. Comput. Sci..

[11] Volker Strassen,et al. The asymptotic spectrum of tensors and the exponent of matrix multiplication , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[12] I. Isaacs. Character Theory of Finite Groups , 1976 .

[13] Mark G. Karpovsky,et al. Fast Fourier Transforms on Finite Non-Abelian Groups , 1977, IEEE Transactions on Computers.