Sciweavers

481 search results - page 28 / 97
» A Fast Program Generator of Fast Fourier Transforms
Sort
View
ICASSP
2008
IEEE
15 years 4 months ago
Systematic generation of FPGA-based FFT implementations
In this paper, we propose a systemic approach for synthesizing field-programmable gate array (FPGA) implementations of fast Fourier transform (FFT) computations. Our approach cons...
Hojin Kee, Newton Petersen, Jacob Kornerup, Shuvra...
85
Voted
ICPP
2008
IEEE
15 years 4 months ago
On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
David A. Bader, Aparna Chandramowlishwaran, Virat ...
CC
2004
Springer
160views System Software» more  CC 2004»
15 years 3 months ago
Elkhound: A Fast, Practical GLR Parser Generator
The Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because it is asymptotically efficient for typical grammars, and can parse with an...
Scott McPeak, George C. Necula
HVEI
2009
14 years 7 months ago
Harmonic analysis for cognitive vision: perisaccadic perception
The data model for image representation in terms of projective Fourier transform (PFT) is well adapted to both image perspective transformations and the retinotopic mappings of th...
Jacek Turski
59
Voted
CEC
2008
IEEE
15 years 4 months ago
A fast high quality pseudo random number generator for graphics processing units
—Limited numerical precision of nVidia GeForce 8800 GTX and other GPUs requires careful implementation of PRNGs. The Park-Miller PRNG is programmed using G80’s native Value4f ...
William B. Langdon