Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices

DOI10.1109/TIT.2011.2111670zbMATH Open1366.94078arXiv0908.2676OpenAlexW2119275775MaRDI QIDQ5280997FDOQ5280997

Arash A. Amini, Farokh Marvasti

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: In this paper we establish the connection between the Orthogonal Optical Codes (OOC) and binary compressed sensing matrices. We also introduce deterministic bipolar $mimesn$ RIP fulfilling $pm1$ matrices of order $k$ such that $$. The columns of these matrices are binary BCH code vectors where the zeros are replaced by -1. Since the RIP is established by means of coherence, the simple greedy algorithms such as Matching Pursuit are able to recover the sparse solution from the noiseless samples. Due to the cyclic property of the BCH codes, we show that the FFT algorithm can be employed in the reconstruction methods to considerably reduce the computational complexity. In addition, we combine the binary and bipolar matrices to form ternary sensing matrices ($0,1,-1$ elements) that satisfy the RIP condition.

Full work available at URL: https://arxiv.org/abs/0908.2676

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited In (16)

• Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
• Deterministic construction of compressed sensing matrices from constant dimension codes
• Binary Matrices for Compressed Sensing
• Deterministic Construction of Compressed Sensing Matrices from Codes
• Construction of Sparse Binary Sensing Matrices Using Set Systems
• Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
• Rapid compressed sensing reconstruction: a semi-tensor product approach
• Deterministic construction of sparse binary matrices via incremental integer optimization
• Deterministic construction of compressed sensing matrices with characters over finite fields
• A survey on compressive sensing: classical results and recent advancements
• Chaotic Binary Sensing Matrices
• Three deterministic constructions of compressed sensing matrices with low coherence
• Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
• Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
• An effective algorithm for the spark of sparse binary measurement matrices
• Deterministic constructions of compressed sensing matrices based on codes

This page was built for publication: Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280997)