Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications
From MaRDI portal
Publication:4622043
DOI10.1109/TSP.2016.2550020zbMath1414.94432arXiv1501.06661OpenAlexW2964091591MaRDI QIDQ4622043
R. Ramu Naidu, C. S. Sastry, Phanindra Jampana
Publication date: 8 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.06661
Related Items (8)
Non-Cartesian spiral binary sensing matrices ⋮ Bipolar measurement matrix using chaotic sequence ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Chaotic Binary Sensing Matrices ⋮ 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 ⋮ Sufficient conditions for the uniqueness of solution of the weighted norm minimization problem ⋮ Local recovery bounds for prior support constrained compressed sensing
This page was built for publication: Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications
