A unified square-root-free approach for QRD-based recursive-least-squares estimation

Authors:
  • SHS.F. Hsieh
    S.F. Hsieh
  • KLK.J.R. Liu
    K.J.R. Liu
  • KYK. Yao
    K. Yao

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.