Back to Results
First PageMeta Content
Fourier analysis / Fast Fourier transform / Cooley–Tukey FFT algorithm / FFTW / Discrete Fourier transform / Bit-reversal permutation / Twiddle factor / John Tukey / Parallel computing / Mathematical analysis / Mathematics / Digital signal processing


Fitting FFT onto the G80 Architecture Vasily Volkov Brian Kazian University of California, Berkeley
Add to Reading List

Document Date: 2008-05-20 02:55:52


Open Document

File Size: 1,26 MB

Share Result on Facebook

City

Clovertown / TOLEDO / Clovvertown / Cloverttown / /

Company

CUFFT / SIAM Journal / NVidia / GPU / Intel / /

Currency

BRL / AMD / /

Facility

G80 Architecture Vasily Volkov Brian Kazian University of California / Other Arch / CUDA CUFFT Library / University of California / /

IndustryTerm

memory-intensive applications / signal processing literature / Similar algorithms / particular hardware / pedagogical tool / graphics processors / interaction algorithm / scientific algorithms / hardware processors / computing / radix-n algorithm / similar algorithm / transfform algorithm / /

MusicGroup

Complex / Mathematics / /

NaturalFeature

Niagara / /

Organization

Royal Statistical Society / University of California / Berkeley / EECS Department / /

Position

General / memory model for scientific algorithms / /

Product

N2 / /

ProgrammingLanguage

C / /

ProvinceOrState

California / /

PublishedMedium

Journal of the Royal Statistical Society / /

RadioStation

Core / /

Technology

prime N. All DFT algorithms / Virtual Machine / radix-8 algorithm / Broadband / UltraSPARC processors / 2 Stockham algorithm / Fourier transfform algorithm / FFT Algorithm / graphics processors / radix-n algorithm / 4 Processor / API / similar algorithm / highperformance FFT algorithms / interaction algorithm / FFT algorithms / shared memory / hardware processors / Cell processor / Woodcrest chips / /

SocialTag