A new coding scheme for the noisy-channel Slepian-Wolf problem: separate design and joint decoding
A new coding scheme for the noisy-channel Slepian-Wolf problem: separate design and joint decoding
复制标题
噪声信道Slepian-Wolf问题的一种新编码方案：单独设计和联合解码
DOI：
10.1109/glocom.2004.1377911
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Jing Li
中科院分区：
文献类型：
--
作者：
R. Hu;R. Viswanathan;Jing Li
提出了一种利用串行级联码来解决噪声信道中的Slepian-Wolf问题的新方案。外部低密度奇偶校验码用于执行分布式信源编码，而内部卷积码为压缩数据增加差错保护能力。执行软迭代联合信源-信道解码器，其中解码器边信息被提供给子外部解码器而不是子内解码器。由于压缩比(外码)和差错保护功率(内码)的分离精化使得设计简单，性能可控，并且联合迭代译码最大限度地利用了串行级联结构的能力，因此该方案具有很大的吸引力。仿真表明，特别是在低信噪比的情况下，联合译码增益是令人鼓舞的。
A new scheme for solving the Slepian-Wolf problem over noisy channels using serially concatenated codes is proposed. An outer low density parity check code is used to perform distributed source coding, and an inner convolutional code adds error protecting capability to the compressed data. A soft iterative joint source-channel decoder is performed, where the decoder side information is provided to the sub outer decoder instead of the sub inner decoder. The scheme is attractive since separate refining of compression rate (outer code) and error protection power (inner code) makes the design easy and the performance controllable, and joint iterative decoding exploits the power of the serial concatenated structure as much as possible. Simulations reveal encouraging joint decoding gain especially at low signal-to-noise ratios.