首页> 外文期刊>IEEE Transactions on Magnetics >Towards Maximum Likelihood Soft Decision Decoding of the (255,239) Reed Solomon Code
【24h】

Towards Maximum Likelihood Soft Decision Decoding of the (255,239) Reed Solomon Code

机译:迈向(255,239)Reed Solomon码的最大似然软判决解码

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

摘要

In this paper, an efficient method to improve the performance of the box and matching algorithm (BMA) is presented. By constructing a control band which is error free with high probability, we enhance the matching capability of the BMA. More precisely, the performance of BMA of order $(i+1)$ is nearly achieved with a linear increase in complexity and no increase in memory with respect to BMA of order $i$. Simulation results show that the performance of the enhanced BMA with a finite number of random biasing iterations for the decoding of the RS(255,239) code is about 0.1 dB away from that of maximum likelihood decoding (MLD) at the word error rate (WER) $10^{-3}$. A tight performance analysis is derived based on the theory of order statistics for this new approach.
机译:本文提出了一种提高包装盒性能的有效方法和匹配算法(BMA)。通过构建无误码率高的控制带,我们增强了BMA的匹配能力。更准确地,相对于$ i $的BMA,线性(b + 1)复杂度的增加和存储器的增加几乎达到了$(i + 1)$的BMA的性能。仿真结果表明,在误码率(WER)下,具有有限数量随机偏置迭代的增强型BMA的性能与最大似然解码(MLD)的性能相差约0.1 dB,比RS(255,239)码的解码要好。 $ 10 ^ {-3} $。对于这种新方法,基于订单统计理论得出了严格的性能分析。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号