Stereophonic acoustic echo cancellation employing selective-tap adaptive algorithms

Published versio

New Sequential Partial Update Normalized Least Mean M-estimate Algorithms for Stereophonic Acoustic Echo Cancellation

ABSTRACT This paper proposes a family of new robust adaptive filtering algorithms for stereophonic acoustic echo cancellation in impulsive noise environment. The new algorithms employ sequential partial update scheme to reduce computational complexity, which is desirable in long echo path case. On the other hand, by employing robust M-estimate technique, the new algorithms become more robust to impulsive noises compared to their conventional least squarebased counterparts. These two advantages enable the proposed algorithms to be good alternatives for stereophonic echo cancellation. Experiments are also conducted to verify their efficiency

System approach to robust acoustic echo cancellation through semi-blind source separation based on independent component analysis

We live in a dynamic world full of noises and interferences. The conventional acoustic echo cancellation (AEC) framework based on the least mean square (LMS) algorithm by itself lacks the ability to handle many secondary signals that interfere with the adaptive filtering process, e.g., local speech and background noise. In this dissertation, we build a foundation for what we refer to as the system approach to signal enhancement as we focus on the AEC problem. We first propose the residual echo enhancement (REE) technique that utilizes the error recovery nonlinearity (ERN) to "enhances" the filter estimation error prior to the filter adaptation. The single-channel AEC problem can be viewed as a special case of semi-blind source separation (SBSS) where one of the source signals is partially known, i.e., the far-end microphone signal that generates the near-end acoustic echo. SBSS optimized via independent component analysis (ICA) leads to the system combination of the LMS algorithm with the ERN that allows for continuous and stable adaptation even during double talk. Second, we extend the system perspective to the decorrelation problem for AEC, where we show that the REE procedure can be applied effectively in a multi-channel AEC (MCAEC) setting to indirectly assist the recovery of lost AEC performance due to inter-channel correlation, known generally as the "non-uniqueness" problem. We develop a novel, computationally efficient technique of frequency-domain resampling (FDR) that effectively alleviates the non-uniqueness problem directly while introducing minimal distortion to signal quality and statistics. We also apply the system approach to the multi-delay filter (MDF) that suffers from the inter-block correlation problem. Finally, we generalize the MCAEC problem in the SBSS framework and discuss many issues related to the implementation of an SBSS system. We propose a constrained batch-online implementation of SBSS that stabilizes the convergence behavior even in the worst case scenario of a single far-end talker along with the non-uniqueness condition on the far-end mixing system. The proposed techniques are developed from a pragmatic standpoint, motivated by real-world problems in acoustic and audio signal processing. Generalization of the orthogonality principle to the system level of an AEC problem allows us to relate AEC to source separation that seeks to maximize the independence, hence implicitly the orthogonality, not only between the error signal and the far-end signal, but rather, among all signals involved. The system approach, for which the REE paradigm is just one realization, enables the encompassing of many traditional signal enhancement techniques in analytically consistent yet practically effective manner for solving the enhancement problem in a very noisy and disruptive acoustic mixing environment.PhDCommittee Chair: Biing-Hwang Juang; Committee Member: Brani Vidakovic; Committee Member: David V. Anderson; Committee Member: Jeff S. Shamma; Committee Member: Xiaoli M

A subband Kalman filter for echo cancellation

This thesis involves the implementation of a Kalman filter for the application of echo cancellation. This particular Kalman filter is implemented in the frequency domain, in subbands, so as to make it faster and of lesser calculational complexity for real time applications. To evaluate the functioning of this subband Kalman filter, comparison of the performance of the subband Kalman filter is done with respect to the original time domain Kalman filter, and also with other subband adaptive filters for echo cancellation such as the NLMS filter. Additionally, since background noise affects the working of any adaptive filter, the newly developed subband Kalman filter\u27s performance at different noise conditions is compared, and an attempt to keep track of and predict this noise is also performed --Abstract, page iii

