Deterministic Construction of Sparse Sensing Matrices via Finite Geometry

DOI10.1109/TSP.2014.2318139zbMath1394.94315MaRDI QIDQ4579228

Gennian Ge, Shuxing Li

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (10)

Deterministic convolutional compressed sensing matrices ⋮ Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields ⋮ Non-Cartesian spiral binary sensing matrices ⋮ Deterministic construction of compressed sensing matrices based on semilattices ⋮ Three deterministic constructions of compressed sensing matrices with low coherence ⋮ Cayley sum graphs and their applications to codebooks ⋮ Bipolar measurement matrix using chaotic sequence ⋮ An effective algorithm for the spark of sparse binary measurement matrices ⋮ Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs ⋮ On atomic density of numerical semigroup algebras

This page was built for publication: Deterministic Construction of Sparse Sensing Matrices via Finite Geometry