首页> 外文期刊>IEEE Transactions on Information Theory >A performance comparison of the binary quadratic residue codes with the 1/2-rate convolutional codes
【24h】

A performance comparison of the binary quadratic residue codes with the 1/2-rate convolutional codes

机译:二进制二次残差码与1/2速率卷积码的性能比较

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

摘要

The 1/2-rate binary quadratic residue (QR) codes, using binary phase-shift keyed (BPSK) modulation and hard decoding, are presented as an efficient system for reliable communication. Performance results of error correction are obtained both theoretically and by means of computer calculations for a number of binary QR codes. These results are compared with the commonly used 1/2-rate convolutional codes with constraint lengths from 3 to 7 for the hard-decision case. The binary QR codes of different lengths are shown to be equivalent in error-correction performance to some 1/2-rate convolutional codes, each of which has a constraint length K that corresponds to the error-control rate d and the minimum distance d of the QR codes.
机译:提出了使用二进制相移键控(BPSK)调制和硬解码的1/2速率二进制二次残差(QR)码,作为有效的通信系统。从理论上以及通过计算机计算得出的许多二进制QR码都可以得到纠错的性能结果。将这些结果与硬决策情况下约束长度从3到7的常用1/2速率卷积码进行比较。示出了不同长度的二进制QR码在纠错性能上等同于某些1/2速率卷积码,每个卷积码的约束长度K对应于错误控制率d / n和最小距离QR码中的d。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号