A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
A super-efficient adaptable bit-reversal algorithm for multithreaded architectures
2009
2009 IEEE International Symposium on Parallel & Distributed Processing
Fast bit-reversal algorithms have been of strong interest for many decades, especially after Cooley and Tukey introduced their FFT implementation in 1965. Many recent algorithms, including FFTW try to avoid the bit-reversal all together by doing in-place algorithms within their FFTs. We therefore motivate our work by showing that for FFTs of up to 65.536 points, a minimally tuned Cooley-Tukey FFT in C using our bit-reversal algorithm performs comparable or better than the default FFTW
doi:10.1109/ipdps.2009.5161105
dblp:conf/ipps/ElsterM09
fatcat:c6i5yeoebfe2zp2shgcxbsqx6q