Where is randomness needed to break the square-root bottleneck?

Authors

Patrick Kuppinger, Giuseppe Durisi, and Helmut Bölcskei

Reference

Proc. of IEEE International Symposium on Information Theory (ISIT), Austin, TX, pp. 1578-1582, June 2010

DOI: 10.1109/ISIT.2010.5513456

[BibTeX, LaTeX, and HTML Reference]

Abstract

As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all the positions of the nonzero entries of the sparse coefficient vector. Rather the positions corresponding to one of the two ONBs can be chosen arbitrarily. The two-ONB structure is, however, restrictive and does not reveal the property that is responsible for allowing to break the bottleneck with reduced randomness. For general dictionaries we show that if a sub-dictionary with small enough coherence and large enough cardinality can be isolated, the bottleneck can be broken under the same probabilistic model on the sparse coefficient vector as in the two-ONB case.

Keywords

Compressed sensing, square-root bottleneck, probabilistic sampling


Download this document:

 

Copyright Notice: © 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.