首页> 外文期刊>IEEE Transactions on Information Theory >Iterative joint channel decoding of correlated sources employing serially concatenated convolutional codes
【24h】

Iterative joint channel decoding of correlated sources employing serially concatenated convolutional codes

机译:使用串行级联卷积码对相关源进行迭代联合信道解码

获取原文
获取原文并翻译 | 示例
           

摘要

This correspondence looks at the problem of joint decoding of serially concatenated convolutional codes (SCCCs) used for channel coding of multiple correlated sources. We assume a simple model whereby two correlated sources transmit SCCC encoded data to a single destination receiver. We do not assume the existence of, nor do we use channel side information at the receiver. In particular, we present a novel iterative joint channel decoding algorithm for correlated sources by using the empirical cross-correlation measurements at successive decoding iterations to provide extrinsic information to the outer codes of the SCCC configuration. Two levels of soft metric iterative decoding are used at the receiver: 1) iterative maximum a posteriori probability (MAP) decoding is used for efficient decoding of individual SCCC codes (local iterations) and 2) iterative extrinsic information feedback generated from the estimates of the empirical cross correlation in partial decoding steps is used to pass soft information to the outer decoders of the global joint SCCC decoder (global iterations). We provide analytical results followed by simulation studies confirming the robustness of the cross-correlation estimates to channel-induced errors, justifying the use of such estimates in iterative decoding. Experimental results suggest that relatively few global iterations (two to five) during which multiple local iterations are conducted are sufficient to reap significant gains using this approach specially when the sources are highly correlated.
机译:该对应关系着眼于用于多个相关源的信道编码的串行级联卷积码(SCCC)的联合解码问题。我们假设一个简单的模型,其中两个相关源将SCCC编码的数据发送到单个目标接收器。我们不假设接收器存在,也不使用信道侧信息。特别是,我们通过在连续解码迭代中使用经验互相关测量为SCCC配置的外部代码提供外部信息,从而提出了一种针对相关源的新颖的迭代联合信道解码算法。接收机使用两个级别的软度量迭代解码:1)迭代最大后验概率(MAP)解码用于有效解码单个SCCC代码(局部迭代); 2)从迭代估计得出的迭代外部信息反馈部分解码步骤中的经验互相关用于将软信息传递到全局联合SCCC解码器的外部解码器(全局迭代)。我们提供分析结果,然后进行仿真研究,以确认互相关估计对信道导致的错误的鲁棒性,从而证明在迭代解码中使用此类估计是合理的。实验结果表明,在进行多次局部迭代的过程中,相对较少的全局迭代(二至五次)足以使用此方法获得可观的收益,特别是在源高度相关时。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号