FFTW

The Fastest Fourier Transform in the West (FFTW) is a software library for computing discrete Fourier transforms (DFTs) developed by Matteo Frigo and… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We present a MPI based software library for computing the fast Fourier transforms on massively parallel, distributed memory… (More)
  • figure 1
  • figure 2
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
2013
2013
In this paper we present the work carried out by CINECA in the framework of the PRACE-2IP project which had the aim of improving… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2011
2011
Maestro is a 49-core general-purpose, radiation-hardened processor for space. Fourier Transform is an important computation in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2011
2011
In this paper we describe a new open source software library called PFFT [12], which was developed for calculating parallel… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Fastest Fourier Transform in the West (FFTW) is an adaptive FFT library that generates highly efficient Discrete Fourier… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Fast Fourier Transform in the West(FFTW) is one of the most successful adaptive Discrete Fourier Transform(DFT) libraries. The… (More)
  • figure 1
Is this relevant?
2006
2006
This paper presents a portable short vector extension for the popular FFT library Fftw. Fftw is a freely available portable FFT… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
FFTW is an implementation of the discrete Fourier transform (DFT) that adapts to the hardware in order to maximize performance… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2004
2004
Recent work showed that staging and abstract interpretatio n can be used to derive correct families of combinatorial circuits… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
FFT literature has been mostly concerned with minimizing the number of floating-point operations performed by an algorithm… (More)
  • figure 2
  • figure 4
Is this relevant?