A low computational complexity normalized subband adaptive filter algorithm employing signed regressor of input signal

Abstract ᅟ In this paper, the signed regressor normalized subband adaptive filter (SR-NSAF) algorithm is proposed. This algorithm is optimized by L 1-norm minimization criteria. The SR-NSAF has a fast convergence speed and a low steady-state error similar to the conventional NSAF. In addition, the p...

Full description

Bibliographic Details
Main Authors: Mohammad Shams Esfand Abadi, Mohammad Saeed Shafiee, Mehrdad Zalaghi
Format: Article
Language:English
Published: SpringerOpen 2018-04-01
Series:EURASIP Journal on Advances in Signal Processing
Subjects:
Online Access:http://link.springer.com/article/10.1186/s13634-018-0542-z
Description
Summary:Abstract ᅟ In this paper, the signed regressor normalized subband adaptive filter (SR-NSAF) algorithm is proposed. This algorithm is optimized by L 1-norm minimization criteria. The SR-NSAF has a fast convergence speed and a low steady-state error similar to the conventional NSAF. In addition, the proposed algorithm has lower computational complexity than NSAF due to the signed regressor of the input signal at each subband. The theoretical mean-square performance analysis of the proposed algorithm in the stationary and nonstationary environments is studied based on the energy conservation relation and the steady-state, the transient, and the stability bounds of the SR-NSAF are predicated by the closed form expressions. The good performance of SR-NSAF is demonstrated through several simulation results in system identification, acoustic echo cancelation (AEC) and line EC (LEC) applications. The theoretical relations are also verified by presenting various experimental results.
ISSN:1687-6180