Compressed Sensing With Combinatorial Designs: Theory and Simulations

DOI10.1109/TIT.2017.2717584MaRDI QIDQ5369841zbMATH OpenOpenAlexFDO

Authors Darryn Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin

Publication date 19 October 2017

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

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

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: In 'An asymptotic result on compressed sensing matrices', a new construction for compressed sensing matrices using combinatorial design theory was introduced. In this paper, we use deterministic and probabilistic methods to analyse the performance of matrices obtained from this construction. We provide new theoretical results and detailed simulations. These simulations indicate that the construction is competitive with Gaussian random matrices, and that recovery is tolerant to noise. A new recovery algorithm tailored to the construction is also given.

Cited in

(5)

• Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
• New Complementary Sets With Low PAPR Property Under Spectral Null Constraints
• Non-Cartesian spiral binary sensing matrices
• Maximal determinants of matrices over the roots of unity
• A universal theory of switching for combinatorial objects, and applications to complex Hadamard matrices

This page was built for publication: Compressed Sensing With Combinatorial Designs: Theory and Simulations

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