Abstract
This paper proposes an iterative soft-decision decoding algorithm for Reed-Solomon (RS) codes. The proposed decoding algorithm combines the concepts of adapting the parity-check matrix and informed dynamic scheduling decoding. The parity-check matrix is re-arranged before each iteration, where the systematic part is mapped to the least reliable bits, consequently reducing their influence on the other bits. Using dynamic scheduling, the more important decoding messages are updated to these least reliable bits, meaning that the majority of the error bits with low reliability can be corrected. When the proposed integrated decoding is applied to (255, 239) RS code, the difference between its frame error rate performance (FER) and the maximum-likelihood (ML) bound can be reduced to 0.8 dB, and a gain of about 0.1 dB is achieved compared to all the previously recorded soft-decision decoding for RS codes.
Original language | English |
---|---|
Title of host publication | 2017 IEEE International Symposium on Information Theory, ISIT 2017 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 2775-2779 |
Number of pages | 5 |
ISBN (Electronic) | 9781509040964 |
DOIs | |
State | Published - 09 08 2017 |
Event | 2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: 25 06 2017 → 30 06 2017 |
Publication series
Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|
ISSN (Print) | 2157-8095 |
Conference
Conference | 2017 IEEE International Symposium on Information Theory, ISIT 2017 |
---|---|
Country/Territory | Germany |
City | Aachen |
Period | 25/06/17 → 30/06/17 |
Bibliographical note
Publisher Copyright:© 2017 IEEE.
Keywords
- Belief propagation
- Error-control codes
- Informed-dynamic scheduling
- Reed-Solomon codes
- Soft-decision decoding