A one dimensional systolic array for solving arbitrarily large least mean square problems

The design is presented of a one-dimensional systolic array for solving arbitrarily large least-mean-square problems involving QR decomposition and a triangular system of equations. The main characteristics of this array are maximization of array utilization, thus achieving a minimum global computation time, and low complexity of the resulting array, which can also be used in problems such as matrix-by-vector, matrix-by-matrix, and LU decomposition. Two systolic algorithms for QR decomposition have been designed. Their chained execution is shown.<
>