By Topic

Prediction of Rayleigh fading channels based on hidden Markov modeling of sequential channel decoding complexity

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)
D. W. Pan ; Dept. of Electr. & Comput. Eng., Alabama Univ., Huntsville, AL, USA ; Seong-Moo Yoo ; R. Adhami

In fading channels that exhibit memory, errors tend to occur in blocks. Knowledge of the channel condition of the previous block can be used to predict the future channel quality and improve the performance of the channel decoding system. Sequential decoding algorithms are known to have the advantage of allowing for variable decoding complexity with changing channel conditions. On the other hand, the changing complexity is also an indicator of channel conditions. We employ the complexity of Fano (1963) sequential decoders to model the Rayleigh fading channels. Based on hidden Markov models, We propose a fast sliding window prediction approach. We empirically determine the relations between the prediction performance and the number of distinctive symbols in the model.

Published in:

System Theory, 2003. Proceedings of the 35th Southeastern Symposium on

Date of Conference:

16-18 March 2003