Spatially “Mt. Fuji” Coupled LDPC Codes

DOI Web Site 被引用文献2件 参考文献9件
  • NAKAHARA Yuta
    Department of Pure and Applied Mathematics, Graduate School of Fundamental Science and Engineering, Waseda University
  • SAITO Shota
    Department of Pure and Applied Mathematics, Graduate School of Fundamental Science and Engineering, Waseda University
  • MATSUSHIMA Toshiyasu
    Department of Pure and Applied Mathematics, Graduate School of Fundamental Science and Engineering, Waseda University

抄録

<p>A new type of spatially coupled low density parity check (SCLDPC) code is proposed. This code has two benefits. (1) This code requires less number of iterations to correct the erasures occurring through the binary erasure channel in the waterfall region than that of the usual SCLDPC code. (2) This code has lower error floor than that of the usual SCLDPC code. Proposed code is constructed as a coupled chain of the underlying LDPC codes whose code lengths exponentially increase as the position where the codes exist is close to the middle of the chain. We call our code spatially “Mt. Fuji” coupled LDPC (SFCLDPC) code because the shape of the graph representing the code lengths of underlying LDPC codes at each position looks like Mt. Fuji. By this structure, when the proposed SFCLDPC code and the original SCLDPC code are constructed with the same code rate and the same code length, L (the number of the underlying LDPC codes) of the proposed SFCLDPC code becomes smaller and M (the code lengths of the underlying LDPC codes) of the proposed SFCLDPC code becomes larger than those of the SCLDPC code. These properties of L and M enables the above reduction of the number of iterations and the bit error rate in the error floor region, which are confirmed by the density evolution and computer simulations.</p>

収録刊行物

被引用文献 (2)*注記

もっと見る

参考文献 (9)*注記

もっと見る

関連プロジェクト

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