在C++11中基于x86-64结构实现位反转置换的有效方法
Practically efficient methods for performing bit-reversed permutation in C++11 on the x86-64 architecture
摘要:
位反转置换是信号处理中的一个著名任务,是高效实现快速傅立叶变换的关键。本文介绍了五种计算位反转置换的方法的优化C++11实现:Stockham自动排序,朴素位交换,通过反转字节表交换,位的局部成对交换,以及通过缓存本地化矩阵缓冲区交换。提出了三种在C++11语言中实现位反转置换的新策略:使用逐位XOR运算的归纳方法、模板递归闭合形式和缓存无关模板递归方法,该方法将位反转置换简化为更小的位反转置换和方阵转置。这些新的方法相比,现有的方法在理论运行时,经验编译时间,经验运行时。模板递归缓存无关方法被证明是最快的已知方法的竞争力,但是,我们证明了缓存无关方法可以更容易地受益于多个核心和GPU上的并行化。
英文摘要:
The bit-reversed permutation is a famous task in signal processing and is key to efficient implementation of the fast Fourier transform. This paper presents optimized C++11 implementations of five extant methods for computing the bit-reversed permutation: Stockham auto-sort, naive bitwise swapping, swapping via a table of reversed bytes, local pairwise swapping of bits, and swapping via a cache-localized matrix buffer. Three new strategies for performing the bit-reversed permutation in C++11 are proposed: an inductive method using the bitwise XOR operation, a template-recursive closed form, and a cache-oblivious template-recursive approach, which reduces the bit-reversed permutation to smaller bit-reversed permutations and a square matrix transposition. These new methods are compared to the extant approaches in terms of theoretical runtime, empirical compile time, and empirical runtime. The template-recursive cache-oblivious method is shown to be competitive with the fastest known method; however, we demonstrate that the cache-oblivious method can more readily benefit from parallelization on multiple cores and on the GPU.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。