【24h】

On the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding

机译:基于符号的迭代解码的退出特征计算

获取原文

摘要

In this contribution we propose an efficient method for computing symbol-based extrinsic information transfer (EXIT) charts, which are useful for estimating the convergence properties of non-binary iterative decoding. A standard solution is to apply a priori reliability information to the a posteriori probability (APP) constituent decoder and compute the resultant average extrinsic information at the decoder's output using multidimensional histogram measurements. However, the employment of this technique is only feasible for a low number of bits per symbol, since the complexity of this approach increases exponentially with the number of bits per symbol. We demonstrate that by averaging over a function of the extrinsic APPs for a long block the extrinsic information can be estimated at a low complexity. In contrast to using histogram measurements, the proposed technique allows us to generate EXIT charts even for a high number of bits per symbol. Our design examples using either a non-binary serial concatenated code or turbo trellis-coded modulation demonstrate the attractive benefits of the proposed approach.
机译:在这一贡献中,我们提出了一种用于计算基于符号的外在信息传输(退出)图表的有效方法,其可用于估计非二进制迭代解码的收敛性。标准解决方案是将先验的可靠性信息应用于后验概率(APP)构成解码器,并使用多维直方图测量来计算解码器输出的结果平均外在信息。然而,这种技术的就业仅适用于每个符号的少量比特,因为这种方法的复杂性随着每个符号的比特数而呈指数级增长。我们证明,通过对长块的外部应用程序的函数进行平均来说,可以以低复杂度估计外部信息。与使用直方图测量相比,所提出的技术允许我们即使对于每个符号的大量比特,我们也可以生成退出图表。我们的设计示例使用非二进制串行连接代码或Turbo Grellis编码调制显示了所提出的方法的吸引力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号