Search

In acoustic echo cancellation (AEC), the sparseness of impulse responses can vary over time or/and context. For such scenario, the proportionate normalized subband adaptive filter (PNSAF) and μ -law (MPNSAF) algorithms suffer from performance deterioration. To this end, we propose their sparseness-measured versions by incorporating the estimated sparseness into the PNSAF and MPNSAF algorithms, respectively, which can adapt to the sparseness variation of impulse responses. In addition, based on the energy conservation argument, we provide a unified formula to predict the steady-state mean-square performance of any PNSAF algorithm, which is also supported by simulations. Simulation results in AEC have shown that the proposed algorithms not only exhibit faster convergence rate than their competitors in sparse, quasi-sparse and dispersive environments, but also are robust to the variation in the sparseness of impulse responses. [ABSTRACT FROM AUTHOR]