The performance guarantees of generalized orthogonal matching pursuit（ gOMP） are considered in the framework of mutual coherence. The gOMP algorithmis an extension of the well-known OMP greed algorithmfor compressed...The performance guarantees of generalized orthogonal matching pursuit（ gOMP） are considered in the framework of mutual coherence. The gOMP algorithmis an extension of the well-known OMP greed algorithmfor compressed sensing. It identifies multiple N indices per iteration to reconstruct sparse signals.The gOMP with N≥2 can perfectly reconstruct any K-sparse signals frommeasurement y = Φx if K 〈1/N（1/μ-1） ＋1,where μ is coherence parameter of measurement matrix Φ. Furthermore,the performance of the gOMP in the case of y = Φx ＋ e with bounded noise ‖e‖2≤ε is analyzed and the sufficient condition ensuring identification of correct indices of sparse signals via the gOMP is derived,i. e.,K 〈1/N（1/μ-1）＋1-（2ε/Nμxmin） ,where x min denotes the minimummagnitude of the nonzero elements of x. Similarly,the sufficient condition in the case of G aussian noise is also given.展开更多
In the uplink grant-free non-orthogonal multiple access(NOMA)scenario,since the active user at the sender has a structured sparsity transmission characteristic,the compressive sensing recovery algorithm is initially a...In the uplink grant-free non-orthogonal multiple access(NOMA)scenario,since the active user at the sender has a structured sparsity transmission characteristic,the compressive sensing recovery algorithm is initially applied to the joint detection of the active user and the transmitted data.However,the existing compressed sensing recovery algorithms with unknown sparsity often require noise power or signal-to-noise ratio(SNR)as the priori conditions,which greatly reduces the algorithm adaptability in multi-user detection.Therefore,an algorithm based on cross validation aided structured sparsity adaptive orthogonal matching pursuit(CVA-SSAOMP)is proposed to realize multi-user detection in dynamic change communication scenario of channel state information(CSI).The proposed algorithm transforms the structured sparsity model into a block sparse model,and without the priori conditions above,the cross validation method in the field of statistics and machine learning is used to adaptively estimate the sparsity of active user through the residual update of cross validation.The simulation results show that,compared with the traditional orthogonal matching pursuit(OMP)algorithm,subspace pursuit(SP)algorithm and cross validation aided block sparsity adaptive subspace pursuit(CVA-BSASP)algorithm,the proposed algorithm can effectively improve the accurate estimation of the sparsity of active user and the performance of system bit error ratio(BER),and has the advantage of low-complexity.展开更多
This paper aims to investigate sufficient conditions for the recovery of sparse signals via the orthogonal matching pursuit （OMP） algorithm. In the noiseless case, we present a novel sufficient condition for the exa...This paper aims to investigate sufficient conditions for the recovery of sparse signals via the orthogonal matching pursuit （OMP） algorithm. In the noiseless case, we present a novel sufficient condition for the exact recovery of all k-sparse signals by the OMP algorithm, and demonstrate that this condition is sharp. In the noisy case, a sufficient condition for recovering the support of k-sparse signal is also presented. Generally, the computation for the restricted isometry constant （RIC） in these sufficient conditions is typically difficult, therefore we provide a new condition which is not only computable but also sufficient for the exact recovery of all k-sparse signals.展开更多
提出一种压缩感知正交匹配追踪（CS-OMP）超谐波测量新算法,即运用压缩感知理论,通过引入插值系数,基于离散傅里叶变换（DFT）系数向量和狄利克雷核矩阵,构建了高频率分辨率的压缩感知模型,并基于正交匹配追踪算法,在不增加被测数据观...提出一种压缩感知正交匹配追踪（CS-OMP）超谐波测量新算法,即运用压缩感知理论,通过引入插值系数,基于离散傅里叶变换（DFT）系数向量和狄利克雷核矩阵,构建了高频率分辨率的压缩感知模型,并基于正交匹配追踪算法,在不增加被测数据观测时间前提下,将超谐波测量的频率分辨率提高了一个数量级。数值仿真分析以及两种非线性负荷的实测数据验证的结果表明,该算法可将测得数据频率分辨率由2 k Hz细化为200 Hz,能实现对被测信号中超谐波频率成分的精确定位,也可准确求解出其幅值信息,从而有效地弥补了DFT算法存在的观测时间与频率分辨率互相限制的固有缺陷,在更准确测量超谐波方面展现出良好前景。展开更多
基金Supported by the National Natural Science Foundation of China(60119944,61331021)the National Key Basic Research Program Founded by MOST(2010C B731902)+1 种基金the Program for Changjiang Scholars and Innovative Research Team in University(IRT1005)Beijing Higher Education Young Elite Teacher Project(YET P1159)
文摘The performance guarantees of generalized orthogonal matching pursuit（ gOMP） are considered in the framework of mutual coherence. The gOMP algorithmis an extension of the well-known OMP greed algorithmfor compressed sensing. It identifies multiple N indices per iteration to reconstruct sparse signals.The gOMP with N≥2 can perfectly reconstruct any K-sparse signals frommeasurement y = Φx if K 〈1/N（1/μ-1） ＋1,where μ is coherence parameter of measurement matrix Φ. Furthermore,the performance of the gOMP in the case of y = Φx ＋ e with bounded noise ‖e‖2≤ε is analyzed and the sufficient condition ensuring identification of correct indices of sparse signals via the gOMP is derived,i. e.,K 〈1/N（1/μ-1）＋1-（2ε/Nμxmin） ,where x min denotes the minimummagnitude of the nonzero elements of x. Similarly,the sufficient condition in the case of G aussian noise is also given.
基金Supported by the National Natural Science Foundation of China(No.62001001)。
文摘In the uplink grant-free non-orthogonal multiple access(NOMA)scenario,since the active user at the sender has a structured sparsity transmission characteristic,the compressive sensing recovery algorithm is initially applied to the joint detection of the active user and the transmitted data.However,the existing compressed sensing recovery algorithms with unknown sparsity often require noise power or signal-to-noise ratio(SNR)as the priori conditions,which greatly reduces the algorithm adaptability in multi-user detection.Therefore,an algorithm based on cross validation aided structured sparsity adaptive orthogonal matching pursuit(CVA-SSAOMP)is proposed to realize multi-user detection in dynamic change communication scenario of channel state information(CSI).The proposed algorithm transforms the structured sparsity model into a block sparse model,and without the priori conditions above,the cross validation method in the field of statistics and machine learning is used to adaptively estimate the sparsity of active user through the residual update of cross validation.The simulation results show that,compared with the traditional orthogonal matching pursuit(OMP)algorithm,subspace pursuit(SP)algorithm and cross validation aided block sparsity adaptive subspace pursuit(CVA-BSASP)algorithm,the proposed algorithm can effectively improve the accurate estimation of the sparsity of active user and the performance of system bit error ratio(BER),and has the advantage of low-complexity.
基金The authors are very grateful to the anonymous referees for their valuable comments and suggestions. We want to thank Mr. Liang Chen at Hunan University for many useful comments. This work was supported by the National Natural Science Foundation of China under Grant 11271117.
文摘This paper aims to investigate sufficient conditions for the recovery of sparse signals via the orthogonal matching pursuit （OMP） algorithm. In the noiseless case, we present a novel sufficient condition for the exact recovery of all k-sparse signals by the OMP algorithm, and demonstrate that this condition is sharp. In the noisy case, a sufficient condition for recovering the support of k-sparse signal is also presented. Generally, the computation for the restricted isometry constant （RIC） in these sufficient conditions is typically difficult, therefore we provide a new condition which is not only computable but also sufficient for the exact recovery of all k-sparse signals.
文摘提出一种压缩感知正交匹配追踪（CS-OMP）超谐波测量新算法,即运用压缩感知理论,通过引入插值系数,基于离散傅里叶变换（DFT）系数向量和狄利克雷核矩阵,构建了高频率分辨率的压缩感知模型,并基于正交匹配追踪算法,在不增加被测数据观测时间前提下,将超谐波测量的频率分辨率提高了一个数量级。数值仿真分析以及两种非线性负荷的实测数据验证的结果表明,该算法可将测得数据频率分辨率由2 k Hz细化为200 Hz,能实现对被测信号中超谐波频率成分的精确定位,也可准确求解出其幅值信息,从而有效地弥补了DFT算法存在的观测时间与频率分辨率互相限制的固有缺陷,在更准确测量超谐波方面展现出良好前景。
