Compressive sensing matrix designed by tent map, for secure data transmission

The approach between compressive sensing and chaotic behaviour is a new technique in order to capture signals at sub-Nyquist rate. For recovering the original signal from the sampled one it is necessary to use the computing power because a specific matrix is needed to implement the sensing procedure. This matrix has to respect the Restricted Isometry Property (RIP). In this paper a way to generate this matrix is presented by using the tent map. The aim is to show that for any initial condition or parameter the performances, in order to generate a sensing matrix, are similar. In a secure data transmission, these two values will be known only by the emitter and receiver. At each new sent signal the initial condition and the parameter will be changed.

[1]  Adriana Vlad,et al.  A study on statistical independence in the tent map , 2009, 2009 International Symposium on Signals, Circuits and Systems.

[2]  Ronald A. DeVore,et al.  Deterministic constructions of compressed sensing matrices , 2007, J. Complex..

[3]  Adriana Vlad,et al.  Computational Measurements of the Transient Time and of the Sampling Distance That Enables Statistical Independence in the Logistic Map , 2009, ICCSA.

[4]  Piotr Indyk,et al.  Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[5]  R. Calderbank,et al.  Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery , 2009 .

[6]  Emmanuel J. Cand The Restricted Isometry Property and Its Implications for Compressed Sensing , 2008 .

[7]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

[8]  A. Robert Calderbank,et al.  A fast reconstruction algorithm for deterministic compressive sensing using second order reed-muller codes , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[9]  A. Robert Calderbank,et al.  Construction of a Large Class of Deterministic Sensing Matrices That Satisfy a Statistical Isometry Property , 2009, IEEE Journal of Selected Topics in Signal Processing.

[10]  Piotr Indyk,et al.  Sparse Recovery Using Sparse Random Matrices , 2010, LATIN.

[11]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[12]  Adriana Vlad,et al.  Revealing Statistical Independence of Two Experimental Data Sets: An Improvement on Spearman's Algorithm , 2006, ICCSA.

[13]  S. Mendelson,et al.  Uniform Uncertainty Principle for Bernoulli and Subgaussian Ensembles , 2006, math/0608665.

[14]  E. Candès The restricted isometry property and its implications for compressed sensing , 2008 .

[15]  Richard G. Baraniuk,et al.  Bayesian Compressive Sensing Via Belief Propagation , 2008, IEEE Transactions on Signal Processing.

[16]  Dimitris Achlioptas,et al.  Database-friendly random projections , 2001, PODS.

[17]  Hong Sun,et al.  Compressive Sensing With Chaotic Sequence , 2010, IEEE Signal Processing Letters.