An algorithm for computing the Nth roots of unity in bit-reversed order (Q3036657)
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: An algorithm for computing the Nth roots of unity in bit-reversed order |
scientific article; zbMATH DE number 3831256
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for computing the Nth roots of unity in bit-reversed order |
scientific article; zbMATH DE number 3831256 |
Statements
An algorithm for computing the Nth roots of unity in bit-reversed order (English)
0 references
1980
0 references
bit-reversed order
0 references
fast Fourier transform
0 references
Nth roots of unity
0 references
cumulative roundoff error
0 references
discrete Fourier transform of a time series
0 references
