A unified square-root-free approach for QRD-based recursive-least-squares estimation
Authors:
- S.F. HsiehSHS.F. Hsieh
- K.J.R. LiuKLK.J.R. Liu
- K. YaoKYK. Yao
- 1 March 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 41 (3) , 1405-1409
Abstract
Givens rotation is the most commonly used method in per- forming the QR decomposition (QRD) updating. The generic formula for these rotations requires explicit square-root (sqrt) computations which constitute a computational bottleneck and are quite undesirable from the practical VLSI circuit design point of view. So far, there has been more than ten known sqrt-free algorithms. In this correspon- dence, we provide a unified systematic approach for the sqrt-free Giv- ens rotation. By properly choosing two parameters, p and v, all pre- viously known sqrt-free, as well as new methods, are included in our unified approach. This unified treatment is also extended to the QRD- based recursive least squares (RLS) problem for optimum residual ac- quisition without sqrt operations.Keywords
This publication has 7 references indexed in Scilit:
- 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
- Systolic array processing for order and time recursive generalized least-squares estimation1986
- Recursive Least-Squares Minimization Using A Systolic Array1983
- Matrix Triangularization By Systolic Arrays1982
- 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