Efficient implementation of error-feedback LSL algorithm

An error feedback LSL algorithm is presented which has a reduced computatio nal complexity and makes use of both a priori and a posteriori prediction e rrors. A simple numerical convention is proposed to assure numerical stabil ity for poor persistent excitation. Simulation results illustrate that divi sions can be implemented with reduced wordlength without leading to a signi ficant decrease in the overall accuracy even in floating-point implementati ons. This fact allows the use of lookup tables for implementing divisions. Moreover, the proposed algorithm has an inherent parallelism that can be ad vantageously exploited for fast implementations.