Volume 31 Issue 3
May  2011
Turn off MathJax
Article Contents
Li Zhongliang, Xia Guojiang. Quasi-cyclic expansion and encoding algorithms for protograph LDPC codes[J]. Chinese Journal of Space Science, 2011, 31(3): 406-411. doi: 10.11728/cjss2011.03.406
Citation: Li Zhongliang, Xia Guojiang. Quasi-cyclic expansion and encoding algorithms for protograph LDPC codes[J]. Chinese Journal of Space Science, 2011, 31(3): 406-411. doi: 10.11728/cjss2011.03.406

Quasi-cyclic expansion and encoding algorithms for protograph LDPC codes

doi: 10.11728/cjss2011.03.406 cstr: 32142.14.cjss2011.03.406
More Information
  • Corresponding author: Xia Guojiang
  • Received Date: 1900-01-01
  • Rev Recd Date: 1900-01-01
  • Publish Date: 2011-05-15
  • Recently, a new class of Low-Density Parity-Check (LDPC) codes constructed from a template was introduced. This kind of codes were called protograph codes. The protograph serves as a blueprint for constructing LDPC codes of arbitrary size whose performance can be predicted by analyzing the protograph. Protograph LDPC codes perform very well and suit for high-speed encoding and decoding. However, there are few researches on expansion and encoding algorithms for them. In this paper, using isomorphism between matrix ring and polynomial ring, we propose efficient quasi-cyclic expansion and encoding algorithms for protograph LDPC codes. Simulation results show that the protograph LDPC codes which were constructed by the algorithm proposed in this paper, outperform the best known unstructured irregular LDPC codes with the same maximum node degrees.

     

  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article Views(2717) PDF Downloads(1310) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return