Skip to Main Content
We present two algorithms to solve the total least-squares (TLS) problem. The algorithms are on-line with O(N2) and O(N) complexity. The convergence of the algorithms is significantly faster than the traditional methods. A mathematical analysis of convergence is also provided along with simulations to substantiate the claims. We also apply the TLS algorithms for FIR system identification with known model order in the presence of noise.