Generalization of the algebraic discrete Fourier transform with application to fast convolutions (Q2277806)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4197372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalization of the algebraic discrete Fourier transform with application to fast convolutions |
scientific article; zbMATH DE number 4197372 |
Statements
Generalization of the algebraic discrete Fourier transform with application to fast convolutions (English)
0 references
1990
0 references
The algebraic discrete Fourier transform (ADFT) over finite fields was introduced by \textit{T. Beth} [Verfahren der schnellen Fourier- Transformation (1984; Zbl 0536.65098)]. Now using the normal basis concept, the ADFT for finite commutative rings with identity is defined. The connection between the ADFT, the minimal polynomial transform and the so-called ``reduced transform'' is described. This generalized ADFT has similar properties as the ``classical'' ADFT and can be applied to fast cyclic convolutions due to suitable hardware implementations.
0 references
algebraic discrete Fourier transform
0 references
finite fields
0 references
normal basis
0 references
finite commutative rings
0 references
minimal polynomial transform
0 references
reduced transform
0 references
fast cyclic convolutions
0 references
0 references
0 references
0 references
0.8509964942932129
0 references
0.7862902879714966
0 references
