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 r...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.展开更多
基金Project supported by the National Natural Science Foundation of China(No.61976113)。
文摘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.
