Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10403559 | IFAC Proceedings Volumes | 2005 | 6 Pages |
Abstract
Although partial response (PR) equalization employing the linearly constrained least-mean-square (LCLMS) algorithm is widely used in recording channels, there is no literature on its convergence analysis. Existing analyses of the LMS algorithm assume that the input signals are jointly Gaussian, which is an invalid assumption for PR equalization with binary input. In this paper, we present a convergence analysis of the LCLMS algorithm, without the Gaussian assumption. An approximate expression is derived for the misadjustment. It is shown that the step-size range required to guarantee stability is larger for binary data compared to Gaussian data.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Lim Sze Chieh, George Mathew,