30 November 1992 Analysis of a linearly constrained least-squares algorithm for adaptive beamforming
Author Affiliations +
Abstract
The problem of linearly constrained least squares has many applications in signal processing. In this paper, we present a perturbation analysis of a novel, linearly constrained least squares algorithm for adaptive beamforming. The perturbation bounds for the solution as well as for the latest residual element are derived. We also propose an error estimation scheme for the residual element. This error estimation scheme can be incorporated into a systolic array implementation of the algorithm. The additional time required for error estimation is small, as we show how the processor idle time can be used to carry out almost all the calculations.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Franklin T. Luk, Franklin T. Luk, Sanzheng Qiao, Sanzheng Qiao, } "Analysis of a linearly constrained least-squares algorithm for adaptive beamforming", Proc. SPIE 1770, Advanced Signal Processing Algorithms, Architectures, and Implementations III, (30 November 1992); doi: 10.1117/12.130931; https://doi.org/10.1117/12.130931
PROCEEDINGS
9 PAGES


SHARE
RELATED CONTENT

Computing the PSVD of two 2 X 2 triangular matrices
Proceedings of SPIE (November 29 1992)
Solution of the Yule-Walker equations
Proceedings of SPIE (November 30 1991)
Accurate fast Hankel matrix solver
Proceedings of SPIE (November 30 1991)

Back to Top