A Modified FBLMS Algorithm Research and Performance Analysis

As there is a conflict about block step size between the requirements of the convergence velocity and parameters' maladjustment within FBLMS algorithm, a modified FBLMS algorithm is well presented in this paper which uses a variable block step size to solve the contradiction between convergence...

Full description

Saved in:
Bibliographic Details
Published in2009 First International Conference on Information Science and Engineering pp. 3717 - 3721
Main Authors Qi Hua, Guo Tian-Yi, Lian Bao-wan, Liu Jun
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2009
Subjects
Adaptive algorithm
Adaptive filters
Convergence
Educational institutions
Eigenvalues and eigenfunctions
Equations
Information science
Least squares approximation
Performance analysis
Time domain analysis
Online AccessGet full text

Cover

More Information
Summary:As there is a conflict about block step size between the requirements of the convergence velocity and parameters' maladjustment within FBLMS algorithm, a modified FBLMS algorithm is well presented in this paper which uses a variable block step size to solve the contradiction between convergence rate and precision. The modified FBLMS algorithm is simulated in the MATLAB platform. The simulation results prove that this algorithm not only has a faster convergence speed, a faster tracking speed and a smaller stationary error, but also has a better anti-jamming capability.
ISBN:142444909X
9781424449095
ISSN:2160-1283
DOI:10.1109/ICISE.2009.71