In a previous study we proposed a modified version of the RLS (Recursive Least Square) adaptive algorithm suitable for fixed-point implementation. Using an asymptotically unbiased estimator for the algorithm's cost function we reduced the dynamic range of this parameter. In this paper we extend the procedure for the case of QRD-LSL (QR-Decomposition-based Least-Squares Lattice) adaptive algorithm, a "fast" member of LS family, with good numerical properties. Two modified versions of this algorithm result. The reduced dynamics of theirs parameters could leads to facility for fixed-point implementation.
展开▼
