Multiple radix fast Fourier transformation based on number theoretic transforms (Q757003)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multiple radix fast Fourier transformation based on number theoretic transforms |
scientific article; zbMATH DE number 4193072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiple radix fast Fourier transformation based on number theoretic transforms |
scientific article; zbMATH DE number 4193072 |
Statements
Multiple radix fast Fourier transformation based on number theoretic transforms (English)
0 references
1991
0 references
Discrete Fourier transform on a prime number of samples is computed by means of the multiple radix fast Fourier transformation based on number theoretic transforms. This proposal is efficient in the transformation of samples \(P=2^{k1}3^{k2}5^{k3}\) with arbitrary integers ki \((i=1,2,3)\).
0 references
residue arithmetic
0 references
Chinese remainder theorem
0 references
cyclic convolution
0 references
Discrete Fourier transform
0 references
multiple radix fast Fourier transformation
0 references
number theoretic transforms
0 references
0.9346013
0 references
0.90595675
0 references
0.9005616
0 references
0.89651674
0 references
0.8949271
0 references
0.8831233
0 references
0.8794465
0 references
0 references
