Decoding generalized concatenated codes using Interleaved Reed-Solomon codes
Decoding generalized concatenated codes using Interleaved Reed-Solomon codes
复制标题
使用交错里德所罗门码解码广义级联码
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
V. Zyablov
中科院分区：
文献类型：
--
作者：
C. Senger;V. Sidorenko;M. Bossert;V. Zyablov
广义级联码是由多个外码组成的码结构，其码符号受内码保护。作为外部代码，我们假设最常用的 Reed-Solomon 代码；作为内部代码，我们假设一些线性块代码可以被解码到其最小距离的一半。解码高达通用级联码最小距离的一半通常是通过 Blokh-Zyablov-Dumer 算法实现的，该算法首先使用内部解码器来迭代解码以获得外部码字的估计，然后使用具有由一组预先计算的阈值确定的不同擦除次数的外部错误/擦除解码器。本文提出了 Blokh-Zyablov-Dumer 算法的修改版本，该算法利用了以下事实：多个平均最小距离为 d macr 的外部 Reed-Solomon 码可以分组为一个单一的交错 Reed-Solomon 码，该码可以在 d macr/2 之外进行解码。一方面，这允许跳过多次解码迭代，另一方面，可以显着降低每次解码迭代的复杂性，同时保持解码性能。
Generalized Concatenated codes are a code construction consisting of a number of outer codes whose code symbols are protected by an inner code. As outer codes, we assume the most frequently used Reed-Solomon codes; as inner code, we assume some linear block code which can be decoded up to half its minimum distance. Decoding up to half the minimum distance of Generalized Concatenated codes is classically achieved by the Blokh-Zyablov-Dumer algorithm, which iteratively decodes by first using the inner decoder to get an estimate of the outer code words and then using an outer error/erasure decoder with a varying number of erasures determined by a set of pre- calculated thresholds. In this paper, a modified version of the Blokh-Zyablov-Dumer algorithm is proposed, which exploits the fact that a number of outer Reed-Solomon codes with average minimum distance d macr can be grouped into one single Interleaved Reed-Solomon code which can be decoded beyond d macr/2. This allows to skip a number of decoding iterations on the one hand and to reduce the complexity of each decoding iteration significantly - while maintaining the decoding performance - on the other.