By Topic

Performance Analysis of Block Codes in Hidden Markov Channels

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)
Chang-ming Lee ; Nat. Chiao Tung Univ., Hsinchu ; Yu. T. Su ; Li-der Jeng

Most investigations on the effect of channel memory on the performance of block codes use a two-state Gilbert-Elliott (GE) model to describe the channel behavior. As there are circumstances that the channel of concern can not be properly described by the GE model, there are some recent works on coded performance that characterize the channel behavior by a general finite-state Markov chain. This letter presents a new efficient systematic approach to analyze the performance of block codes in such a hidden Markov channel (HMC). An application example is given to predict codeword error probability performance of an RS-coded system in a channel with memory. Numerical results are also provided to validate our analytic results.

Published in:

IEEE Transactions on Communications  (Volume:56 ,  Issue: 1 )