Polynomial subspace decomposition for broadband angle of arrival estimation

In this paper we study the impact of polynomial or broadband subspace decompositions on any subsequent processing, which here uses the example of a broadband angle of arrival estimation technique using a recently proposed polynomial MUSIC (P-MUSIC) algorithm. The subspace decompositions are performed by iterative polynomial EVDs, which differ in their approximations to diagonalise and spectrally majorise s apce-time covariance matrix.We here show that a better diagonalisation has a significant impact on the accuracy of defining broadband signal and noise subspaces, demonstrated by a much higher accuracy of the P-MUSIC spectrum