Implementation and convergence considerations of a linearlyconstrained adaptive array

O.L. Frost (1972) introduced a linearly constrained optimization algorithm that allows certain main beam properties to be preserved while good cancellation is attained. An open-loop implementation of this algorithm is developed. This implementation is shown to be equivalent to the technique developed by C.W. Jim (1977), L.J. Griffiths and C.W. Jin (1982), and K.M. Buckley and L.J. Griffiths (1982) whereby the constrained problem is reduced to an unconstrained problem. Analytical results are presented for the convergence rate when the sampled matrix inversion (SMI) or Gram-Schmidt (GS) algorithm are employed. It has been previously shown that the steady-state solution for the optimal weights is identical for both constrained and reduced unconstrained problems. It is shown that if the SMI or GS algorithm is employed, then the transient weighting vector solution for the constrained problem is identical to the equivalent transient weight vector solution for the reduced unconstrained implementation