Iterative joint channel decoding of correlated sources

Iterative joint channel decoding of correlated sources
复制标题

相关源的迭代联合信道解码

DOI:
10.1109/twc.2006.04576
复制
发表时间:
2006
影响因子:
10.4
通讯作者:
M. Mondin
M. Mondin
中科院分区:
计算机科学1区
文献类型:
--
作者:
F. Daneshgaran;M. Laddomada;M. Mondin

文献摘要

参考文献

被引文献

相似文献

在本文中,我们利用多个信息源之间存在的潜在相关性,从用于数据保护的信道码中获得额外的编码增益。我们不假定存在,也不在接收方使用信道边信息。取而代之的是,在迭代联合软解码范例中的部分解码步骤中使用互相关的经验估计。实验结果表明,相对较少的迭代(2到4次)就足以获得显著的增益,特别是在信源高度相关的情况下。最后,在足够高的信噪比下,给出了该方法的性能分析界,与仿真结果吻合较好
In this article we exploit the potential correlation existing between multiple information sources to achieve additional coding gains from the channel codes used for data protection. We do not assume the existence of, nor do we use channel side-information at the receiver. Instead, empirical estimates of the cross-correlation are used in partial decoding steps in an iterative joint soft decoding paradigm. Experimental results suggest that relatively few iterations (2 to 4) are sufficient to reap significant gains using this approach specially when the sources are highly correlated. Finally, we provide analytical performance bounds of the proposed technique showing a close match with the simulation results at sufficiently high SNR
使用 Turbo 码对多个相关源进行迭代联合解码
DOI: --
发表时间: 2008
期刊:
影响因子: --
作者:
K. Kobayashi;T. Yamazato;M. Katayama
通讯作者: M. Katayama