This paper presents a novel, fully parallel algorithm for robust linearly constrained minimum variance (LCMV) beamforming. The robustness results from the use of an adjustable constraint to compensate for the unavoidable small mismatch between the nominal and the actual steering vector of the signal-of-interest. The need for parallelism follows from the large computational demands of beamforming algorithms and by the high data rates which are typically present in communications applications. The algorithm exhibits good numerical properties as it is based on orthogonal transformations only. Two systolic architectures are presented on which the throughput is independent of the size of the beamformer.<>
Systolic robust adaptive beamforming with an adjustable constraint
IEEE Transactions on Aerospace and Electronic Systems ; 31 , 2 ; 658-669
1995-04-01
2821981 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Systolic Robust Adaptive Beamforming With an Adjustable Constraint
Online Contents | 1995
|Optimal Weight Extraction for Adaptive Beamforming Using Systolic Arrays
Online Contents | 1994
|Robust Adaptive Beamforming with Variable Diagonal Loading
British Library Conference Proceedings | 2005
|