Kernelized Set-Membership Approach to Nonlinear Adaptive Filtering

Amaresh V. Malipatil, Yih-Fang Huang, Srinivas Andra, Kristin P. Bennett

Abstract

In linear filtering, the set-membership normalized least mean squares (SM-NLMS) algorithm has been shown to exhibit desirable features of selective update and optimized variable step size. In this paper, a kernel approach to the SM-NLMS algorithm is presented that makes it feasible to address nonlinear problems. An online greedy approximation technique to achieve sparsity is discussed. Simulation results are presented for two practical problems: equalization of nonlinear inter-symbol interference (ISI) channels and predistortion of nonlinear high power amplifiers (HPA).
BibTeX
@inproceedings{malipatil2005kernelized,
  author = {Amaresh V. Malipatil and Yih-Fang Huang and Srinivas Andra and Kristin P. Bennett},
  title = {{Kernelized Set-Membership Approach to Nonlinear Adaptive Filtering}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2005},
  doi = {10.1109/icassp.2005.1415967},
}

Loading related content...

Figure