Bit Reversal on Uniprocessors

DOI10.1137/1038001MaRDI QIDQ4877530zbMATH OpenOpenAlexWikidataFDO

Authors Alan H. Karp

Publication date 26 November 1996

Published in SIAM Review (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c29f4ea23c7af4a2d6628761a9fd2444b339681d

zbMATH Keywords

bit reversalfast Fourier transformhierarchical memoryinterleaved memoryperformancesurvey paper

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10) Complexity and performance of numerical algorithms (65Y20)

Recommendations

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

Cited in

(9)

• FFT algorithms and their adaptation to parallel processing
• On the diameter of tree associahedra
• Diameter estimates for graph associahedra
• No time to hash: on super-efficient entropy accumulation
• Fast bit-reversals on uniprocessors and shared-memory multiprocessors
• A new bit reversal algorithm
• Magnetic vortex filament flows
• A new superfast bit reversal algorithm
• scientific article; zbMATH DE number 975424 (Why is no real title available?)

This page was built for publication: Bit Reversal on Uniprocessors

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