Bit Reversal on Uniprocessors

DOI10.1137/1038001zbMath0851.65101OpenAlexW2050879237WikidataQ56235037 ScholiaQ56235037MaRDI QIDQ4877530

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

performancefast Fourier transformsurvey paperhierarchical memoryinterleaved memorybit reversal

Mathematics Subject Classification ID

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

Related Items (6)

A new superfast bit reversal algorithm ⋮ No time to hash: on super-efficient entropy accumulation ⋮ FFT algorithms and their adaptation to parallel processing ⋮ Magnetic vortex filament flows ⋮ On the diameter of tree associahedra ⋮ Diameter estimates for graph associahedra

This page was built for publication: Bit Reversal on Uniprocessors