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.展开更多
This paper presents a novel adaptive wide-band compressed spectrum sensing scheme for cognitive radio(CR)networks.Compared to the traditional CSS-based CR scenarios,the proposed approach reconstructs neither the recei...This paper presents a novel adaptive wide-band compressed spectrum sensing scheme for cognitive radio(CR)networks.Compared to the traditional CSS-based CR scenarios,the proposed approach reconstructs neither the received signal nor its spectrum during the compressed sensing procedure.On the contrary,a precise estimation of wide spectrum support is recovered with a fewer number of compressed measurements.Then,the spectrum occupancy is determined directly from the reconstructed support vector.To carry out this process,a data-driven methodology is utilized to obtain the mini-mum number of necessary samples required for support reconstruction,and a closed-form expression is obtained that optimally estimates the number of desired samples as a function of the sparsity level and number of channels.Following this phase,an adjustable sequential framework is developed where the first step predicts the optimal number of compressed measurements and the second step recovers the sparse support and makes sensing decision.Theoretical analysis and numerical simulations demonstrate the improvement achieved with the proposed algorithm to significantly reduce both sampling costs and average sensing time without any deterioration in detection performance.Furthermore,the remainder of the sensing time can be employed by secondary users for data transmission,thus leading to the enhancement of the total throughput of the CR network.展开更多
基金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.
文摘This paper presents a novel adaptive wide-band compressed spectrum sensing scheme for cognitive radio(CR)networks.Compared to the traditional CSS-based CR scenarios,the proposed approach reconstructs neither the received signal nor its spectrum during the compressed sensing procedure.On the contrary,a precise estimation of wide spectrum support is recovered with a fewer number of compressed measurements.Then,the spectrum occupancy is determined directly from the reconstructed support vector.To carry out this process,a data-driven methodology is utilized to obtain the mini-mum number of necessary samples required for support reconstruction,and a closed-form expression is obtained that optimally estimates the number of desired samples as a function of the sparsity level and number of channels.Following this phase,an adjustable sequential framework is developed where the first step predicts the optimal number of compressed measurements and the second step recovers the sparse support and makes sensing decision.Theoretical analysis and numerical simulations demonstrate the improvement achieved with the proposed algorithm to significantly reduce both sampling costs and average sensing time without any deterioration in detection performance.Furthermore,the remainder of the sensing time can be employed by secondary users for data transmission,thus leading to the enhancement of the total throughput of the CR network.
