论文信息 - Generalized Fourier Transforms

Generalized Fourier Transforms

In the process of specifying and modelling data structures for wide classes of real-time applications (signal-processing, pattern recognition, communications engineering) it has become a helpful tool to choose these structures as algebras which allow a group of automorphisms acting on the set of data.

Thomas Beth | T. Beth

[1] S. Winograd. Arithmetic complexity of computations , 1980 .

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

[3] B. Huppert. Endliche Gruppen I , 1967 .

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

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

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

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

[8] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[9] N. Jacobson,et al. Basic Algebra I , 1976 .

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

[11] Jean-Pierre Serre,et al. Linear representations of finite groups , 1977, Graduate texts in mathematics.

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

[13] Irving John Good,et al. The Interaction Algorithm and Practical Fourier Analysis , 1958 .

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