关键词: LDPC码, 迭代译码, 串行译码策略, 收敛速度, 外信息转移图

Abstract:

Serial schedule based decoding for LDPC codes, in which check nodes are partitioned into groups, converges very fast. However, if there are too many groups, the low degree of parallelism will incur high decoding latency. The extrinsic information transfer (EXIT) chart technique is adopted to find out a balance between convergence rate and decoding latency. EXIT functions for serial schedule based decoding with different group partitions are derived, and a comparison among corresponding EXIT curves is made to estimate the maximum parallelism that serial schedule based decoding may achieve without sacrificing the convergence rate. Simulation results validate the EXIT chart analysis.

Key words: LDPC code, iterative decoding, serial schedule based decoding, convergence rate, EXIT chart