Title :
Designing good LDPC codes for markov-modulated channels
Author :
Eckford, Andrew W. ; Kschischang, Frank R. ; Pasupathy, Subbarayan
Author_Institution :
Dept. of Electr. Eng., Notre Dame Univ., IN
Abstract :
We present a reduced-complexity approximate density evolution scheme that is particularly suitable for Markov-modulated channels, based on the semiGaussian approximation. We propose a design algorithm whose complexity is comparable to the memoryless case, assuming unlimited precomputation is allowed. We also present degree sequences representing some of the best known codes in the GE channel which were designed using this technique. This design tool can be easily extended to more complicated Markov-modulated channels
Keywords :
hidden Markov models; parity check codes; telecommunication channels; GE channel; Gilbert-Elliott channel; LDPC codes; Markov-modulated channel; low density parity check codes; reduced-complexity approximate density evolution scheme; semiGaussian approximation; Algorithm design and analysis; Channel estimation; Educational institutions; Hidden Markov models; Iterative decoding; Memoryless systems; Parity check codes; Strontium; Transfer functions;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365410
