|
Frontiers of Information Technology & Electronic Engineering
ISSN 2095-9184 (print), ISSN 2095-9230 (online)
2020 Vol.21 No.9 P.1302-1307
An improved subspace weighting method using random matrix theory
Abstract: The weighting subspace fitting (WSF) algorithm performs better than the multi-signal classification (MUSIC) algorithm in the case of low signal-to-noise ratio (SNR) and when signals are correlated. In this study, we use the random matrix theory (RMT) to improve WSF. RMT focuses on the asymptotic behavior of eigenvalues and eigenvectors of random matrices with dimensions of matrices increasing at the same rate. The approximative first-order perturbation is applied in WSF when calculating statistics of the eigenvectors of sample covariance. Using the asymptotic results of the norm of the projection from the sample covariance matrix signal subspace onto the real signal in the random matrix theory, the method of calculating WSF is obtained. Numerical results are shown to prove the superiority of RMT in scenarios with few snapshots and a low SNR.
Key words: Direction of arrival, Signal subspace, Random matrix theory
1南京大学电子科学与工程学院,中国南京市,210023
2南安普顿大学声振研究所,英国南安普顿市,SO171BJ
摘要:在低信噪比及信号相关情况下,加权子空间拟合(WSF)算法的性能优于多信号分类(MUSIC)算法。本文使用随机矩阵理论(RMT)改善加权子空间拟合。随机矩阵理论研究随机矩阵维数以同速率增加时,矩阵特征值和特征向量的渐近规律。加权子空间拟合中,运用近似一阶扰动计算样本协方差矩阵特征向量的统计特性。利用随机矩阵理论中关于样本协方差矩阵信号子空间向真实信号投影的范数的渐进结果,获得加权子空间拟合计算方法。仿真结果表明,在低快拍数及低信噪比情况下,本文所提方法具有优越性。
关键词组:
References:
Open peer comments: Debate/Discuss/Question/Opinion
<1>
DOI:
10.1631/FITEE.1900463
CLC number:
TP319
Download Full Text:
Downloaded:
6799
Download summary:
<Click Here>Downloaded:
1445Clicked:
5651
Cited:
0
On-line Access:
2024-08-27
Received:
2023-10-17
Revision Accepted:
2024-05-08
Crosschecked:
2020-08-10