DocumentCode
1133589
Title
Fast Fourier Transforms on Finite Non-Abelian Groups
Author
Karpovsky, M.G.
Author_Institution
Computer Science Division, Department of Mathematics, Tel-Aviv University
Issue
10
fYear
1977
Firstpage
1028
Lastpage
1030
Abstract
Recent works [1]-[9] were devoted to the properties and application of Fourier transforms over finite Abelian groups and fast Fourier transforms for calculation of the corresponding spectra. In this correspondence we describe Fourier transforms on finite non-Abelian groups and appropriate algorithms of fast Fourier transforms.
Keywords
Fast Fourier transforms and fast inverse Fourier transforms on finite non-Abelian groups, fast Hadamard-Walsh and fast Hadamard-Chrestenson transforms, Fourier transforms on finite non-Abelian groups, irreducible representations of groups.; Automata; Computer science; Fast Fourier transforms; Fourier transforms; Galois fields; Linear approximation; Mathematics; Network synthesis; Pattern recognition; Telephony; Fast Fourier transforms and fast inverse Fourier transforms on finite non-Abelian groups, fast Hadamard-Walsh and fast Hadamard-Chrestenson transforms, Fourier transforms on finite non-Abelian groups, irreducible representations of groups.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1977.1674739
Filename
1674739
Link To Document