Underdetermined-order recursive least-squares adaptive filtering: The concept and algorithms

Published versio

Acoustic Echo Cancellation and their Application in ADF

In this paper, we present an overview of the principal, structure and the application of the echo cancellation and kind of application to improve the performance of the systems. Echo is a process in which a delayed and distorted version o the original sound or voice signal is reflected back to the source. For the acoustic echo canceller much and more study are required to make the good tracking speed fast and reduce the computational complexity. Due to the increasing the processing requirement, widespread implementation had to wait for advances in LSI, VLSI echo canceller appeared. DOI: 10.17762/ijritcc2321-8169.150513

Algorithms and structures for long adaptive echo cancellers

The main theme of this thesis is adaptive echo cancellation. Two novel independent approaches are proposed for the design of long echo cancellers with improved performance. In the first approach, we present a novel structure for bulk delay estimation in long echo cancellers which considerably reduces the amount of excess error. The miscalculation of the delay between the near-end and the far-end sections is one of the main causes of this excess error. Two analyses, based on the Least Mean Squares (LMS) algorithm, are presented where certain shapes for the transitions between the end of the near-end section and the beginning of the far-end one are considered. Transient and steady-state behaviours and convergence conditions for the proposed algorithm are studied. Comparisons between the algorithms developed for each transition are presented, and the simulation results agree well with the theoretical derivations. In the second approach, a generalised performance index is proposed for the design of the echo canceller. The proposed algorithm consists of simultaneously applying the LMS algorithm to the near-end section and the Least Mean Fourth (LMF) algorithm to the far-end section of the echo canceller. This combination results in a substantial improvement of the performance of the proposed scheme over both the LMS and other algorithms proposed for comparison. In this approach, the proposed algorithm will be henceforth called the Least Mean Mixed-Norm (LMMN) algorithm. The advantages of the LMMN algorithm over previously reported ones are two folds: it leads to a faster convergence and results in a smaller misadjustment error. Finally, the convergence properties of the LMMN algorithm are derived and the simulation results confirm the superior performance of this proposed algorithm over other well known algorithms

LMS Adaptive Filters for Noise Cancellation: A Review

This paper reviews the past and the recent research on Adaptive Filter algorithms based on adaptive noise cancellation systems. In many applications of noise cancellation, the change in signal characteristics could be quite fast which requires the utilization of adaptive algorithms that converge rapidly. Algorithms such as LMS and RLS proves to be vital in the noise cancellation are reviewed including principle and recent modifications to increase the convergence rate and reduce the computational complexity for future implementation. The purpose of this paper is not only to discuss various noise cancellation LMS algorithms but also to provide the reader with an overview of the research conducted

Low-complexity RLS algorithms using dichotomous coordinate descent iterations

In this paper, we derive low-complexity recursive least squares (RLS) adaptive filtering algorithms. We express the RLS problem in terms of auxiliary normal equations with respect to increments of the filter weights and apply this approach to the exponentially weighted and sliding window cases to derive new RLS techniques. For solving the auxiliary equations, line search methods are used. We first consider conjugate gradient iterations with a complexity of O(N-2) operations per sample; N being the number of the filter weights. To reduce the complexity and make the algorithms more suitable for finite precision implementation, we propose a new dichotomous coordinate descent (DCD) algorithm and apply it to the auxiliary equations. This results in a transversal RLS adaptive filter with complexity as low as 3N multiplications per sample, which is only slightly higher than the complexity of the least mean squares (LMS) algorithm (2N multiplications). Simulations are used to compare the performance of the proposed algorithms against the classical RLS and known advanced adaptive algorithms. Fixed-point FPGA implementation of the proposed DCD-based RLS algorithm is also discussed and results of such implementation are presented

Adaptive IIR filtering using the homotopy continuation method

The objective of this study is to develop an algorithmic approach for solving problems associated with the convergence to the local minima in adaptive IIR filtering. The approach is based on a numerical method called the homotopy continuation method;The homotopy continuation method is a solution exhaustive method for calculating all solutions of a set of nonlinear equations. The globally optimum filter coefficients correspond to the solutions with minimum mean square error. In order to apply the technique to the adaptive IIR filtering problem, the homotopy continuation method is modified to handle a set of nonlinear polynomials with time-varying coefficients. Then, the adaptive IIR filtering problem is formulated in terms of a set of nonlinear polynomials using the mean square output error minimization approach. The adaptive homotopy continuation method (AHCM) for the case of time-varying coefficients is then applied to solve the IIR filtering problem. After demonstrating the feasibility of the approach, problems encountered in the basic AHCM algorithm are discussed and alternative structures of the filter are proposed. In the development of the proposed algorithm and its variations, the instability problem which is a second disadvantage of IIR filters is also considered;Simulation results for a system identification example validate the proposed algorithm by determining the filter coefficients at the global minimum position. For further validation, the AHCM algorithm is then applied to an adaptive noise cancellation application in ultrasonic nondestructive evaluation. Ultrasonic inspection signal reflections from defects and material grain boundaries are considered. The AHCM algorithm is applied to the noise cancellation mode to filter out the material noise. The experimental results show that the proposed algorithm shows considerable promise for real as well as for simulated data

Theory, design and application of gradient adaptive lattice filters

SIGLELD:D48933/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

A new proportionate fast LMS/Newton algorithm for adaptive filtering

This paper proposes a new proportionate adaptive filtering algorithm which exploits the advantageous features of the generalized proportionate NLMS (GP-NLMS) algorithm and the fast LMS/Newton algorithm. By means of an efficient switching mechanism, the new algorithm works alternately between the GP-NLMS and the fast LMS/Newton algorithms in order to combine their respective advantages. The overall converging speed and steady state performance for both sparse and dispersive channels as well as tracking performance are thus significantly improved. Computer simulations on an echo cancellation problem verify the superior performance of the new algorithm over both the GP-NLMS algorithm and the conventional fast LMS/Newton algorithm. ©2005 IEEE.published_or_final_versio