Modified FxLMS algorithms with improved convergence performance

This paper proposes two modifications of the FxLMS algorithm with improved convergence behaviour albeit at the same computational cost of 2M operations per time step as the original FxLMS update. The paper further introduces a generalized FxLMS recursion and establishes that the various recursions are in fact of filtered-error form. An optimal choice of the step-size parameter in order to guarantee faster convergence, and conditions for robustness, are also derived. Several simulation results are included to illustrate the discussions.