21 search results - page 1 / 5 » Generating and Searching Families of FFT Algorithms |
CORR
2011
Springer
13 years 1 days ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
IEEEPACT
2009
IEEE
14 years 6 days ago
2009
IEEE
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
IPPS
2007
IEEE
13 years 12 months ago
2007
IEEE
Automatic library generators, such as ATLAS [11], Spiral [8] and FFTW [2], are promising technologies to generate efficient code for different computer architectures. The library...
ICS
2007
Tsinghua U.
13 years 11 months ago
2007
Tsinghua U.
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
PARA
2004
Springer
13 years 11 months ago
2004
Springer
During the last half-decade, a number of research efforts have centered around developing software for generating automatically tuned matrix multiplication kernels. These include ...