Qrd-based Square Root Free And Division Free Algorithms And Architectures

Abstract

We introduce a family of square root free and division free rotation based algorithms. Our approach suggests a new perspective of the Q R decomposition (QRD) algorithms and leads to a considerable reduction of the circuitry complexity and time delay in the associated architectures. The optimal residual and the optimal weight ext:raction for the recursive least squares (RLS) problem are considered in this paper. The systolic structures that are described are very promising, since they involve less computational complexity from the structures known to date and they make the VLSI implementation more tractable.