A square-root-free QRD-LSL interpolation algorithm

This paper develops a fast order-recursive square-root-free (SRF) QR-decomposition-based least-squares lattice (QRD-LSL) interpolation algorithm that significantly improves the numerical stability of its square-root (SR) version. The proposed interpolation algorithm can be used to implement the widely known recursive least-squares (RLS) algorithm with a computational complexity of O(Nlog2N) per iteration, where N is the order of the RLS filter.