A family of pseudo-least squares estimation algorithms without division

In this paper, we show that it is possible to approximate true division by dividing a number by a power-of-two in the LS lattice algorithm that is based on the new direct-coefficient-update form of the exact least squares (LS) lattice algorithm. The resulting pseudo-LS lattice algorithm is modestly slower in initial convergence than the true LS lattice algorithm, while it has a steady state error similar to the latter. The results are extended to a family of LS estimation algorithms covering a broader scope of applications.