Sciweavers

242 search results - page 7 / 49
» Optimized Fast Algorithms for the Quaternionic Fourier Trans...
Sort
View
ICML
2009
IEEE
14 years 9 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
FPGA
2006
ACM
139views FPGA» more  FPGA 2006»
14 years 11 days ago
Fast and accurate resource estimation of automatically generated custom DFT IP cores
This paper presents an equation-based resource utilization model for automatically generated discrete Fourier transform (DFT) soft core IPs. The parameterized DFT IP generator all...
Peter A. Milder, Mohammad Ahmad, James C. Hoe, Mar...
ERSHOV
2003
Springer
14 years 1 months ago
A Polymorphic Radix- n Framework for Fast Fourier Transforms
We provide a polymorphic framework for radix-n Fast Fourier Transforms (FFTs) where all known kinds of monomoporhic radix-n algorithms can be obtained by specialization. The framew...
Marcin Zalewski, Sibylle Schupp
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
14 years 2 months ago
The truncated fourier transform and applications
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
Joris van der Hoeven
ICIP
2002
IEEE
14 years 10 months ago
Full search content independent block matching based on the fast Fourier transform
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
Mark S. Drew, Steven L. Kilthau, Torsten Möll...