Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Computationally efficient QR decomposition approach to least squares 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.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Proudler, I.K. ; R. Signals & Radar Establ., Great Malvern, UK ; McWhirter, J.G. ; Shepherd, T.J.

The least squares lattice algorithm for adaptive filtering based on the technique of QR decomposition (QRD) is derived from first principles. In common with other lattice algorithms for adaptive filtering, this algorithm only requires O(p) operations for the solution of a pth order problem. The algorithm has as its root the QRD-based recursive least squares minimisation algorithm and hence is expected to have superior numerical properties when compared with other fast algorithms. This algorithm contains within it the QRD-based lattice algorithm for solving the least squares linear prediction problem. The algorithm is presented in two forms: one that involves taking square-roots and one that does not. The relationship between the QRD-based lattice algorithm and other least squares lattice algorithms is briefly discussed. The results of some computer simulations of a channel equaliser, using finite-precision floating-point arithmetic, are presented

Published in:

Radar and Signal Processing, IEE Proceedings F  (Volume:138 ,  Issue: 4 )