FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\log k)$ Time (Q4566644)
From MaRDI portal
scientific article; zbMATH DE number 6895611
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\log k)$ Time |
scientific article; zbMATH DE number 6895611 |
Statements
FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\log k)$ Time (English)
0 references
27 June 2018
0 references
