DocumentCode
2938452
Title
Performance and Maximum-Likelihood Bounds for Reed-Solomon Codes on Partial-Response Channels
Author
Todd, R.M. ; Cruz, J.R.
Author_Institution
Univ. of Oklahoma, Norman
fYear
2006
fDate
8-12 May 2006
Firstpage
295
Lastpage
295
Abstract
The authors presents computation of ML bounds for RS decoding performance for realistic channels and codes. The ABP gains a fraction of a dB over HD decoding, and the idealized ABP results suggest that further refinement of the bit-selection algorithm might provide a fraction of a dB gain. However, this is not enough to get within a dB or so of the ML bound. To achieve this, some algorithm other than ABP seems necessary.
Keywords
Reed-Solomon codes; belief networks; maximum likelihood decoding; Reed-Solomon codes; adaptive belief propagation; bit-selection algorithm; maximum-likelihood bounds; partial response channels; realistic channels; realistic codes; Belief propagation; Computational modeling; Error correction codes; Iterative decoding; Linear code; Magnetic recording; Maximum likelihood decoding; Parity check codes; Reed-Solomon codes; Sparse matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Magnetics Conference, 2006. INTERMAG 2006. IEEE International
Conference_Location
San Diego, CA
Print_ISBN
1-4244-1479-2
Type
conf
DOI
10.1109/INTMAG.2006.375877
Filename
4261728
Link To Document