Fast digit-reversal algorithms on a shared-memory machine
From MaRDI portal
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.
Recommendations
Cited in
(9)- Fast bit-reversals on uniprocessors and shared-memory multiprocessors
- A second improved digit-reversal permutation algorithm for fast transforms
- scientific article; zbMATH DE number 436084 (Why is no real title available?)
- Fast Cell-Structured Algorithm for Digit Reversal of Arbitrary Length
- scientific article; zbMATH DE number 1151845 (Why is no real title available?)
- scientific article; zbMATH DE number 3999246 (Why is no real title available?)
- Bit Reversal on Uniprocessors
- scientific article; zbMATH DE number 975424 (Why is no real title available?)
- An improved digit-reversal permutation algorithm
This page was built for publication: Fast digit-reversal algorithms on a shared-memory machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315919)