Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · Discrete Mathematics Algorithms and Applications · 2018

Deterministic construction of compressed sensing matrices with characters over finite fields

Gang Wang, Min-Yao Niu, Fang‐Wei Fu

Cited by 0Abstract and details only

Abstract

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.

Cite this paper

APA 7

Wang, G., Niu, M.-Y., & Fu, F. (2018). Deterministic construction of compressed sensing matrices with characters over finite fields. Discrete Mathematics Algorithms and Applications, 10(05), 1850061. https://doi.org/10.1142/s1793830918500611

MLA 9

Wang, Gang, et al. “Deterministic construction of compressed sensing matrices with characters over finite fields.” Discrete Mathematics Algorithms and Applications, vol. 10, no. 05, 2018, p. 1850061, https://doi.org/10.1142/s1793830918500611.

Chicago

Wang, Gang, Min-Yao Niu, and Fang‐Wei Fu. 2018. “Deterministic construction of compressed sensing matrices with characters over finite fields.” Discrete Mathematics Algorithms and Applications 10 (05): 1850061. https://doi.org/10.1142/s1793830918500611.

Harvard

Wang, G., Niu, M.-Y. and Fu, F. (2018) ‘Deterministic construction of compressed sensing matrices with characters over finite fields’, Discrete Mathematics Algorithms and Applications, 10(05), p. 1850061. Available at: https://doi.org/10.1142/s1793830918500611.

BibTeX
@article{wang2018deterministic,
  title = {{Deterministic construction of compressed sensing matrices with characters over finite fields}},
  author = {Wang, Gang and Niu, Min-Yao and Fu, Fang‐Wei},
  journal = {Discrete Mathematics Algorithms and Applications},
  volume = {10},
  number = {05},
  pages = {1850061},
  year = {2018},
  doi = {10.1142/s1793830918500611}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers