The design and implementation of FFTW3

The design and implementation of FFTW3 (2005)

by Matteo Frigo , Steven , G. Johnson

Venue:	Proceedings of the IEEE
Citations:	255 - 4 self

Datum	Value	Source
TITLE	The design and implementation of FFTW3	INFERENCE
AUTHOR NAME	Matteo Frigo	SVM HeaderParse 0.2
AUTHOR AFFIL	Invited Paper	SVM HeaderParse 0.2
AUTHOR NAME	Steven	SVM HeaderParse 0.2
AUTHOR AFFIL	Invited Paper	SVM HeaderParse 0.2
AUTHOR NAME	G. Johnson	SVM HeaderParse 0.2
AUTHOR AFFIL	Invited Paper	SVM HeaderParse 0.2
ABSTRACT	FFTW is an implementation of the discrete Fourier transform (DFT) 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. Keywords—Adaptive software, cosine transform, fast Fourier transform (FFT), Fourier transform, Hartley transform, I/O tensor.	SVM HeaderParse 0.2
YEAR	2005	INFERENCE
VENUE	Proceedings of the IEEE	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	216--231	INFERENCE
VOLUME	93	INFERENCE
CITATIONS	60 found	ParsCit 1.0