Toeplitz Block Matrices in Compressed Sensing

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Recent work in compressed sensing theory shows that $n\times N$ independent and identically distributed (IID) sensing matrices whose entries are drawn independently from certain probability distributions guarantee exact recovery of a sparse signal with high probability even if $n\ll N$. Motivated by signal processing applications, random filtering with Toeplitz sensing matrices whose elements are drawn from the same distributions were considered and shown to also be sufficient to recover a sparse signal from reduced samples exactly with high probability. This paper considers Toeplitz block matrices as sensing matrices. They naturally arise in multichannel and multidimensional filtering applications and include Toeplitz matrices as special cases. It is shown that the probability of exact reconstruction is also high. Their performance is validated using simulations.
Preprint 16 pages, 1 figure

Keywords

Information Theory, Probability, 94A20; 94A08

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv