Artigo Acesso aberto Revisado por pares

Deterministic Compressed Sensing Matrices From Sequences With Optimal Correlation

2019; Institute of Electrical and Electronics Engineers; Volume: 7; Linguagem: Inglês

10.1109/access.2019.2896006

ISSN

2169-3536

Autores

Zhi Gu, Zhengchun Zhou, Yang Yang, Avik Ranjan Adhikary, Xiaolun Cai,

Tópico(s)

Blind Source Separation Techniques

Resumo

Compressed sensing (CS) is a new method of data acquisition which aims at recovering higher dimensional sparse vectors from considerably smaller linear measurements. One of the key problems in CS is the construction of sensing matrices. In this paper, we construct deterministic sensing matrices, using Zhou-Helleseth-Udaya sequences and Udaya-Siddiqi sequences. We also construct deterministic sensing matrices using quaternary sequence families A and D. With the orthogonal matching pursuit, numerical simulations show that some of our proposed sensing matrices outperform several typical known sensing matrices in terms of the rate of exact reconstruction.

Referência(s)