Fast Cell-Structured Algorithm for Digit Reversal of Arbitrary Length

DOI10.1137/0912017zbMATH Open0714.68058OpenAlexW2113815237MaRDI QIDQ3200546FDOQ3200546

Authors: Vítězslav Veselý 

Publication date: 1991

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0912017

Recommendations

• scientific article; zbMATH DE number 1151845
• Fast digit-reversal algorithms on a shared-memory machine
• A second improved digit-reversal permutation algorithm for fast transforms
• An improved digit-reversal permutation algorithm
• Efficient Bit and Digital Reversal Algorithm Using Vector Calculation
• An improved FFT digit-reversal algorithm
• scientific article; zbMATH DE number 975424
• A recursive algorithm for quick and efficient bit reversing
• A new superfast bit reversal algorithm
• A new efficient computational algorithm for bit reversal mapping

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Cited In (4)

• Fast bit-reversals on uniprocessors and shared-memory multiprocessors
• A new superfast bit reversal algorithm
• Fast digit-reversal algorithms on a shared-memory machine
• A recursive algorithm for quick and efficient bit reversing

This page was built for publication: Fast Cell-Structured Algorithm for Digit Reversal of Arbitrary Length

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