Variable individual step-size subband adaptive filtering algorithm

A subband adaptive filtering algorithm is proposed which improves its performance by adjusting step sizes. The proposed algorithm derives the individual step sizes for each subband instead of using a common step size for multiple subbands. The derivation of the step sizes is based on the mean-square deviation minimisation in order to achieve the fastest convergence at the instant. Furthermore, the individual step sizes contain the squared norm of the input vector, hence it leads to the regularisation effect that helps the algorithm work well in the case of badly excited input signals. The simulation results show that the proposed algorithm achieves a faster convergence rate and a smaller steady-state estimation error than the existing algorithms.

[1]  J. Lasserre A trace inequality for matrix product , 1995, IEEE Trans. Autom. Control..

[2]  Kong-Aik Lee,et al.  Improving convergence of the NLMS algorithm using constrained subband updates , 2004, IEEE Signal Processing Letters.

[3]  Jacob Benesty,et al.  A Nonparametric VSS NLMS Algorithm , 2006, IEEE Signal Processing Letters.

[4]  Feng Li,et al.  A Variable Step-Size Matrix Normalized Subband Adaptive Filter , 2010, IEEE Transactions on Audio, Speech, and Language Processing.

[5]  Jae Jin Jeong,et al.  A Variable Step Size for Normalized Subband Adaptive Filters , 2012, IEEE Signal Processing Letters.

[6]  P. Park,et al.  Normalised subband adaptive filter with variable step size , 2012 .

[7]  Yuan Zhang,et al.  White noise estimators for networked systems with packet dropouts , 2013 .