By Topic

A fast least squares algorithm for constrained adaptive filtering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
L. S. Resende ; DECOM/FEE, Univ. de Campinas, Sao Paulo, Brazil ; J. M. T. Romano ; M. G. Bellanger

A fast least squares algorithm is proposed for adaptive filtering with linear constraints. The algorithm is exact, with a computational complexity proportional to NK+K2+N+K where N is the number of the filter coefficients and K is the number of constraints. The approach consists of obtaining the adaptation gain by means of a fast least squares (FLS) algorithm and using this gain in the recursive calculations of the parameters related to the constraints. The recursive procedures are carried out by using the matrix inversion lemma. The good performance of the proposed method is illustrated by some simulation results. The algorithm can be used in several applications such as array processing, adaptive beamforming, spectral analysis and telecommunications

Published in:

Acoustics, Speech, and Signal Processing, 1992. ICASSP-92., 1992 IEEE International Conference on  (Volume:4 )

Date of Conference:

23-26 Mar 1992