• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE Magnetics Conference >Construction of quasi-cyclic LDPC cycle codes over Galois Field GF(q) based on cycle entropy and application on patterned media storage
【24h】

Construction of quasi-cyclic LDPC cycle codes over Galois Field GF(q) based on cycle entropy and application on patterned media storage

机译：基于循环熵和图案介质存储的准循环LDPC循环码对伽罗瓦场GF（Q）的构造

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Low-density parity-check (LDPC) codes which were proposed in 1962 had been proved to approach the Shannon limit performance. Due to the superior performance, LDPC codes have got wide applications in information transmission and magnetic recording. Meanwhile, good codes usually bear good performance, such as irregular quasi-cyclic LDPC, so it is valuable to study deeply the construction of LDPC codes. In this digest, we focus on the construction of a type of quasi-cyclic LDPC codes, called cycle codes whose parity-check matrix has exactly weight-2 columns. Based on our previous work, the Maximum Cycle Entropy(MCE) Algorithm for constructing nonbinary LDPC codes is then improved and extended to its quasi-cyclic form (QC-MCE), which maintains the quasi-cyclic structure of the parity-check matrix. With this method employed, an elegant distribution of nonzero entries over the Galois Field GF(q) can be obtained among the cycles whose length is related to the girth. Thus, the independence of probabilistic information transferred during decoding is increased, leading to a better performance. Through comparisons and convergence analyses we find that the proposed QC-MCE algorithm behaves much better than the conventional random one and performs as well as the existing method over the AWGN channel. The decoding complexity of our proposed codes is reasonably low due to the QC structure of the codes. The codes constructed with the proposed method can be well applied over the patterned media storage.
机译：1962年提出的低密度奇偶校验（LDPC）代码已被证明已经探讨了Shannon限制绩效。由于性能卓越，LDPC代码在信息传输和磁记录中得到了广泛的应用。同时，良好的代码通常具有良好的性能，例如不规则的准循环LDPC，因此研究LDPC代码的建设是有价值的。在这个摘要中，我们专注于建造一种奇偶校验矩阵具有重量-2列的循环代码类型的准循环LDPC代码。基于我们以前的工作，然后改善用于构建非中共LDPC码的最大循环熵（MCE）算法并扩展到其准循环形式（QC-MCE），其保持奇偶校验矩阵的准循环结构。利用这种方法采用这种方法，可以在长度与周长相关的周期中获得Galois场GF（Q）上的非零条目的优雅分布。因此，在解码期间转移的概率信息的独立性增加，导致更好的性能。通过比较和收敛分析，我们发现所提出的QC-MCE算法比传统的随机算法更好，并且在AWGN通道上执行以及现有方法。由于代码的QC结构，我们所提出的代码的解码复杂度合理低。通过所提出的方法构造的代码可以很好地应用于图案化媒体存储器。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号