Composition of Binary Compressed Sensing Matrices

Sasmal, Pradip and Naidu, R. Ramu and Challa, Subrahmanya Sastry and Jampana, Phanindra Varma (2016) Composition of Binary Compressed Sensing Matrices. IEEE Signal Processing Letters, 23 (8). pp. 1096-1100. ISSN 1070-9908

Preview

Text (Author version) spl16.pdf - Accepted Version Download (305kB) | Preview

Abstract

In the recent past, various methods have been proposed to construct deterministic compressed sensing (CS) matrices. Of interest has been the construction of binary sensing matrices as they are useful for multiplierless and faster dimensionality reduction. In most of these binary constructions, the matrix size depends on primes or their powers. In this study, we propose a composition rule which exploits sparsity and block structure of existing binary CS matrices to construct matrices of general size. We also show that these matrices satisfy optimal theoretical guarantees and have similar density compared to matrices obtained using Kronecker product. Simulation work shows that the synthesized matrices provide comparable results against Gaussian random matrices.

[error in script]

IITH Creators:	IITH Creators ORCiD Challa, Subrahmanya Sastry UNSPECIFIED Jampana, Phanindra Varma http://orcid.org/0000-0002-9678-5249
Item Type:	Article
Uncontrolled Keywords:	Coherence, Compressed sensing, Electronic mail, Indexes, Matching pursuit algorithms, Sensors, Sparse matrices
Subjects:	Chemical Engineering
Divisions:	Department of Chemical Engineering Department of Mathematics
Depositing User:	Team Library
Date Deposited:	17 Aug 2016 05:36
Last Modified:	01 Sep 2017 09:45
URI:	http://raiithold.iith.ac.in/id/eprint/2639
Publisher URL:	https://doi.org/10.1109/LSP.2016.2585181
Related URLs:	Google Scholar

Actions (login required)

View Item

Statistics for this ePrint Item