We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
A new construction of compressed sensing matrices for signal processing via vector spaces over finite fields.
- Authors
Jie, Yingmo; Li, Mingchu; Guo, Cheng; Feng, Bin; Tang, Tingting
- Abstract
As an emerging sampling technique, Compressed Sensing provides a quite masterly approach to data acquisition. Compared with the traditional method, how to conquer the Shannon/Nyquist sampling theorem has been fundamentally resolved. In this paper, first, we provide deterministic constructions of sensing matrices based on vector spaces over finite fields. Second, we analyze two kinds of attributes of sensing matrices. One is the recovery performance with respect to compressing and recovering signals in terms of restricted isometry property. In particular, we obtain a series of binary sensing matrices with sparsity level that are quite better than some existing ones. In order to save the storage space and accelerate the recovery process of signals, another character sparsity of matrices has been taken into account. Third, we merge our binary matrices with some matrices owning low coherence in terms of an embedding manipulation to obtain the improved matrices still having low coherence. Finally, compared with the quintessential binary matrices, the improved matrices possess better character of compressing and recovering signals. The favorable performance of our binary and improved matrices have been demonstrated by numerical simulations.
- Subjects
VECTOR spaces; FINITE fields; COMPRESSED sensing; RESTRICTED isometry property; SAMPLING theorem; SIGNAL processing
- Publication
Multimedia Tools & Applications, 2019, Vol 78, Issue 22, p31137
- ISSN
1380-7501
- Publication type
Article
- DOI
10.1007/s11042-019-07947-w