DocumentCode
2270713
Title
Performance analysis of algebraic soft decoding of reed-solomon codes over binary symmetric and erasure channels
Author
Jiang, Jing ; Narayanan, Krishna R.
Author_Institution
Dept. of EE, Texas A&M Univ., College Station, TX
fYear
2005
fDate
4-9 Sept. 2005
Firstpage
1186
Lastpage
1190
Abstract
In this paper, we characterize the decoding region of algebraic soft decoding (ASD) [4] of Reed-Solomon (RS) codes over erasure channels and binary symmetric channel (BSC). Optimal multiplicity assignment strategies (MAS) are investigated and tight bounds are derived to show the ASD can significantly outperform conventional Berlekamp Massey (BM) decoding over these channels for a wide code rate range. The analysis technique can also be extended to other channel models, e.g., RS coded modulation over erasure channels
Keywords
Reed-Solomon codes; channel coding; decoding; modulation coding; Berlekamp Massey decoding; Reed-Solomon codes; algebraic soft decoding; binary symmetric channel; erasure channels; optimal multiplicity assignment strategies; Costs; Decoding; Error correction codes; H infinity control; Modulation coding; Performance analysis; Performance gain; Power system modeling; Reed-Solomon codes; Variable speed drives;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location
Adelaide, SA
Print_ISBN
0-7803-9151-9
Type
conf
DOI
10.1109/ISIT.2005.1523529
Filename
1523529
Link To Document