A new bit reversal algorithm

DOI10.1109/29.57586zbMATH Open0715.65115OpenAlexW2117583920MaRDI QIDQ3201726FDOQ3201726

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

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

zbMATH Keywords

fast Hartley transformpost processingbit reversal permutation algorithmEvans algorithmradix 2 fast Fourier transform

Mathematics Subject Classification ID

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

Cited In (7)

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