Deterministic construction of compressed sensing matrices with characters over finite fields
Compressed sensing theory provides a new approach to acquire data as a sampling technique and makes sure that an original sparse signal can be reconstructed from few measurements. The construction of compressed sensing matrices is a central problem in compressed sensing theory. In this paper, the deterministic compressed sensing matrices with characters of finite fields are constructed and the coherence of the matrices are computed. Furthermore, the maximum sparsity of recovering the original sparse signals by using our compressed sensing matrices is obtained. Meanwhile, a comparison is made with the compressed sensing matrices constructed by DeVore based on polynomials over finite fields. In the numerical simulations, our compressed sensing matrix outperforms DeVore’s matrix in the process of recovering original sparse signals.