A systolic array for recursive least squares computations

The authors focus on an orthogonal-inverse updating algorithm, and show how a systolic implementation can be derived. They avoid the critical path problem by introducing a few additional computations such that the different algorithmic steps can be executed at the same time. The overall efficiency is then roughly 67%, and the obtained throughput is independent of the problem size