Low Complexity Soft Decision Decoding Algorithms for Reed-Solomon Codes
Summary :
We propose a method to represent non-binary error patterns for Reed-Solomon codes using a trellis. All error patterns are sorted according to their Euclidean distances from the received vector. The decoder searches through the trellis until it finds a codeword. This results in a soft-decision maximum likelihood algorithm with lower complexity compared to other known MLD methods. The proposed MLD algorithm is subsequently modified to further simplify complexity, reflecting in a slight reduction in the error performance.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E84-B No.3 pp.392-399
- Publication Date
- 2001/03/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Innovative Mobile Communication Technologies at the Dawn of the 21st Century)
- Category
Authors
KOVIKeyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Branka VUCETIC, Vishakan PONAMPALAM, Jelena VUKOVI, "Low Complexity Soft Decision Decoding Algorithms for Reed-Solomon Codes" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 3, pp. 392-399, March 2001, doi: .
Abstract: We propose a method to represent non-binary error patterns for Reed-Solomon codes using a trellis. All error patterns are sorted according to their Euclidean distances from the received vector. The decoder searches through the trellis until it finds a codeword. This results in a soft-decision maximum likelihood algorithm with lower complexity compared to other known MLD methods. The proposed MLD algorithm is subsequently modified to further simplify complexity, reflecting in a slight reduction in the error performance.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_3_392/_p
Copy
@ARTICLE{e84-b_3_392,
author={Branka VUCETIC, Vishakan PONAMPALAM, Jelena VUKOVI, },
journal={IEICE TRANSACTIONS on Communications},
title={Low Complexity Soft Decision Decoding Algorithms for Reed-Solomon Codes},
year={2001},
volume={E84-B},
number={3},
pages={392-399},
abstract={We propose a method to represent non-binary error patterns for Reed-Solomon codes using a trellis. All error patterns are sorted according to their Euclidean distances from the received vector. The decoder searches through the trellis until it finds a codeword. This results in a soft-decision maximum likelihood algorithm with lower complexity compared to other known MLD methods. The proposed MLD algorithm is subsequently modified to further simplify complexity, reflecting in a slight reduction in the error performance.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Low Complexity Soft Decision Decoding Algorithms for Reed-Solomon Codes
T2 - IEICE TRANSACTIONS on Communications
SP - 392
EP - 399
AU - Branka VUCETIC
AU - Vishakan PONAMPALAM
AU - Jelena VUKOVI
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2001
AB - We propose a method to represent non-binary error patterns for Reed-Solomon codes using a trellis. All error patterns are sorted according to their Euclidean distances from the received vector. The decoder searches through the trellis until it finds a codeword. This results in a soft-decision maximum likelihood algorithm with lower complexity compared to other known MLD methods. The proposed MLD algorithm is subsequently modified to further simplify complexity, reflecting in a slight reduction in the error performance.
ER -
English
