article · 2009

Proportional-type NLMS algorithm with gain allocation providing maximum one-step conditional PDF for true weights

Cited by 3Abstract and details only

Abstract

In this paper, we present a proportionate-type normalized least mean square algorithm which operates by choosing adaptive gains at each time step in a manner designed to maximize the conditional probability that the next-step coefficient estimates reach their optimal values. We compare and show that the performance of the maximum conditional probability density one-step algorithm is superior to the normalized least mean square algorithm and the proportionate normalized least mean square algorithm. Additionally, we argue that the algorithm we present operates for any impulse response.

Cite this paper

APA 7

Wagner, K., & Doroslovački, M. (2009). Proportional-type NLMS algorithm with gain allocation providing maximum one-step conditional PDF for true weights. https://doi.org/10.1109/ciss.2009.5054691

MLA 9

Wagner, Kevin, and Miloš Doroslovački. “Proportional-type NLMS algorithm with gain allocation providing maximum one-step conditional PDF for true weights.” 2009, pp. 61–66, https://doi.org/10.1109/ciss.2009.5054691.

Chicago

Wagner, Kevin, and Miloš Doroslovački. 2009. “Proportional-type NLMS algorithm with gain allocation providing maximum one-step conditional PDF for true weights.” https://doi.org/10.1109/ciss.2009.5054691.

Harvard

Wagner, K. and Doroslovački, M. (2009) ‘Proportional-type NLMS algorithm with gain allocation providing maximum one-step conditional PDF for true weights’. Available at: https://doi.org/10.1109/ciss.2009.5054691.

BibTeX

@article{wagner2009proportional,
  title = {{Proportional-type NLMS algorithm with gain allocation providing maximum one-step conditional PDF for true weights}},
  author = {Wagner, Kevin and Doroslovački, Miloš},
  pages = {61--66},
  year = {2009},
  doi = {10.1109/ciss.2009.5054691}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.