A recursive algorithm for quick and efficient bit reversing

DOI10.1016/0167-8655(84)90034-5MaRDI QIDQ3219129zbMATH OpenOpenAlexFDO

Authors Sergio Antoy

Publication date 1984

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(84)90034-5

zbMATH Keywords

fast Fourier transformpermutation by bit reversal

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 975424
• A new bit reversal algorithm
• A second improved digit-reversal permutation algorithm for fast transforms
• Fast Cell-Structured Algorithm for Digit Reversal of Arbitrary Length
• Bit Reversal through direct Fourier permutation method and Vectorial Digit Reversal generalization

Cited in

(6)

• Novel algorithm for complex bit reversal: Employing vector permutation and branch reduction methods
• Bit Reversal through direct Fourier permutation method and Vectorial Digit Reversal generalization
• Fast Cell-Structured Algorithm for Digit Reversal of Arbitrary Length
• A new bit reversal algorithm
• scientific article; zbMATH DE number 4209550 (Why is no real title available?)
• scientific article; zbMATH DE number 975424 (Why is no real title available?)

This page was built for publication: A recursive algorithm for quick and efficient bit reversing

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