Back to Results
First PageMeta Content
Unitary operators / Integral transforms / Joseph Fourier / Discrete Fourier transform / Fast Fourier transform / Fourier transform / FFTW / DFT matrix / Discrete cosine transform / Mathematical analysis / Fourier analysis / Digital signal processing


EMPIRICAL EVALUATION OF A SUB-LINEAR TIME SPARSE DFT ALGORITHM ∗ M. A. IWEN †,
Add to Reading List

Document Date: 2013-08-12 19:10:00

Open Document

File Size: 588,66 KB

Share Result on Facebook

City

Ann Arbor / /

Company

Dell / /

/

Facility

East Hall / University of Michigan Department / Standard Template Library / /

IndustryTerm

myriad applications / model divideand-conquer algorithm / faster algorithm / randomized greedy pursuit algorithm / large signal/solution / signal processing applications / numerical analysis applications / nonzero coefficient search time / computing / imaging / energy / /

MarketIndex

AAFFT / /

Organization

SFA / National Science Foundation / N A / University of Michigan Department of Mathematics / AAFFT FFT / /

/

Position

Prime Minister / /

ProgrammingLanguage

C++ / /

ProvinceOrState

Michigan / /

Technology

FADFT-2 Algorithm The FADFT-2 algorithm / FADFT-2 algorithm / faster algorithm / artificial intelligence / AAFFT Algorithm / model divideand-conquer algorithm / kGk2 Both FADFT algorithms / dual 3.6 GHz processor / FADFT-1 algorithm / FFT algorithms / 5 Algorithm / 3G / SPARSE DFT ALGORITHM / randomized greedy pursuit algorithm / one dimensional FADFT-1 algorithm / pdf / MRI / FADFT algorithms / 1 FADFT-1/2 Algorithm / /

URL

http /

SocialTag