Empirical evaluation of a sub-linear time sparse DFT algorithm (Q2477145)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5248950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Empirical evaluation of a sub-linear time sparse DFT algorithm |
scientific article; zbMATH DE number 5248950 |
Statements
Empirical evaluation of a sub-linear time sparse DFT algorithm (English)
0 references
13 March 2008
0 references
sub-linear time algorithms
0 references
compressive sensing
0 references
numerical examples
0 references
fast approximate discrete Fourier transform
0 references
algorithm
0 references
frequency-sparse signals
0 references
random sampling
0 references
fast Fourier transform
0 references
0.8135789632797241
0 references
0.8120368719100952
0 references
0.7921842336654663
0 references
0.7863678336143494
0 references
0.7850721478462219
0 references
