Fast algorithm for root-MUSIC with real-valued eigendecomposition

A fast algorithm for the Root-MUSIC with real-valued eigendecomposition is considered. This algorithm reduces the computational complexity in the eigenanalysis stage of root-MUSIC because it exploits the eigendecomposition of a real-valued covariance matrix. The asymptotic performance of Root-MUSIC with real-valued eigendecomposition (RVED-Root-MUSIC) is analyzed and compared with that of conventional root-MUSIC. The coefficients of the polynomial for Root MUSIC is deduced and given the concrete calculation formula, so that the speed of polynomial finding roots gets the bigger exaltation. The results of this comparison show identical asymptotic properties of both algorithms in the case of uncorrelated sources and a better performance of RVED-Root-MUSIC in scenarios with partially correlated or fully coherent sources. Additionally, our simulations and the results demonstrate an improved performance of RVED-Root-MUSIC relative to conventional root-MUSIC.