A new bit reversal algorithm

DOI10.1109/29.57586MaRDI QIDQ3201726zbMATH OpenOpenAlexFDO

Authors James S. Walker

Publication date 1990

Published in IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/29.57586

zbMATH Keywords

bit reversal permutation algorithmEvans algorithmfast Hartley transformpost processingradix 2 fast Fourier transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• A new superfast bit reversal algorithm
• Bit Reversal on Uniprocessors
• A second improved digit-reversal permutation algorithm for fast transforms
• A recursive algorithm for quick and efficient bit reversing
• An improved digit-reversal permutation algorithm

Cited in

(10)

• Novel algorithm for complex bit reversal: Employing vector permutation and branch reduction methods
• Fast bit-reversals on uniprocessors and shared-memory multiprocessors
• Bit Reversal through direct Fourier permutation method and Vectorial Digit Reversal generalization
• A second improved digit-reversal permutation algorithm for fast transforms
• A recursive algorithm for quick and efficient bit reversing
• An improved FFT digit-reversal algorithm
• A new superfast bit reversal algorithm
• 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: A new bit reversal algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3201726)