The design and implementation of FFTW3
The design and implementation of FFTW3
复制标题
DOI：
10.1109/jproc.2004.840301
复制
发表时间：
2005-02-01
影响因子：
20.6
通讯作者：
Johnson, SG
中科院分区：
文献类型：
--
作者：
Frigo, M;Johnson, SG
FFTW是适应硬件以最大化性能的离散傅立叶变换（左）的实现。本文表明，这种方法可以产生与手工优化库具有竞争力的实现，并描述了使我们当前的FFTW3版本灵活且适应性的软件结构。我们进一步讨论了针对质量大小的真实数据DFT的新算法，这是一种通过机器特定的单一指导，多DATA（SIMD）指令实现DFT的新方法，以及特殊用途的编译器如何得出优化的实现离散的余弦和正弦会自动从DFT算法转换。
FFTW is an implementation of the discrete Fourier transform (LEFT) that adapts to the hardware in order to maximize performance. This paper shows that such an approach can yield an implementation that is competitive with hand-optimized libraries, and describes the software structure that makes our current FFTW3 version flexible and adaptive. We further discuss a new algorithm for real-data DFTs of prime size, a new way of implementing DFTs by means of machine-specific single-instruction, multiple-data (SIMD) instructions, and how a special-purpose compiler can derive optimized implementations of the discrete cosine and sine transforms automatically from a DFT algorithm.