Back to search

NJIT

Nonlinear variants of the least mean square (LMS) algorithm

Abstract

dc:description.abstract

<p>Adaptive systems using the LMS algorithm or its variants usually require bilinear correlation multipliers with high dynamic range and large bandwidth. The class of LMS-type algorithms utilizing zero-memory limiters (on one or both correlation multiplier inputs) to reduce dynamic range are examined. The correlator limiters may be included to simplify the hardware implementation or may arise due to limited dynamic range of the loop components. The application of a theorem due to Price provides a technique for simplifying the analysis, which otherwise might be extremely difficult. The analysis provides closed-form expressions for the mean weight convergence behavior, permitting examination of the convergence bounds and performance for this class of algorithms.</p>

Degree

thesis:*
Name thesis:degree_name
Master of Science in Electrical Engineering - (M.S.)
Discipline thesis:degree_discipline
Electrical Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Van Saders, John George
Contributors dc:contributor
  • Yeheskel Bar-Ness
  • Chung H. Lu

Subjects

dc:subject × 3

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/2939

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Van Saders, John George. Nonlinear variants of the least mean square (LMS) algorithm. https://digitalcommons.njit.edu/theses/2939