Sparsity in time-frequency representations

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.

Keywords

Classical Analysis and ODEs, Information Theory, 42C40; 15A52; 90C25

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/142224

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0711.2503
 http://arxiv.org/abs/0711.2503

Collections

arXiv