Zeqi Yang, Yiheng Liu, Hua Zhang, Shuai Ma, Kai Chang, Ning Liu, Xiaode Lyu
{"title":"DOA Estimation of High-Dimensional Signals Based on Krylov Subspace and Weighted $l_{1}$-Norm","authors":"Zeqi Yang, Yiheng Liu, Hua Zhang, Shuai Ma, Kai Chang, Ning Liu, Xiaode Lyu","doi":"10.23919/jsee.2023.000145","DOIUrl":null,"url":null,"abstract":"With the extensive application of large-scale array antennas, the increasing number of array elements leads to the increasing dimension of received signals, making it difficult to meet the real-time requirement of direction of arrival (DOA) estimation due to the computational complexity of algorithms. Traditional subspace algorithms require estimation of the covariance matrix, which has high computational complexity and is prone to producing spurious peaks. In order to reduce the computational complexity of DOA estimation algorithms and improve their estimation accuracy under large array elements, this paper proposes a DOA estimation method based on Krylov subspace and weighted <tex xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">$l_{1}$</tex>\n-norm. The method uses the multistage Wiener filter (MSWF) iteration to solve the basis of the Krylov subspace as an estimate of the signal subspace, further uses the measurement matrix to reduce the dimensionality of the signal subspace observation, constructs a weighted matrix, and combines the sparse reconstruction to establish a convex optimization function based on the residual sum of squares and weighted <tex xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">$l_{1}$</tex>\n-norm to solve the target DOA. Simulation results show that the proposed method has high resolution under large array conditions, effectively suppresses spurious peaks, reduces computational complexity, and has good robustness for low signal to noise ratio (SNR) environment.","PeriodicalId":50030,"journal":{"name":"Journal of Systems Engineering and Electronics","volume":"22 1","pages":""},"PeriodicalIF":1.9000,"publicationDate":"2024-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Systems Engineering and Electronics","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.23919/jsee.2023.000145","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
With the extensive application of large-scale array antennas, the increasing number of array elements leads to the increasing dimension of received signals, making it difficult to meet the real-time requirement of direction of arrival (DOA) estimation due to the computational complexity of algorithms. Traditional subspace algorithms require estimation of the covariance matrix, which has high computational complexity and is prone to producing spurious peaks. In order to reduce the computational complexity of DOA estimation algorithms and improve their estimation accuracy under large array elements, this paper proposes a DOA estimation method based on Krylov subspace and weighted $l_{1}$
-norm. The method uses the multistage Wiener filter (MSWF) iteration to solve the basis of the Krylov subspace as an estimate of the signal subspace, further uses the measurement matrix to reduce the dimensionality of the signal subspace observation, constructs a weighted matrix, and combines the sparse reconstruction to establish a convex optimization function based on the residual sum of squares and weighted $l_{1}$
-norm to solve the target DOA. Simulation results show that the proposed method has high resolution under large array conditions, effectively suppresses spurious peaks, reduces computational complexity, and has good robustness for low signal to noise ratio (SNR) environment.