Design and Analysis of Successive Decoding with Finite Levels for the Markov Channel

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Accepted for publication at IEEE transaction on Information Theory

Scientific paper

This paper proposes a practical successive decoding scheme with finite levels for the finite-state Markov channels where there is no a priori state information at the transmitter or the receiver. The design employs either a random interleaver or a deterministic interleaver with an irregular pattern and an optional iterative estimation and decoding procedure within each level. The interleaver design criteria may be the achievable rate or the extrinsic information transfer (EXIT) chart, depending on the receiver type. For random interleavers, the optimization problem is solved efficiently using a pilot-utility function, while for deterministic interleavers, a good construction is given using empirical rules. Simulation results demonstrate that the new successive decoding scheme combined with irregular low-density parity-check codes can approach the identically and uniformly distributed (i.u.d.) input capacity on the Markov-fading channel using only a few levels.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Design and Analysis of Successive Decoding with Finite Levels for the Markov Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Design and Analysis of Successive Decoding with Finite Levels for the Markov Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Design and Analysis of Successive Decoding with Finite Levels for the Markov Channel will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-450375

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.