Generation of Luby Transform Codes with Low Redundancy
Generation of Luby Transform Codes with Low Redundancy
复制标题
低冗余的Luby变换代码的生成
DOI：
10.1142/s0218127415500728
复制
发表时间：
2015
影响因子：
2.2
通讯作者：
Wei Zhang
中科院分区：
文献类型：
--
作者：
Yuli Zhao;Francis C. M. Lau;Zhiliang Zhu;Wei Zhang
给定相同数量的编码符号，当符号之间几乎没有冗余时，卢比变换（LT）解码器更有可能成功解码。本文利用 Tanner 图描述了 LT 码中出现的两种冗余。我们进一步提出了一种称为低冗余（LR）算法的编码算法，用于形成编码符号。该算法旨在减少LT码的冗余度，提高相同复杂度下的译码器性能。仿真结果表明，当使用所提出的 LR 算法对代码进行编码时，各种 LT 代码在平均开销因子和成功解码概率方面都有所提高。而且，编码复杂度保持不变。
Given the same number of encoded symbols, a Luby Transform (LT) decoder is more likely to decode successfully when there is little redundancy among the symbols. With the use of a Tanner graph, we describe two kinds of redundancy appearing in LT codes in this paper. We further propose an encoding algorithm called Low Redundancy (LR) algorithm used in the formation of the encoded symbols. The algorithm aims to reduce the redundancy of LT codes and to improve the decoder performance under the same complexity. Simulation results show various LT codes improve in terms of average overhead factor and probability of successful decoding when the codes are encoded using the proposed LR algorithm. Moreover, the encoding complexity remains unchanged.