Generalizing the discrete Fourier transform (Q1822477): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The complexity of group algebra computations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3321411 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Zur Algebraischen Diskreten Fourier-Transformation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Endliche Gruppen I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Fourier Transforms on Finite Non-Abelian Groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Fourier transform and convolution algorithms / rank | |||
Normal rank |
Latest revision as of 19:51, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generalizing the discrete Fourier transform |
scientific article |
Statements
Generalizing the discrete Fourier transform (English)
0 references
1985
0 references
The author defines the generalized discrete Fourier transform (GDFT (\({\mathbb{F}}G))\) as being the mapping \(\sigma_ G: {\mathbb{F}}G\to A_ 1\oplus...\oplus A_ s\) which decomposes the semisimple group algebra \({\mathbb{F}}G\) into simple Wedderburn components \(A_ i\), \(i=1,...,s\). The GDFT also satisfies the known properties of the DFT (inversion, convolution, phase shift, Parseval-Plancherel-identity). The associated mappings \(\sigma_ i: {\mathbb{F}}G\to A_ i\) are the irreducible representations of the group algebra which plays the role of a universal \({\mathbb{F}}G\)-module in which each other \({\mathbb{F}}G\)-module occurs. Since in many applications such as coding theory, signal processing and picture processing, the set of data forms an \({\mathbb{F}}G\)- module, the importance of the study of irreducible representations is clear from the point of view of applications. The computational aspects are analyzed and fast versions of the GDFT are described in case \({\mathbb{F}}\) is a splitting field or a prime field.
0 references
generalized discrete Fourier transform
0 references
semisimple group algebra
0 references
simple Wedderburn components
0 references
inversion
0 references
convolution
0 references
phase shift
0 references
Parseval- Plancherel-identity
0 references
irreducible representations
0 references
coding theory
0 references
signal processing
0 references
picture processing
0 references
splitting field
0 references
prime field
0 references