首页> 外文会议>Information Theory and Applications Workshop >A Novel Coding Scheme for Encoding and Iterative Soft-Decision Decoding of Binary BCH Codes of Prime Lengths
【24h】

A Novel Coding Scheme for Encoding and Iterative Soft-Decision Decoding of Binary BCH Codes of Prime Lengths

机译:素数二进制BCH码的编码和迭代软判决解码的新编码方案

获取原文

摘要

A novel coding scheme is presented for encoding and iterative soft-decision decoding of binary BCH codes of prime lengths. The encoding of such a BCH code is performed on a collection of codewords which are mapped through Galois Fourier transform into a codeword of a nonbinary low-density parity-check (LDPC) code which has a binary parity-check matrix for transmission. Using this matrix, a binary iterative soft-decision decoding algorithm based on belief-propagation is applied to jointly decode a collection of codewords of the BCH code. The joint-decoding allows information sharing among the received vectors corresponding to the codewords in the collection during the iterative decoding process. For decoding a BCH code of prime length, the proposed decoding scheme not only requires low decoding complexity, but also yields superior performance. The proposed decoding scheme can achieve a joint-decoding gain over the maximum likelihood decoding of individual codewords.
机译:提出了一种新颖的编码方案,用于对素数长度的二进制BCH码进行编码和迭代软判决解码。对这样的BCH码的编码是在通过Galois Fourier变换映射成非二进制低密度奇偶校验(LDPC)码的码字的码字集合上执行的,该LDPC码具有用于传输的二进制奇偶校验矩阵。使用该矩阵,基于信念传播的二进制迭代软判决解码算法被应用于对BCH码的码字集合进行联合解码。联合解码允许在迭代解码过程中在与集合中的码字相对应的接收向量之间共享信息。为了对素数长度的BCH码进行解码,提出的解码方案不仅要求低解码复杂度,而且还具有优越的性能。所提出的解码方案可以在单个码字的最大似然解码上实现联合解码增益。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号