| 摘要: |
| LDPC码是一种可以接近香农限的线性分组码，可通过稀疏奇偶校验矩阵来构造。也可以用因子图来构成。根据LDPC码的不同构成方法至今已提出了数种不同的译码方法。本文介绍了基于因子图的LDPC码的构造方法，分析了和一积(SPA)译码算法的基本原理，最后详细讨论了用SPA算法对LDPC码进行译码的过程。 |
| 关键词: LDPC码 SPA算法 因子图 规则码 译码 |
| DOI：10.3969/j.issn.1001-893X. |
|
| 基金项目:国家自然科学基金资助项目(60277016) |
|
| Constructing and Decoding of LDPC Codes Based on Factor Graphs |
|
| () |
| Abstract: |
| Low Density Parity Check(LDPC) Codes are a kind of linear block codes approaching Shannon limit. They can be constructed either with spare parity-check matrix or with factor graphs. According to various constructing methods of the codes,several decoding algorithms have been proposed so far. In this paper the constructing method of LDPC codes based on factor graph is introduced at the beginning, then the sum-product decoding algorithm(SPA) is analyzed. Finally the decoding process of LDPC based on SPA algorithm is discussed. |
| Key words: LDPC code,Sum-product algorithm,Factor graph,Regular code,Decoding |
《电讯技术》编辑部 