Gain Allocation in Proportionate-Type NLMS Algorithms for Fast Decay of Output Error at All Times

Abstract

In this paper, we propose three new proportionate-type NLMS algorithms: the water filling algorithm, the feasible water filling algorithm, and the adaptive -law proportionate NLMS (MPNLMS) algorithm. The water filling algorithm attempts to choose the optimal gains at each time step. The optimal gains are found by minimizing the mean square error (MSE) at each time with respect to the gains, given the previous mean square weight deviations. While this algorithm offers superior convergence times, it is not feasible. The second algorithm is a feasible version of the water filling algorithm. The adaptive MPNLMS (AMPNLMS) algorithm is a modification of the MPNLMS algorithm. In the MPNLMS algorithm, the parameter of the -law compression is constant. In the AMPNLMS algorithm the parameter is allowed to vary with time. This modification allows the algorithm more flexibility when attempting to minimize the MSE. Compared with several feasible algorithms, the AMPNLMS algorithm has the fastest MSE decay for almost all times.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 2009
Accession Number
ADA553850

Entities

People

  • Kevin Wagner
  • Milos I. Doroslovacki

Organizations

  • United States Naval Research Laboratory

Tags

Communities of Interest

  • Energy and Power Technologies
  • Ground and Sea Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Coefficients
  • Convergence
  • Engineering
  • Equations
  • Gaussian Noise
  • Information Operations
  • Iterations
  • Learning
  • Mathematics
  • Military Research
  • Monte Carlo Method
  • Noise
  • Numbers
  • Signal Processing
  • Simulations

Fields of Study

  • Engineering

Readers

  • Aerospace Engineering
  • Approximation Theory.
  • Operations Research