Biased estimates in the order recursive forward-backward lattice algorithm

Deals with the accuracy problem of the estimated reflection coefficients. The algorithm is studied in comparison to the time recursive forward-backward lattice method (FBLT) and the exact order recursive LS lattice algorithm (LSLO). Some mathematical formulations are derived to analyze the bias in estimation. Both theoretical and simulation results show that the estimated reflection coefficients of the FBLO algorithm do not converge to their optimum values. The estimates are biased. The amount of bias depends upon the forgetting factor of the algorithm.<
>