It is well-known that the multiple signal classification (MUSIC) algorithm is computationally time-consuming because it requires a complex-valued full-dimension eigenvalue decomposition (EVD) and a complex-valued spectral searching. In this paper, we exploit the virtual signal model of forward/backward average of array covariance matrix (FBACM) to show that its real part (R-FBACM) is a real symmetric matrix. Based on that, we prove that by evaluating two half-dimension EVD after an orthogonally similar transformation performed on the estimated R-FBACM, we are able to reconstruct the original eigenspace whereas the maximum number of estimated sources is reduced as compared to the upper limit M - 1 for original MUSIC. Numerical results show that the proposed method provides satisfactory estimation accuracy and improved resolution with reduced complexity.
Half-Dimension Subspace Decomposition for Fast Direction Finding With Arbitrary Linear Arrays
Maria GrecoMembro del Collaboration Group
;Fulvio GiniMembro del Collaboration Group
;
2022-01-01
Abstract
It is well-known that the multiple signal classification (MUSIC) algorithm is computationally time-consuming because it requires a complex-valued full-dimension eigenvalue decomposition (EVD) and a complex-valued spectral searching. In this paper, we exploit the virtual signal model of forward/backward average of array covariance matrix (FBACM) to show that its real part (R-FBACM) is a real symmetric matrix. Based on that, we prove that by evaluating two half-dimension EVD after an orthogonally similar transformation performed on the estimated R-FBACM, we are able to reconstruct the original eigenspace whereas the maximum number of estimated sources is reduced as compared to the upper limit M - 1 for original MUSIC. Numerical results show that the proposed method provides satisfactory estimation accuracy and improved resolution with reduced complexity.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.