空间科学学报2011，Vol.31Issue(3)：406-411,6.
原模图LDPC码的准循环扩展和编码算法
Quasi-cyclic Expansion and Encoding Algorithms for Protograph LDPC Codes
李忠亮 1夏国江2
作者信息
- 1. 西北工业大学航天学院,西安710072
- 2. 北京机电工程研究所,北京100074
- 折叠
摘要
Abstract
Recently, a new class of Low-Density Parity-Check (LDPC) codes constructed from a templat 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.关键词
LDPC码/原模图/准循环扩展/环同构Key words
LDPC codes/ Protograph/ Quasi-cyclic expansion/ Ring isomorphism分类
航空航天引用本文复制引用
李忠亮,夏国江..原模图LDPC码的准循环扩展和编码算法[J].空间科学学报,2011,31(3):406-411,6.
