...
首页> 外文期刊>IEEE Transactions on Communications >Comparison of constructions of irregular Gallager codes
【24h】

Comparison of constructions of irregular Gallager codes

机译:不规则Gallager码构造的比较

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

摘要

The low-density parity check codes whose performance is closest to the Shannon limit are "Gallager codes" based on irregular graphs. We compare alternative methods for constructing these graphs and present two results. First, we find a "super-Poisson" construction which gives a small improvement in empirical performance over a random construction. Second, whereas Gallager codes normally take N/sup 2/ time to encode, we investigate constructions of regular and irregular Gallager codes that allow more rapid encoding and have smaller memory requirements in the encoder. We find that these "fast encoding" Gallager codes have equally good performance.
机译:性能最接近香农极限的低密度奇偶校验码是基于不规则图的“加拉格码”。我们比较了构建这些图的替代方法,并给出了两个结果。首先,我们发现一个“超级泊松”结构,与随机结构相比,它的经验性能有很小的提高。其次,尽管Gallager码通常需要N / sup 2 /时间来进行编码,但我们研究了规则和不规则Gallager码的构造,这些构造可实现更快的编码并在编码器中具有较小的内存需求。我们发现这些“快速编码”的Gallager码具有同样好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号