Hits:

Indexed by:Journal Papers

Date of Publication:2019-11-01

Journal:MULTIMEDIA TOOLS AND APPLICATIONS

Included Journals:EI、SCIE

Volume:78

Issue:22

Page Number:31137-31161

ISSN No.:1380-7501

Key Words:Compressed sensing matrices; Vector spaces; Coherence; Restricted isometry property; Signal processing

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.