By Topic

Deterministic Sensing Matrices Arising From Near Orthogonal Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shuxing Li ; Dept. of Math., Zhejiang Univ., Hangzhou, China ; Gennian Ge

Compressed sensing is a novel sampling theory, which provides a fundamentally new approach to data acquisition. It asserts that a sparse or compressible signal can be reconstructed from much fewer measurements than traditional methods. A central problem in compressed sensing is the construction of the sensing matrix. While random sensing matrices have been studied intensively, only a few deterministic constructions are known. Among them, most constructions are based on coherence, which essentially generates matrices with low coherence. In this paper, we introduce the concept of near orthogonal systems to characterize the matrices with low coherence, which lie in the heart of many different applications. The constructions of these near orthogonal systems lead to deterministic constructions of sensing matrices. We obtain a series of m×n binary sensing matrices with sparsity level k=Θ(m(1/2)) or k=O((m/logm)(1/2)). In particular, some of our constructions are the best possible deterministic ones based on coherence. We conduct a lot of numerical experiments to show that our matrices arising from near orthogonal systems outperform several typical known sensing matrices.

Published in:

IEEE Transactions on Information Theory  (Volume:60 ,  Issue: 4 )