Share Email Print

Proceedings Paper

Analysis of a linearly constrained least-squares algorithm for adaptive beamforming
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 30 November 1992
PDF: 9 pages
Proc. SPIE 1770, Advanced Signal Processing Algorithms, Architectures, and Implementations III, (30 November 1992); doi: 10.1117/12.130931
Show Author Affiliations
Franklin T. Luk, Rensselaer Polytechnic Institute (United States)
Sanzheng Qiao, McMaster Univ. (Canada)

Published in SPIE Proceedings Vol. 1770:
Advanced Signal Processing Algorithms, Architectures, and Implementations III
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top