(2007)
*Convergence and steady-state analysis of the normalized least mean fourth algorithm.*
Digital Signal Processing, 17 (1).
pp. 17-31.

## Abstract

The normalized least mean-fourth (NLMF) algorithm is presented in this work and shown to have potentially faster convergence. Unlike the LMF algorithm, the convergence behavior of the NLMF algorithm is independent of the input data correlation statistics. Sufficient conditions for the NLMF algorithm convergence in the mean are obtained and an analysis of the steady-state performance is carried out with a new approach. The latter uses the concept of feedback and bypasses the need for working directly with the weight error covariance matrix. Simulation results obtained in a system identification scenario confirms the theoretical predictions on performance of the NLMF algorithm.

Item Type: | Article |
---|---|

Subjects: | Electrical |

Department: | College of Engineering and Physics > Electrical Engineering |

Depositing User: | ANKAR (g200603940) (g200603940) |

Date Deposited: | 12 May 2008 07:59 |

Last Modified: | 01 Nov 2019 13:26 |

URI: | http://eprints.kfupm.edu.sa/id/eprint/1269 |