Compressive sensing with chaotic sequence

IEEE Signal Processing Letters

Volumn 17, Issue 8, 2010, Pages 731-734

  Yu, Lei ^a,b   Barbot, Jean Pierre ^b   Zheng, Gang ^b   Sun, Hong ^a  

^a WUHAN UNIVERSITY   (China)

^b INRIA   (France)

Author keywords

Chaos; compressive sensing; logistic map

Indexed keywords

BERNOULLI; CHAOTIC SEQUENCE; EXPERIMENTAL COMPARISON; GAUSSIAN RANDOM MATRICES; LOGISTIC MAPS; MATRIX; NYQUIST RATE; RANDOM MATRIX; SPARSE MATRICES;

MATRIX ALGEBRA; SIGNAL RECONSTRUCTION;

CHAOTIC SYSTEMS;

EID: 77954017475     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/LSP.2010.2052243     Document Type: Article

References (19)

1. D. Achlioptas, "Database-friendly random projections," in Proc. 20th ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS), New York, 2001, pp. 274-281.
2. L. Applebaum, S. Howard, S. Searle, and R. Calderbank, "Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery," Appl. Comput. Harmon. Anal., vol.26, no.2, Mar. 2009.
3. R. Baraniuk, M. Davenport, R. DeVore, and M.Wakin, "A simple proof of the restricted isometry property for random matrices," Construct. Approx., vol.28, no.3, pp. 253-263, Dec. 2008.
4. D. Baron, S. Sarvotham, and R. G. Baraniuk, "Bayesian compressive sensing via belief propagation," IEEE Trans. Signal Process., vol.58, no.1, pp. 269-280, Jan. 2010.
5. R. Berinde, A. C. Gilbert, P. Indyk, H. Karloff, and M. J. Strauss, "Combining geometry and combinatorics: A unified approach to sparse signal recovery," in 46th Annu. Allerton Conf. Communication, Control, and Computing, Sep. 2008, pp. 798-805.
6. R. Berinde and P. Indyk, Sparse Recovery Using Sparse Random Matrices. Tech. Rep. MIT, 2008.
7. R. Calderbank, S. Howard, and S. Jafarpour, "Construction of a large class of deterministic sensing matrices that satisfy a statistical isometry property," IEEE J. Sel. Topics Signal Process., vol.4, no.2, pp. 358-374, Apr. 2010.
8. E. J. Candès, "The restricted isometry property and its implications for compressed sensing," Comp. Rendus Acad. des Sci.I, vol.346, no.9-10, May 2008.
9. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inform. Theory, vol.51, no.12, pp. 4203-4215, Dec. 2005.
10. E. J. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inform. Theory, vol.52, no.12, pp. 5406-5425, Dec. 2006.
11. E. J. Candès and M. B. Wakin, "An introduction to compressive sampling," IEEE Signal Process. Mag., vol.25, no.2, pp. 21-30, Mar. 2008.
12. R. A. DeVore, "Deterministic constructions of compressed sensing matrices," J. Complexity, vol.23, no.4-6, Aug. 2007.
13. D. Donoho, I. Drori, V. Stodden, Y. Tsaig, and M. Shahram, Sparselab [Online]. Available: http://sparselab.stanford.edu/
14. S. Howard, R. Calderbank, and S. Searle, "A fast reconstruction algorithm for deterministic compressive sensing using second order reedmuller codes," in Conf. Information Sciences and Systems (CISS),Mar. 2008.
15. W. Johnson and J. Lindenstrauss, "Extensions of Lipschitz maps into a Hilbert space," Contemporary Math., vol.26, pp. 189-206, 1984.
16. S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, "Uniform uncertainty principle for bernoulli and subgaussian ensembles," Construct. Approx., vol.28, no.3, pp. 277-289, Dec. 2008.
17. Logistic MapWolfram Research [Online].Available: http://documents. wolfram.com/
18. A. Vlad, A. Luca, and M. Frunzete, "Computational measurements of the transient time and of the sampling distance that enables statistical independence in the logistic map," in Proc. Int. Conf. Computational Science and Its Applications (ICCSA), Berlin, Germany, 2009, pp. 703-718.
19. K.Wang, W. Pei, H. Xia, M. G. Nustes, and J. A. Gonzalez, "Statistical independence in nonlinear maps coupled to non-invertible transformations," Phys. Lett. A, vol.372, no.44, pp. 6593-6601, 2008.