DocumentCode
1057585
Title
An Efficient Exact-Least-Squares Fractionally Spaced Equalizer Using Intersymbol Interpolation
Author
Cioffi, John M. ; Kailath, Thomas
Author_Institution
IBM Research,San Jose, CA
Volume
2
Issue
5
fYear
1984
fDate
9/1/1984 12:00:00 AM
Firstpage
743
Lastpage
756
Abstract
An efficient exact-least-squares procedure is presented specifically for the adaptive adjustment of a fractionally spaced equalizer (FSE). The intersymbol interpolation of the desired training sequence is used by this new procedure to reduce computational requirements and to improve convergence. For a
FSE (
being the data symbol rate and
the number of taps that span one symbol period), a factor of
improvement in "start-up" time is attained by this new procedure in comparison to the multichannel FSE versions of the "fast-Kalman" leastsquares algorithms of Falconer and Ljung [7] and in comparison to the Ling-Proakis [10] simplification for multichannel versions of the "fastlattice" least-squares algorithms of Satorius and Pack [8 ]Substantial reductions in computational and storage requirements are also achieved by the new procedure through the elimination of the inversion of
matrices in these multichannel versions. Additional reductions in computational requirements are achieved by a special exact-least-squares modification for the passband "Nyquist" FSE structure of Mueller and Werner [6]. The procedure is shown to be most efficiently implemented using a transversal-filter realization of the fast exact-least-squares algorithmns. The per-iteration and per-unit-time computational requirements of the new procedure (
FSE) are found to be approximately the same as those of the more conventional, but much slower converging, (
) tap-leakage stochastic-gradient algorithms of Gitlin, Meadors, and Weinstein [15]. Finally, simulations are conducted to verify the operation of the new procedure for both the training and decision-directed modes of operation.
FSE (
being the data symbol rate and
the number of taps that span one symbol period), a factor of
improvement in "start-up" time is attained by this new procedure in comparison to the multichannel FSE versions of the "fast-Kalman" leastsquares algorithms of Falconer and Ljung [7] and in comparison to the Ling-Proakis [10] simplification for multichannel versions of the "fastlattice" least-squares algorithms of Satorius and Pack [8 ]Substantial reductions in computational and storage requirements are also achieved by the new procedure through the elimination of the inversion of
matrices in these multichannel versions. Additional reductions in computational requirements are achieved by a special exact-least-squares modification for the passband "Nyquist" FSE structure of Mueller and Werner [6]. The procedure is shown to be most efficiently implemented using a transversal-filter realization of the fast exact-least-squares algorithmns. The per-iteration and per-unit-time computational requirements of the new procedure (
FSE) are found to be approximately the same as those of the more conventional, but much slower converging, (
) tap-leakage stochastic-gradient algorithms of Gitlin, Meadors, and Weinstein [15]. Finally, simulations are conducted to verify the operation of the new procedure for both the training and decision-directed modes of operation.Keywords
Data communications; Equalizers; Computational modeling; Convergence; Data communication; Dispersion; Equalizers; Information systems; Interpolation; Laboratories; Passband; Sampling methods;
fLanguage
English
Journal_Title
Selected Areas in Communications, IEEE Journal on
Publisher
ieee
ISSN
0733-8716
Type
jour
DOI
10.1109/JSAC.1984.1146109
Filename
1146109
Link To Document