A completely pipelined regular array processor implementation of the RITE algorithm

Abstract

The paper presents a completely pipelined regular array processor implementation of a direction of arrival estimator. The estimator employs the recursive/iterative eigenspace decomposition (RITE) of a hermitian Toeplitz spatial correlation matrix. In addition to the recursive and iterative nature of the algorithm, various dependencies are strongly connected. The eigenvalue computations are based on the secular equation, and the eigenvector computations are based on the Schur algorithm. A new concept of a flushing processor is employed to integrate the Schur implementation of lower and upper triangular matrices with asymptotic processor efficiency of 100%.<>