Design and Analysis of Successive Decoding with Finite Levels for the Markov Channel (0905.0541v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.