DocumentCode
1161343
Title
Decoding of low-density parity-check codes over finite-state binary Markov channels
Author
Garcia-Frias, Javier
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Delaware, Newark, DE, USA
Volume
52
Issue
11
fYear
2004
Firstpage
1840
Lastpage
1843
Abstract
We propose a modified algorithm for decoding of low-density parity-check codes over finite-state binary Markov channels. The proposed approach clearly outperforms systems in which the channel statistics are not exploited in the decoding, even when the channel parameters are not known a priori at the decoder.
Keywords
Markov processes; channel coding; decoding; parity check codes; statistics; channel statistics; finite-state binary Markov channel; low-density parity-check codes; Channel capacity; Communication systems; Digital communication; Hidden Markov models; Maximum likelihood decoding; Memoryless systems; Parity check codes; Probability; State estimation; Statistics; 211;Elliot channels; 211;Welch algorithm; 65; Baum&#; Gilbert&#; LDPC; codes; finite-state binary Markov channels; low-density parity-check;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2004.836568
Filename
1356191
Link To Document