logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Reliability-based forward recursive algorithms for algebraic soft-decision decoding of Reed-Solomon codes

delete2007-07-01
delete7
PRE
AI
H
Haitao Xia *
J
J.R. Cruz
DOI：10.1109/TCOMM.2007.900539delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We propose efficient forward recursive algorithms for algebraic soft-decision list decoding of Reed-Solomon codes, which utilize channel reliability information, and outperform the Koetter-Vardy (KV) algorithm with lower decoding latency. We evaluate the performance of the proposed decoding algorithms on additive white Gaussian noise and partial response channels. Simulation results show that we can achieve better performance on a modified extended-extended partial response class 4 channel than on the best possible performance of the KV algorithm, as given by the asymptotic bound for high-rate codes.
Keywords:
generalized minimum distance algorithm
Guruswami-Sudan (GS) algorithm
Koetter-Vardy (KV) algorithm
list decoding
polynomial interpolation
Reed-Solomon (RS) codes
soft-decision decoding
Welch-Berlekamp algorithm
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Communications cover
IEEE Transactions on Communications
IF:
8.3
Papers:
1.2W
Citations:
3.6W

Organization

No organization information available