• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Annual Allerton Conference on Communication, Control, and Computing; 20040929-1001; Monticello,IL(US) >New Partition-Regular Sequences and Array Codes of Large Girth
【24h】

New Partition-Regular Sequences and Array Codes of Large Girth

机译：新的分区规则序列和大周长的阵列代码

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

One approach to designing structured LDPC codes with large girth is to shorten codes with small girth in such a manner that the deleted columns of the parity-check matrix contain all the variables involved in short cycles. This approach is especially effective if the parity-check matrix of a code is composed of circular permutation blocks, as is the case for array codes. Array codes are a special class of LDPC codes with a structure amenable for VLSI implementation and fast encoding methods. In this paper, we show how to shorten array codes by deleting certain columns of their parity-check matrices so as to increase their girth, and how to modify their structure in a simple manner that guarantees further improvements of their performance under iterative decoding. The columns that one needs to delete in order to increase the girth of array codes are determined by integer sequences closely related to non-averaging sequences and generalizations thereof. Simulation results show that for the array codes we consider, shortening them to increase the girth can lead to SNR gains of over 2dB, over the additive white Gaussian nose (AWGN) channel.
机译：设计具有大周长的结构化LDPC码的一种方法是以这样的方式缩短具有小周长的代码，即奇偶校验矩阵的已删除列包含短周期中涉及的所有变量。如果代码的奇偶校验矩阵由圆形排列块组成，则这种方法特别有效，阵列代码就是这种情况。阵列码是一类特殊的LDPC码，其结构适用于VLSI实现和快速编码方法。在本文中，我们展示了如何通过删除奇偶校验矩阵的某些列来缩短数组代码，从而增加其周长，以及如何以一种简单的方式修改其结构，以确保在迭代解码下进一步提高其性能。为了增加阵列码的周长而需要删除的列是由与非平均序列及其概括性密切相关的整数序列确定的。仿真结果表明，对于我们考虑的阵列代码，在加性白高斯鼻（AWGN）通道上，缩短它们以增加周长可导致超过2dB的SNR增益。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号