Abstract
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.
With this data algebras being suchwise enhanced many of the above mentioned applications find a natural description.
In this lecture we will show that this description can successfully be used for a unifying approach to fast algorithms for many applications e.g. by reproducing the known classes of FFT's. The concept of the generalized Fourier-Transform can also be used in this context to generate such algorithms almost mechanically, as we will show in some examples.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
9. Literature
A. Aho, J.E. Hopcroft, J.D. Ullman: "The design and Analysis of Computer Algorithms", Addison-Wesley 1974
M.D. Atkinson: "The complexity of Group Algebra Computations", Theoretical Computer Science, I, p.205–209, 1977
T. Beth: "Verfahren der Schnellen Fourier Transformation", Teubner Verlag Stuttgart, 1984
J.W. Cooley, J.W. Tukey: "An Algorithm for the machine calculation of complex Fourier series", Math. Comp., nr. 19, p.297–301, 1965
C.W. Curtis, I. Reiner: "Methods of Representation Theory", Wiley-Interscience, 1981
W. Feit, J.G. Thompson: "Solvability of Groups of Odd Order", Pacific J.Math., nr.13, p.755–1029, 1963
I.J. Good: "The interaction algorithm and practical Fourier series", J.Royal Stat. Soc., ser.B, nr.20, p.361–372, 1958
B. Huppert: "Endliche Gruppen I", Springer Verlag, 1967
N. Jacobson: "Basic Algebra I", 1974, "Basic Algebra II", 1980, Freeman
M.G. Karpovski: "Fast Fourier Transforms of Finite Non-Abelian Groups", IEEE Trans. Computers, vol.26, nr.10, p.1028–1030, 1977
S. Lang: "Algebra", Addison-Wesley, 1965
F.J.McWilliams, N.J.A. Sloane: "The Theory of Error-Correcting Codes", North-Holland, 1977
J. Morgenstern: "Note on a lower bond of the linear complexity of the fast Fourier Transform", J.ACM, vol.20, nr.2, p.305–306, 1973
H.J. Nussbaumer: "Fast Fourier Transform and Convolution Algorithms", Springer Verlag, 1981
F. Pichler: "Analog Scrambling by the General Fast Fourier Transform", Comp. Science Lect. Notes, vol.149, p.173–178, 1983
J.P. Serre: "Linear Representations of Finite Groups", Springer Verlag, 1971
S. Winograd: "Arithmetic Complexity of Computations", S.I.A.M. CBMS-NSF Regional Conference Series in Applied Mathematics, 1980
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beth, T. (1988). Generalized Fourier Transforms. In: Janßen, R. (eds) Trends in Computer Algebra. Lecture Notes in Computer Science, vol 296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18928-9_7
Download citation
DOI: https://doi.org/10.1007/3-540-18928-9_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18928-2
Online ISBN: 978-3-540-38850-0
eBook Packages: Springer Book Archive