LDPC码稀疏奇偶校验矩阵与硬判决解码算法建模  

Modeling of a Hard-decision Decoding Algorithm and the Sparse Parity-check Matrix for LDPC Code

作　　者：彭立[1] 朱光喜[1] 

机构地区：[1]华中科技大学电子与信息工程系,湖北武汉430074

出　　处：《电讯技术》2004年第2期43-46,共4页Telecommunication Engineering

基　　金：国家自然科学基金资助项目(60372067)

摘　　要：提出了一种以奇偶校验和作为消息传递的LDPC码硬判决解码方案。该方案以奇偶校验方程是否满足约束为条件,从而决定接收分组中的错误位,并对错误位进行翻转。文中归纳了稀疏奇偶校验矩阵的描述,在此基础上引入校验树结构对解码方案进行可行性分析和描述。最后提出一种具体可实现的解码算法模型。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.

关 键 词：LDPC码 硬判决 稀疏奇偶校验矩阵 校验树 解码算法 信道编码 

分 类 号：TN911.22[电子电信—通信与信息系统]