Sparseness-controlled adaptive algorithms for supervised and unsupervised system identification

In single-channel hands-free telephony, the acoustic coupling between the loudspeaker and the microphone can be strong and this generates echoes that can degrade user experience. Therefore, effective acoustic echo cancellation (AEC) is necessary to maintain a stable system and hence improve the perceived voice quality of a call. Traditionally, adaptive filters have been deployed in acoustic echo cancellers to estimate the acoustic impulse responses (AIRs) using adaptive algorithms. The performances of a range of well-known algorithms are studied in the context of both AEC and network echo cancellation (NEC). It presents insights into their tracking performances under both time-invariant and time-varying system conditions. In the context of AEC, the level of sparseness in AIRs can vary greatly in a mobile environment. When the response is strongly sparse, convergence of conventional approaches is poor. Drawing on techniques originally developed for NEC, a class of time-domain and a frequency-domain AEC algorithms are proposed that can not only work well in both sparse and dispersive circumstances, but also adapt dynamically to the level of sparseness using a new sparseness-controlled approach. As it will be shown later that the early part of the acoustic echo path is sparse while the late reverberant part of the acoustic path is dispersive, a novel approach to an adaptive filter structure that consists of two time-domain partition blocks is proposed such that different adaptive algorithms can be used for each part. By properly controlling the mixing parameter for the partitioned blocks separately, where the block lengths are controlled adaptively, the proposed partitioned block algorithm works well in both sparse and dispersive time-varying circumstances. A new insight into an analysis on the tracking performance of improved proportionate NLMS (IPNLMS) is presented by deriving the expression for the mean-square error. By employing the framework for both sparse and dispersive time-varying echo paths, this work validates the analytic results in practical simulations for AEC. The time-domain second-order statistic based blind SIMO identification algorithms, which exploit the cross relation method, are investigated and then a technique with proportionate step-size control for both sparse and dispersive system identification is also developed

Complexity Reduction and Improvement in Convergence Characteristics of Fir Filter Using Adaptive Algorithm

Abstract: Linear filtering is required in a variety of application. A filter will be optimal only if it is designed with some knowledge about the input data. If this information is not known, adaptive filters are used. These filters are adaptable to the changing environment. Adaptive filters finds its application in various fields like adaptive noise cancelling, line enhancing, frequency tracking, channel equalisation etc. Adaptive filtering involves two basic operations filtering and adaptation algorithms. First is filtering process in which output signal is generated from input signal using digital filter. Second is adaptation process which consists of adaptive algorithm which adjusts the coefficient of filter to minimize a desired cost function. There are two basic adaptive algorithms which are used in adaptive filtering least mean square algorithm and normalised least mean square algorithm. Least-mean-square (LMS) adaptive algorithm the most popular and widely used. Another most popular mean of FIR filtering technique is to utilize NLMS algorithm but as the length of the filter increases, number of filter coefficient increases so design of filter become complex in NLMS design but by using MMax -NLMS algorithms design of filter become easy but convergence characteristics occur at later stage take too long time for computation for processing of signal. In this work proposal of improving the convergence characteristics is made which doesn't affect the performance of design without compromising the tap-selection process of the MMax-NLMS algorithms

Efficient time delay estimation and compensation applied to the cancellation of acoustic echo

The system identification problem is notably dealt with using adaptive filtering approaches. In many applications the unknown system response consists of an initial sequence of zero-valued coefficients that precedes the active part of the response. The presence of these coefficients introduces a flat delay in the incoming signals which can take significantly large values. When most adaptive approaches attempt to model such a system, the presence of flat delay impairs their operation and performance. The approach introduced in this thesis aims to model the flat delay and active part of the unknown system separately. An efficient system for time delay estimation (TDE) is introduced to estimate the flat delay of an unknown system. The estimated delay is then compensated within the adaptive system thus allowing the latter to cover the active part ofthe unknown system. The proposed system is applied to the Acoustic Echo Cancellation (ABC) problem