Fast digit-reversal algorithms on a shared-memory machine (Q1315919)
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: Fast digit-reversal algorithms on a shared-memory machine |
scientific article; zbMATH DE number 516724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast digit-reversal algorithms on a shared-memory machine |
scientific article; zbMATH DE number 516724 |
Statements
Fast digit-reversal algorithms on a shared-memory machine (English)
0 references
24 March 1994
0 references
The digit-reversal permutation can constitute a considerable amount of the total running time of a fast Fourier transform. Applying special vector operations, the authors derive two new parallel algorithms for converting the components of a vector of length \(n=2^ k\) from natural order to digit-reversed order. Experiments were carried on a shared- memory, vector-parallel machine Alliant FX/8.
0 references
digit-reversal permutation
0 references
fast Fourier transform
0 references
parallel algorithms
0 references
shared-memory, vector-parallel machine Alliant FX/8
0 references
0.8708659410476685
0 references
0.8502154350280762
0 references
0.8273624777793884
0 references
0.8272905349731445
0 references
