Toeplitz Block Matrices in Compressed Sensing

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Preprint 16 pages, 1 figure

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Toeplitz Block Matrices in Compressed Sensing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Toeplitz Block Matrices in Compressed Sensing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Toeplitz Block Matrices in Compressed Sensing will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-13254

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.