.png){kind=icon}
返回
Reliability-based forward recursive algorithms for algebraic soft-decision decoding of Reed-Solomon codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2007.900539.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
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总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
Use of Raman spectroscopy to determine the kinetics of chemical transformation in yogurt production
PREAI
分享收藏
查看更多内容