...
首页> 外文期刊>IEEE communications letters >On Finite Alphabet Iterative Decoding of LDPC Codes With High-Order Modulation
【24h】

On Finite Alphabet Iterative Decoding of LDPC Codes With High-Order Modulation

机译:具有高阶调制的LDPC码的有限字母迭代解码

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

摘要

This work aims to apply the mutual information-maximizing finite alphabet iterative decoding (MIM-FAID) method to decode low-density parity-check (LDPC) codes with high-order modulation. To this end, we propose an efficient model, through which our task becomes to design an MIM quantizer for a binary-input continuous memoryless channel (CMC) with log-likelihood ratios (LLRs) as the output. We then properly discretize the LLRs to convert the CMC to a discrete memoryless channel (DMC) such that we can obtain the MIM quantizer by using dynamic programming. Both theoretical analysis and simulation results verify the effectiveness of our proposed method.
机译:这项工作旨在应用互信息最大化的有限字母迭代解码(MIM-FAID)方法对具有高阶调制的低密度奇偶校验(LDPC)码进行解码。为此,我们提出了一个有效的模型,通过该模型,我们的任务变成为对数输入连续无记忆通道(CMC)设计MIM量化器,并以对数似然比(LLR)作为输出。然后,我们适当地离散化LLR,以将CMC转换为离散的无记忆通道(DMC),以便我们可以通过使用动态编程来获得MIM量化器。理论分析和仿真结果均证明了该方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号