Abstract
A new step-by-step decoding algorithm for decoding Reed-Solomon codes over GF(2'") is presented. Based on several properties of the syndrome matrices, the new step-by-step decoding algorithm can directly determine whether every received symbol is an error locator. The detection of error location is based only on the determinant of a v x v syndrome matrix, where v is the number of errors. When an error location is found, its corresponding error value can also be determined by performing a determinant division operation between two syndrome matrices. The new decoding algorithm can significantly reduce computation complexity and improve the decoding speed compared with the conventional step-by-step decoding algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 8-11 |
| Number of pages | 4 |
| Journal | IEE Proceedings: Communications |
| Volume | 147 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2000 Jan 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
Cite this
}
Step-by-step decoding algorithm for Reed-Solomon codes. / Chen, Tung-Chou; Wei, C. H.; Wei, S. W.
In: IEE Proceedings: Communications, Vol. 147, No. 1, 01.01.2000, p. 8-11.Research output: Contribution to journal › Article
TY - JOUR
T1 - Step-by-step decoding algorithm for Reed-Solomon codes
AU - Chen, Tung-Chou
AU - Wei, C. H.
AU - Wei, S. W.
PY - 2000/1/1
Y1 - 2000/1/1
N2 - A new step-by-step decoding algorithm for decoding Reed-Solomon codes over GF(2'") is presented. Based on several properties of the syndrome matrices, the new step-by-step decoding algorithm can directly determine whether every received symbol is an error locator. The detection of error location is based only on the determinant of a v x v syndrome matrix, where v is the number of errors. When an error location is found, its corresponding error value can also be determined by performing a determinant division operation between two syndrome matrices. The new decoding algorithm can significantly reduce computation complexity and improve the decoding speed compared with the conventional step-by-step decoding algorithm.
AB - A new step-by-step decoding algorithm for decoding Reed-Solomon codes over GF(2'") is presented. Based on several properties of the syndrome matrices, the new step-by-step decoding algorithm can directly determine whether every received symbol is an error locator. The detection of error location is based only on the determinant of a v x v syndrome matrix, where v is the number of errors. When an error location is found, its corresponding error value can also be determined by performing a determinant division operation between two syndrome matrices. The new decoding algorithm can significantly reduce computation complexity and improve the decoding speed compared with the conventional step-by-step decoding algorithm.
UR - http://www.scopus.com/inward/record.url?scp=0033907170&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0033907170&partnerID=8YFLogxK
U2 - 10.1049/ip-com:20000149
DO - 10.1049/ip-com:20000149
M3 - Article
VL - 147
SP - 8
EP - 11
JO - IEE Proceedings: Communications
JF - IEE Proceedings: Communications
SN - 1350-2425
IS - 1
ER -