scispace - formally typeset
Search or ask a question
Author

W.H. Lau

Bio: W.H. Lau is an academic researcher. The author has contributed to research in topics: Adaptive filter & Stability (learning theory). The author has an hindex of 1, co-authored 1 publications receiving 134 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: A new hybrid search methodology is developed in which the genetic-type search is embedded into gradient-descent algorithms (such as the LMS algorithm), which has the characteristics of faster convergence, global search capability, less sensitivity to the choice of parameters, and simple implementation.
Abstract: An "evolutionary" approach called the genetic algorithm (GA) was introduced for multimodal optimization in adaptive IIR filtering. However, the disadvantages of using such an algorithm are slow convergence and high computational complexity. Initiated by the merits and shortcomings of the gradient-based algorithms and the evolutionary algorithms, we developed a new hybrid search methodology in which the genetic-type search is embedded into gradient-descent algorithms (such as the LMS algorithm). The new algorithm has the characteristics of faster convergence, global search capability, less sensitivity to the choice of parameters, and simple implementation. The basic idea of the new algorithm is that the filter coefficients are evolved in a random manner once the filter is found to be stuck at a local minimum or to have a slow convergence rate. Only the fittest coefficient set survives and is adapted according to the gradient-descent algorithm until the next evolution. As the random perturbation will be subject to the stability constraint, the filter can always minimum in a stable manner and achieve a smaller error performance with a fast rate. The article reviews adaptive IIR filtering and discusses common learning algorithms for adaptive filtering. It then presents a new learning algorithm based on the genetic search approach and shows how it can help overcome the problems associated with gradient-based and GA algorithms.

135 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: A new method based on ABC algorithm for designing digital IIR filters is described and its performance is compared with that of a conventional optimization algorithm (LSQ-nonlin) and particle swarm optimization (PSO) algorithm.
Abstract: Digital filters can be broadly classified into two groups: recursive (infinite impulse response (IIR)) and non-recursive (finite impulse response (FIR)). An IIR filter can provide a much better performance than the FIR filter having the same number of coefficients. However, IIR filters might have a multi-modal error surface. Therefore, a reliable design method proposed for IIR filters must be based on a global search procedure. Artificial bee colony (ABC) algorithm has been recently introduced for global optimization. The ABC algorithm simulating the intelligent foraging behaviour of honey bee swarm is a simple, robust, and very flexible algorithm. In this work, a new method based on ABC algorithm for designing digital IIR filters is described and its performance is compared with that of a conventional optimization algorithm (LSQ-nonlin) and particle swarm optimization (PSO) algorithm.

551 citations

Journal ArticleDOI
TL;DR: Differential evolution (DE) algorithm is a new heuristic approach mainly having three advantages; finding the true global minimum of a multimodal search space regardless of the initial parameter values, fast convergence, and using a few control parameters.
Abstract: Any digital signal processing algorithm or processor can be reasonably described as a digital filter. The main advantage of an infinite impulse response (IIR) filter is that it can provide a much better performance than the finite impulse response (FIR) filter having the same number of coefficients. However, they might have a multimodal error surface. Differential evolution (DE) algorithm is a new heuristic approach mainly having three advantages; finding the true global minimum of a multimodal search space regardless of the initial parameter values, fast convergence, and using a few control parameters. In this work, DE algorithm has been applied to the design of digital IIR filters and its performance has been compared to that of a genetic algorithm.

208 citations

Journal ArticleDOI
TL;DR: The IIR system identification task is formulated as an optimization problem and a recently introduced cat swarm optimization (CSO) is used to develop a new population based learning rule for the model.
Abstract: Conventional derivative based learning rule poses stability problem when used in adaptive identification of infinite impulse response (IIR) systems. In addition the performance of these methods substantially deteriorates when reduced order adaptive models are used for such identification. In this paper the IIR system identification task is formulated as an optimization problem and a recently introduced cat swarm optimization (CSO) is used to develop a new population based learning rule for the model. Both actual and reduced order identification of few benchmarked IIR plants is carried out through simulation study. The results demonstrate superior identification performance of the new method compared to that achieved by genetic algorithm (GA) and particle swarm optimization (PSO) based identification.

197 citations

Journal ArticleDOI
TL;DR: Three applications, maximum likelihood (ML) joint channel and data estimation, infinite-impulse-response (IIR) filter design and evaluation of minimum symbol-error-rate (MSER) decision feedback equalizer (DFE) are used to demonstrate the effectiveness of the ASA.

142 citations

Journal ArticleDOI
TL;DR: A new method based on the ant colony optimisation algorithm with global optimisation ability is proposed for digital IIR filter design, and simulation results show that the proposed approach is accurate and has a fast convergence rate.

135 citations