The direction-of-arrival(DOA)estimation problem can be solved by the methods based on sparse Bayesian learning(SBL).To assure the accuracy,SBL needs massive amounts of snapshots which may lead to a huge computational ...The direction-of-arrival(DOA)estimation problem can be solved by the methods based on sparse Bayesian learning(SBL).To assure the accuracy,SBL needs massive amounts of snapshots which may lead to a huge computational workload.In order to reduce the snapshot number and computational complexity,a randomize-then-optimize(RTO)algorithm based DOA estimation method is proposed.The“learning”process for updating hyperparameters in SBL can be avoided by using the optimization and Metropolis-Hastings process in the RTO algorithm.To apply the RTO algorithm for a Laplace prior,a prior transformation technique is induced.To demonstrate the effectiveness of the proposed method,several simulations are proceeded,which verifies that the proposed method has better accuracy with 1 snapshot and shorter processing time than conventional compressive sensing(CS)based DOA methods.展开更多
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 work was supported by the National Natural Science Foundation of China under Grants No.61871083 and No.61721001.
文摘The direction-of-arrival(DOA)estimation problem can be solved by the methods based on sparse Bayesian learning(SBL).To assure the accuracy,SBL needs massive amounts of snapshots which may lead to a huge computational workload.In order to reduce the snapshot number and computational complexity,a randomize-then-optimize(RTO)algorithm based DOA estimation method is proposed.The“learning”process for updating hyperparameters in SBL can be avoided by using the optimization and Metropolis-Hastings process in the RTO algorithm.To apply the RTO algorithm for a Laplace prior,a prior transformation technique is induced.To demonstrate the effectiveness of the proposed method,several simulations are proceeded,which verifies that the proposed method has better accuracy with 1 snapshot and shorter processing time than conventional compressive sensing(CS)based DOA methods.
基金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.
