基于校验节点分组的LDPC码串行译码策略具有很高的收敛速度,但当分组数过多,并行度过低时译码时延很大.针对此问题,利用外信息转移(EXIT)图技术找到收敛速度和译码时延的平衡点.首先推导不同分组数下串行译码策略的EXIT函数,然后通过比较函数对应的EXIT曲线估计出在不牺牲收敛速度的前提下该策略能达到的最大并行度.仿真结果验证了EXIT图分析的正确性.
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.