BEAMSPACE ESPRIT

Most high-resolution algorithms for sensor array processing require an eigendecomposition, which is a computation that is difficult to imple ment in parallel and requires O(M3) multiplications for an M x M matri x, corresponding to M sensors. Beamspace transformation is one way of reducing computation and sometimes improving the estimation accuracy. As a consequence of the beamspace transformation performed, however, a rrays such as uniform linear arrays commonly used in direction finding lose their displacement invariance structure. As a result, computatio nal complexity may actually increase since the computationally efficie nt ESPRIT algorithm cannot be applied directly. In this paper, a metho d for restoring the invariance structure resulting in a beamspace ESPR IT algorithm is described. Asymptotic performance analysis of beamspac e ESPRIT and simulation results are presented as well.