...
首页> 外文期刊>IEEE Transactions on Communications >A Simplified Step-by-Step Decoding Algorithm for Parallel Decoding of Reed–Solomon Codes
【24h】

A Simplified Step-by-Step Decoding Algorithm for Parallel Decoding of Reed–Solomon Codes

机译:里德-所罗门码并行解码的简化分步解码算法

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

摘要

A simplified parallel step-by-step decoding algorithm is proposed for decoding Reed–Solomon (RS) codes. It uses new method to calculate the determinants of the temporarily changed syndrome matrices, based on the property of these matrices determined in this paper. By using the proposed method, the calculations of the determinants of the temporarily changed syndrome matrices become much simpler and thus the computational complexity of the step-by-step decoding algorithm is significantly reduced.
机译:提出了一种简化的并行逐步解码算法,用于解码里德-所罗门(RS)码。它基于本文确定的矩阵的性质,使用新方法来计算临时更改的综合症矩阵的行列式。通过使用所提出的方法,临时改变的校正子矩阵的行列式的计算变得更加简单,因此逐步解码算法的计算复杂度大大降低。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号