| 摘要: |
| 提出了一种以奇偶校验和作为消息传递的LDPC码硬判决解码方案。该方案以奇偶校验方程是否满足约束为条件，从而决定接收分组中的错误位，并对错误位进行翻转。文中归纳了稀疏奇偶校验矩阵的描述，在此基础上引入校验树结构对解码方案进行可行性分析和描述。最后提出一种具体可实现的解码算法模型。 |
| 关键词: LDPC码 硬判决 稀疏奇偶校验矩阵 校验树 解码算法 信道编码 |
| DOI：10.3969/j.issn.1001-893X. |
|
| 基金项目:国家自然科学基金资助项目(60372067) |
|
| Modeling of a Hard-decision Decoding Algorithm and the Sparse Parity-check Matrix for LDPC Code |
|
| () |
| Abstract: |
| A hard-decision decoding algorithm for LDPC code is proposed, which chooses error bits from received block based on the condition whether the parity-check functions are satisfied or not, and then flips these error bits. Then the sparse parity-check matrix is described and the construction of parity-check tree is introduced to analyze and describe the decoding algorithm. Finally, an implementation of decoding algorithm is given. |
| Key words: LDPC code,Parity-check function,Parity-check tree,Decoding algorithm,Modeling |
