By Topic

Exact analysis of the tracking capability of time-varying channels: the finite alphabet inputs case

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
H. Besbes ; ESPT de Tunis, Tunisia ; M. Jaidane-Saidane ; J. Ezzine

The tracking performances of adaptive filters are, analyzed in a real context of digital transmission where the time variations of the channel's “impulse response” are modeled by a general L-order Markovian process and where the input data to be transmitted belongs to a finite alphabet. In this paper two approaches are developed to analyse the Least Mean Square algorithm (LMS), for large step size and correlated inputs. However, it is the tailored approach for the finite alphabet inputs that leads to the exact analysis of tracking performances. In this case, the analysis is made without any constraints or unrealistic hypothesis

Published in:

Electronics, Circuits and Systems, 1998 IEEE International Conference on  (Volume:1 )

Date of Conference:

1998