“…Therefore, the adaptive filters need to have a fast convergence rate, even for signals with large spread in the correlation matrix eigenvalues. So far, the two channel recursive least squares (RLS) scheme has proven to perform better than other algorithms in SAEC [10], and it was therefore chosen for the implementation.…”
Section: Proposed Structure For the Stereophonic Acoustic Echo Cancelermentioning
confidence: 99%
“…However, a general analysis of the RLS algorithm can be found in [15] and stabilized two channel versions are described in [10,16]. Nevertheless, the definition of the specific version of the two-path FRLS used in the implementation is given below.…”
Section: Fast Recursive Least-squares Adaptive Algorithmmentioning
confidence: 99%
“…Even if the algorithm in Table 1 is more stable than the original fast RLS, non-stationary input data such as speech, may cause stability problems. Therefore the stability is increased further by monitoring the state of the algorithm, and restart it if the algorithm is determined to be in a unstable state [10,17]. During the time between restart and until the algorithm has reconverged, echo cancellation can be poor.…”
“…Therefore, the adaptive filters need to have a fast convergence rate, even for signals with large spread in the correlation matrix eigenvalues. So far, the two channel recursive least squares (RLS) scheme has proven to perform better than other algorithms in SAEC [10], and it was therefore chosen for the implementation.…”
Section: Proposed Structure For the Stereophonic Acoustic Echo Cancelermentioning
confidence: 99%
“…However, a general analysis of the RLS algorithm can be found in [15] and stabilized two channel versions are described in [10,16]. Nevertheless, the definition of the specific version of the two-path FRLS used in the implementation is given below.…”
Section: Fast Recursive Least-squares Adaptive Algorithmmentioning
confidence: 99%
“…Even if the algorithm in Table 1 is more stable than the original fast RLS, non-stationary input data such as speech, may cause stability problems. Therefore the stability is increased further by monitoring the state of the algorithm, and restart it if the algorithm is determined to be in a unstable state [10,17]. During the time between restart and until the algorithm has reconverged, echo cancellation can be poor.…”
“…Two-channel frequency-domain adaptive filtering was first introduced in [19] in the context of stereophonic acoustic echo cancellation and derived from the extended least-mean-squares (ELMS) algorithm [20] in the time domain using similar considerations as for the single-channel case outlined above.…”
Abstract. In unknown environments where we need to identify, model, or track unknown and time-varying channels, adaptive filtering has been proven to be an effective tool. In this chapter, we focus on multichannel algorithms in the frequency domain that are especially well suited for input signals which are not only autocorrelated but also highly cross-correlated among the channels. These properties are particularly important for applications like multichannel acoustic echo cancellation. Most frequency-domain algorithms, as they are well known from the single-channel case, are derived from existing time-domain algorithms and are based on different heuristic strategies. Here, we present a new rigorous derivation of a whole class of multichannel adaptive filtering algorithms in the frequency domain based on a recursive least-squares criterion. Then, from the so-called normal equation, we derive a generic adaptive algorithm in the frequency domain that we formulate in different ways. An analysis of this multichannel algorithm shows that the meansquared error convergence is independent of the input signal statistics. A useful approximation provides interesting links between some well-known algorithms for the single-channel case and the general framework. We also give design rules for important parameters to optimize the performance in practice. Due to the rigorous approach, the proposed framework inherently takes the coherence between all input signal channels into account, while the computational complexity is kept low by introducing several new techniques, such as a robust recursive Kalman gain computation in the frequency domain and efficient fast Fourier transform (FFT) computation tailored to overlapping data blocks. Simulation results and real-time performance for multichannel acoustic echo cancellation show the high efficiency of the approach.
“…Such scenarios imply the use of a multichannel AEC system where the typically strong correlation between the various loudspeaker channels hampers the convergence of adaptation algorithms [37,38]. The generalized frequency-domain adaptive filtering (GFDAF) algorithm has been shown to largely overcome this problem while retaining computational efficiency.…”
Acoustic echo cancellation (AEC) is a well-known application of adaptive filters in communication acoustics. To implement AEC for multichannel reproduction systems, powerful adaptation algorithms like the generalized frequency-domain adaptive filtering (GFDAF) algorithm are required for satisfactory convergence behavior. In this paper, the GFDAF algorithm is rigorously derived as an approximation of the block recursive least-squares (RLS) algorithm. Thereby, the original formulation of the GFDAF algorithm is generalized while avoiding an error that has been in the original derivation. The presented algorithm formulation is applied to pruned transform-domain loudspeaker-enclosure-microphone models in a mathematically consistent manner. Such pruned models have recently been proposed to cope with the tremendous computational demands of massive multichannel AEC. Beyond its generalization, a regularization of the GFDAF is shown to have a close relation to the well-known block least-mean-squares algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.