Construction of Sparse Binary Sensing Matrices Using Set Systems

R, Ramu Naidu (2015) Construction of Sparse Binary Sensing Matrices Using Set Systems. In: Mathematical Analysis and its Applications. Springer Proceedings in Mathematics & Statistics, 143 . Springer India, pp. 267-273. ISBN 978-81-322-2484-6

Full text not available from this repository. (Request a copy)

Abstract

Recent developments at the intersection of algebra and optimization theory—by the name of compressed sensing (CS)—aim at providing linear systems with sparse descriptions. The deterministic construction of the sensing matrices is now an active directions in CS. The sparse sensing matrix contributes to fast processing with low computational complexity. The present work attempts to relate the notion of set systems to CS. In particular, we show that the set system theory may be adopted to designing a binary CS matrix of high sparsity from the existing binary CS matrices.

[error in script]

IITH Creators:	IITH Creators ORCiD
Item Type:	Book Section
Uncontrolled Keywords:	Compressed sensing, Restricted isometry property, Deterministic construction, Set systems,
Subjects:	?? sub3.8 ??
Divisions:	Department of Mathematics
Depositing User:	Team Library
Date Deposited:	03 Sep 2015 09:58
Last Modified:	03 Sep 2015 09:58
URI:	http://raiithold.iith.ac.in/id/eprint/1908
Publisher URL:	http://dx.doi.org/10.1007/978-81-322-2485-3_21
Related URLs:	Google Scholar

Actions (login required)

View Item

Statistics for this ePrint Item