Sciweavers

245 search results - page 21 / 49
» A Fast Fourier Transform Compiler
Sort
View
IAJIT
2010
147views more  IAJIT 2010»
13 years 8 months ago
A novel radon-wavelet based OFDM system design and performance under different channel conditions
: Finite Radon Transform mapper has the ability to increase orthogonality of sub-carriers, it is non sensitive to channel parameters variations, and has a small constellation energ...
Abbas Hasan Kattoush
ICAD
2004
14 years 7 days ago
Designing Sound: Towards a System for Designing Audio Interfaces using Timbre Spaces
The creation of audio interfaces is currently hampered by the difficulty of designing sounds for them. This paper presents a novel system for generating and manipulating non-speec...
Craig Nicol, Stephen A. Brewster, Philip D. Gray
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 4 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
ICS
2007
Tsinghua U.
14 years 5 months ago
Scheduling FFT computation on SMP and multicore systems
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...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
ICML
2009
IEEE
14 years 11 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...