There are a large number of algorithms that solve the least-squares problem in a recursive form. In particular, the algorithms based on the lattice realization are very attractive because they allow modular implementation and require a reduced number of arithmetic operations (of order N) [1–7]. As a consequence, the lattice recursive least-squares (LRLS) algorithms are considered fast implementations of the RLS problem.
- 4.M. Bellanger, Adaptive Digital Filters and Signal Processing, 2nd edn. (Marcel Dekker, Inc., New York, 2001)Google Scholar
- 13.M. Reed, B. Liu, Analysis of simplified gradient adaptive lattice algorithms using power-of-two quantization, in Proceedings of the IEEE Internatinal Symposium on Circuits and Systems, New Orleans, LA, May 1990, pp. 792–795Google Scholar