Parallel implementation and performance analysis of beamspace ESPRIT
Guangkui Xu, Seth D. Silverstein, R. Roy, T. Kailath · 1991
Most high-resolution algorithms for sensor array processing require an eigendecomposition which is difficult to implement in parallel and costs at least O(M/sup 3/) multiplications for an M*M matrix, corresponding to M sensors. Recently, S.D. Silverstein et al, (1991) presented a subband parallel scheme, which reduced the computation time from O(M/sup 3/) to O(L/sup 3/), where L(>