Complexity-constrained LS estimation for sparse systems

Author

Kocic, Marko ; Brady, David

Author_Institution

Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA

fYear

1994

fDate

27 Jun-1 Jul 1994

Firstpage

116

Abstract

In an increasing number of applications the complexity of so-called fast RLS algorithms is prohibitive for real-time RLS estimation. One notable example is the adaptive equalization problem for intersymbol interference channels, where the number of equalizer taps grows linearly with the data rate. Due to the substantial memory in some ISI channels (for example the shallow-water acoustic telemetry channel) the uncoded data rate of real-time telemetry is limited not by the channel distortion or background noise, but by the complexity of the tap update algorithms

Keywords

adaptive equalisers; adaptive signal processing; intersymbol interference; least squares approximations; recursive estimation; telecommunication channels; telemetry; underwater sound; ISI channels; adaptive equalization; background noise; channel distortion; complexity-constrained LS estimation; equalizer taps; fast RLS algorithms; intersymbol interference channels; real-time telemetry; shallow-water acoustic telemetry channel; sparse systems; tap update algorithms; uncoded data rate; Acoustic distortion; Acoustic scattering; Adaptive equalizers; Application software; Background noise; Computational complexity; Error correction; Intersymbol interference; Resonance light scattering; Telemetry;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Conference_Location

Trondheim

Print_ISBN

0-7803-2015-8

Type

conf

DOI

10.1109/ISIT.1994.394872

Filename

394872