Sparsity in time-frequency representations
| dc.creator | Pfander, Goetz E. | |
| dc.creator | Rauhut, Holger | |
| dc.date | 2007-11-15 | |
| dc.date.accessioned | 2026-07-07T08:43:10Z | |
| dc.date.available | 2026-07-07T08:43:10Z | |
| dc.description | We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an $S$-sparse Gabor representation in $\mathbb{C}^n$ with respect to a random unimodular window can be recovered by Basis Pursuit with high probability provided that $S\leq Cn/\log(n)$. Our results are applicable to the channel estimation problem in wireless communications and they establish the usefulness of a class of measurement matrices for compressive sensing. | |
| dc.identifier | https://arxiv.org/abs/0711.2503 | |
| dc.identifier | http://arxiv.org/abs/0711.2503 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/142224 | |
| dc.subject | Classical Analysis and ODEs | |
| dc.subject | Information Theory | |
| dc.subject | 42C40; 15A52; 90C25 | |
| dc.title | Sparsity in time-frequency representations | |
| dc.type | text |