SYSTOLIC ROBUST ADAPTIVE BEAMFORMING WITH AN ADJUSTABLE CONSTRAINT

This paper presents a novel, fully parallel algorithm for robust linea rly constrained minimum variance (LCMV) beamforming. The robustness re sults from the use of an adjustable constraint to compensate for the u navoidable small mismatch between the nominal and the actual steering vector of the signal-of-interest. The need for parallelism follows fro m the large computational demands of beamforming algorithms and by the high data rates which are typically present in communications applica tions. The algorithm exhibits good numerical properties as it is based on orthogonal transformations only. Two systolic architectures are pr esented on which the throughput is independent of the size of the beam former.