Abstract:
Belief-propagation algorithm is taken in LDPC code’s decoding method, but small loops degrade the code’s performance. This paper analyzes the theory of LDPC code’s loop by tree graph and gives out the method to calculate all loops.
Key words:
LDPC code,
Tanner graph,
Loop,
Degree
摘要: LDPC码译码采用的是BP算法,但由于回路的存在,使译码重复迭代,特别是短长度的回路使LDPC码的性能下降,因此用树图法分析了LDPC码的回路及其特性,给出了码回路的求解方法,非常适合于计算机进行求解,同时也给出了LDPC码回路所经过的节点及长度。
关键词:
LDPC码,
Tanner图,
回路,
度
CLC Number:
ZHANG Huanming; YE Wu; FENG Suili. Theory of LDPC Code’s Tree Graph[J]. Computer Engineering, 2007, 33(09): 64-65.
张焕明;叶 梧;冯穗力. LDPC码的树图理论[J]. 计算机工程, 2007, 33(09): 64-65.