Information shortening for joint source-channel coding schemes based on low-density parity-check codes
Information shortening for joint source-channel coding schemes based on low-density parity-check codes
复制标题
DOI：
10.1109/istc.2014.6955098
复制
发表时间：
2014-11
期刊：
影响因子：
--
通讯作者：
H. B. Neto;W. Henkel
中科院分区：
文献类型：
--
作者：
H. B. Neto;W. Henkel
我们提出了一种基于低密度平价检查代码的联合源通道编码方案的简单缩短算法。由于有限的效果，当针对低渗透二进制对称源和AWGN通道上的传输优化时，此类系统会呈现高误差地板。为了减轻这种影响，我们建议通过插入无限可靠性变量节点来降低压缩速率，该节点的长度等于用作源压缩机的代码的长度。仿真结果表明，这种策略能够有效地对压缩率进行略微降低，以增强性能。
We propose a simple shortening algorithm for joint source-channel coding schemes based on low-density parity-check codes. Due to finite-length effects, such systems present high error floors when optimised for low-entropy binary symmetric sources and transmission over an AWGN channel. To mitigate such effects, we propose the reduction of the compression rate by inserting infinite reliability variable nodes which form cycles with length equal to the girth of the code used as source compressor. Simulation results show that such a strategy is able to efficiently trade a slight reduction of the compression rate for a significant performance enhancement.