On the Average Complexity of Reed–Solomon List Decoders
On the Average Complexity of Reed–Solomon List Decoders
复制标题
DOI：
10.1109/tit.2012.2235522
复制
发表时间：
2013-04
影响因子：
2.5
通讯作者：
Yuval Cassuto;Jehoshua Bruck;R. McEliece
中科院分区：
文献类型：
--
作者：
Yuval Cassuto;Jehoshua Bruck;R. McEliece
在代数列表中插入接收的单词所需的单个单词数量，用于芦苇 - 固体代码，这取决于瞬时通道误差，不仅取决于解码器设计参数。这一事实的含义是，解码器应该能够表现出低重量错误的较低解码复杂性，因此，享受更好的平均案例解码复杂性和更高的解码吞吐量。在分析方面，本文研究了插值成本对硬性和软否决解码器中瞬时错误的依赖性。在算法方面，它基于最新的插值算法提供了有效的插值算法，该算法的运行时间减少了，以减少插值成本。
The number of monomials required to interpolate a received word in an algebraic list decoder for Reed-Solomon codes depends on the instantaneous channel error, and not only on the decoder design parameters. The implications of this fact are that the decoder should be able to exhibit lower decoding complexity for low-weight errors and, consequently, enjoy a better average-case decoding complexity and a higher decoding throughput. On the analytical side, this paper studies the dependence of interpolation costs on instantaneous errors, in both hard- and soft-decision decoders. On the algorithmic side, it provides an efficient interpolation algorithm, based on the state-of-the-art interpolation algorithm, that enjoys reduced running times for reduced interpolation costs.