On linear block codes and deterministic compressive sampling

Nicholas Tsagkarakis; Dimitris A. Pados

doi:10.1117/12.920180

8 June 2012 On linear block codes and deterministic compressive sampling

Nicholas Tsagkarakis, Dimitris A. Pados

Proceedings Volume 8365, Compressive Sensing; 836506 (2012) https://doi.org/10.1117/12.920180
Event: SPIE Defense, Security, and Sensing, 2012, Baltimore, Maryland, United States

Abstract

We suggest and explore a parallelism between linear block code parity check matrices and binary zero/one measurement matrices for compressed sensing. The resulting family of deterministic compressive samplers renders itself to the development of eective and ecient recovery algorithms for sparse signals that are not ℓ₁-based. Experimental results that we include herein demonstrate the utility of the presented developments.

Citation Download Citation

Nicholas Tsagkarakis and Dimitris A. Pados "On linear block codes and deterministic compressive sampling", Proc. SPIE 8365, Compressive Sensing, 836506 (8 June 2012); https://doi.org/10.1117/12.920180

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available