On a systolic implementation and the numerical properties of a multiple constrained adaptive beamformer

An efficient algorithm for the multiple linearly constrained adaptive beamformer is developed. It is based on rank-one updating and downdating Cholesky factorizations. These operations can be realized by a sequence of complex Givens and hyperbolic rotations. A linear systolic array using CORDIC processors as the processing elements for implementing the algorithm is presented. The authors also investigate the numerical properties of the algorithm.<<ETX>>