Construction of compressed sensing matrices based on affine symplectic space over finite fields

作     者：Wang Gang Niu Minyao Fu Fangwei 

作者机构：Chern Institute of Mathematics and Lab of Pure Mathematics and CombinatoricsNankai University College of ScienceCivil Aviation University of China 

出 版 物：《The Journal of China Universities of Posts and Telecommunications》 (中国邮电高校学报（英文版）)

年 卷 期：2018年第25卷第6期

页      面：74-80页

核心收录：

学科分类：0810[工学-信息与通信工程] 1205[管理学-图书情报与档案管理] 0809[工学-电子科学与技术（可授工学、理学学位）] 0839[工学-网络空间安全] 08[工学] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the National Basic Research Program of China(2013CB834204) the National Natural Science Foundation of China(61571243) the Fundamental Research Funds for the Central Universities of China the Ph.D.Candidate Research Innovation Fund of Nankai University(91822144) 

主　　题：compressed sensing coherence sparsity affine symplectic space finite fields 

摘      要：The compressed sensing matrices based on affine symplectic space are constructed. Meanwhile, a comparison is made with the compressed sensing matrices constructed by DeVore based on polynomials over finite fields. Moreover, we merge our binary matrices with other low coherence matrices such as Hadamard matrices and discrete fourier transform(DFT) matrices using the embedding operation. In the numerical simulations, our matrices and modified matrices are superior to Gaussian matrices and DeVore’s matrices in the performance of recovering original signals.