A Family of Variable Step-size Nlms Algorithms for Echo Cancellation

نویسندگان

  • CONSTANTIN PALEOLOGU
  • JACOB BENESTY
  • SILVIU CIOCHINĂ
  • Constantin Paleologu
  • Jacob Benesty
  • Silviu Ciochină
چکیده

The normalized least-mean-square (NLMS) algorithm is one of the most common choices for echo cancellation. Nevertheless, an NLMS algorithm has to compromise between several performances criteria (e.g., convergence rate versus misadjustment, tracking capabilities versus robustness). Thus, a variable step-size NLMS (VSS-NLMS) algorithm represents a more reliable solution. Recently, several VSS-NLMS algorithms that take into account the existence of the near-end signal (in terms of power estimate) have been proposed with the objective of recovering the near-end signal from the error signal. Since this is the basic goal in echo cancellation, this class of VSS-NLMS algorithms can be very suitable for such an application. The main issue remains the estimation of the near-end signal power, in terms of accuracy and other practical aspects (e.g., available parameters, computational complexity). This paper analyzes different solutions for this problem, making a first unified approach over the performances of this family of VSS-NLMS algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single and Multiple -Variable Step Size Normalized Least Mean Square Algorithms for Network Echo Cancellation

In this paper, we propose improved versions of normalized least mean square (NLMS) algorithm: single and multiple -variable step size normalized least mean square (VSSNLMS) algorithms for echo cancellation. The presented algorithms exhibit faster convergence rate in comparison to NLMS algorithm. Simulation results employing standard figure of merits show how the algorithms perform better than N...

متن کامل

Variable Step Size Algorithms for Network Echo Cancellation

Convergence rate of an algorithm is an important factor that determines the deployment of such algorithm in a real time application. In this paper, we propose improved versions of normalized least mean square (NLMS) algorithm: single and multiple -variable step size normalized least mean square (VSSNLMS) algorithms for echo cancellation. The presented algorithms exhibit faster convergence rate ...

متن کامل

Image Restoration with Two-Dimensional Adaptive Filter Algorithms

Two-dimensional (TD) adaptive filtering is a technique that can be applied to many image, and signal processing applications. This paper extends the one-dimensional adaptive filter algorithms to TD structures and the novel TD adaptive filters are established. Based on this extension, the TD variable step-size normalized least mean squares (TD-VSS-NLMS), the TD-VSS affine projection algorithms (...

متن کامل

A Variable Step-size Proportionate Nlms Algorithm for Echo Cancellation

The proportionate normalized least-mean-square (PNLMS) algorithms were developed in the context of network echo cancellation. They outperform the normalized leastmean-square (NLMS) algorithm only when the echo path is sparse. Unfortunately, realworld network echo path may not be that sparse sometimes, while the acoustic echo paths are usually less sparse. The improved PNLMS (IPNLMS) algorithm i...

متن کامل

A Novel Variable Step Size NLMS Algorithm Based on the Power Estimate of the System Noise

To overcome the tradeoff of the conventional normalized least mean square (NLMS) algorithm between fast convergence rate and low steady-state misalignment, this paper proposes a variable step size (VSS) NLMS algorithm by devising a new strategy to update the step size. In this strategy, the input signal power and the cross-correlation between the input signal and the error signal are used to es...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010