A unified SQRT-free rank-1 up/down-dating approach for recursive least-squares problems
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1017-1020 vol.2
- https://doi.org/10.1109/icassp.1991.150515
Abstract
Planar (Givens) and hyperbolic rotations are the most commonly used methods in performing QRD up/downdating. Since the square-root operation takes up much area and its computational time is slow (due to many iterations), the associated area/time efficiency is poor. This is the first effort to establish the basic understanding toward all known square-root-free QRD algorithms, from which the basic criterion is seen to be simple. This unified approach provides a fundamental framework for the square-root-free RLS algorithms essential for practical VLSI implementations.<>Keywords
This publication has 6 references indexed in Scilit:
- A class of least-squares filtering and identification algorithms with systolic array architecturesIEEE Transactions on Information Theory, 1991
- Scaled Givens Rotations for the Solution of Linear Least Squares Problems on Systolic ArraysSIAM Journal on Scientific and Statistical Computing, 1987
- A recursive modified Gram-Schmidt algorithm for least- squares estimationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- Recursive Least-Squares Minimization Using A Systolic ArrayPublished by SPIE-Intl Soc Optical Eng ,1983
- A Note on Modifications to the Givens Plane RotationIMA Journal of Applied Mathematics, 1974
- Least Squares Computations by Givens Transformations Without Square RootsIMA Journal of Applied Mathematics, 1973