2012/01/01 by Venceslav Kafedziski, Kafedziski, Venceslav, Toni Stojanovski +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1201.0362
19th Telecommunications Forum TELFOR 2011, November 2011, Belgrade, Serbia
arxiv created 2012/01/01 · arxiv updated 2012/01/04
We investigate the possibility of using different chaotic sequences to construct measurement matrices in compressive sampling. In particular, we consider sequences generated by Chua, Lorenz and Rossler dynamical systems and investigate the accuracy of reconstruction when using each of them to construct measurement matrices. Chua and Lorenz sequences appear to be suitable to construct measurement matrices. We compare the recovery rate of the original sequence with that obtained by using Gaussian, Bernoulli and uniformly distributed random measurement matrices. We also investigate the impact of correlation on the recovery rate. It appears that correlation does not influence the probability of exact reconstruction significantly.