Abstract
This paper presents a square root and division free Givens rotation (SDFG) to be applied to the QR-decomposition (QRD) for solving linear least squares problems on systolic arrays. The SDFG is based on a special kind of number description of the matrix elements and can be executed by mere application of multiplications and additions. Therefore, it is highly suited for the VLSI-implementation of the QRD on systolic arrays. Roundofi error and stability analyses indicate that the SDFG is numerically as stable as known Givens rotation methods.

This publication has 11 references indexed in Scilit: