首页> 外文会议>IEEE International Symposium on Turbo Codes Iterative Information Processing >Collective Encoding and Iterative Soft-Decision Decoding of Cyclic Codes of Prime Lengths in Galois-Fourier Transform Domain
【24h】

Collective Encoding and Iterative Soft-Decision Decoding of Cyclic Codes of Prime Lengths in Galois-Fourier Transform Domain

机译:Galois-Fourier变换域中素数长度循环码的集体编码和迭代软判决解码

获取原文

摘要

This paper presents a novel coding scheme for collective encoding and collective iterative soft-decision decoding of cyclic codes of prime lengths in Galois-Fourier transform (GFT) domain. The encoding of a cyclic code is performed on a collection of codewords which are mapped through composition, Hadamard permutations, and GFT into a codeword in an LDPC code with a binary parity-check matrix for transmission. Using this matrix, binary iterative decoding is applied to jointly decode a collection of codewords in the cyclic code. The joint-decoding allows reliability information sharing among the received vectors corresponding to the transmitted codewords in the collection during the iterative decoding process. This joint-decoding and information sharing can achieve a joint-decoding gain over the maximum likelihood decoding of individual codewords. The binary iterative decoding can be performed efficiently and reduces the decoding complexity significantly.
机译:本文提出了一种新的编码方案,用于在Galois-Fourier变换(GFT)域中对素数长度的循环码进行集体编码和集体迭代软判决解码。循环码的编码是在一组码字上执行的,这些码字通过合成,Hadamard置换和GFT映射到具有二进制奇偶校验矩阵以进行传输的LDPC码中的码字中。使用该矩阵,二进制迭代解码被应用于联合解码循环码中的码字集合。联合解码允许在迭代解码过程中在与集合中的传输码字相对应的接收向量之间共享可靠性信息。这种联合解码和信息共享可以在单个码字的最大似然解码上实现联合解码增益。可以有效地执行二进制迭代解码,并显着降低解码复杂度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号