Degree-matched check node decoding for regular and irregular LDPCs

作者：Howard Sheryl L^*; Schlegel Christian; Gaudet Vincent C

来源：IEEE Transactions on Circuits and Systems II-Express Briefs, 2006, 53(10): 1054-1058.

DOI：10.1109/TCSII.2006.882204

• iterative decoding
• LDPC codes
• reduced-complexity decoding

This brief examines different parity-check node decoding algorithms for low-density parity-check (LDPC) codes, seeking to recoup the performance loss incurred by the min-sum approximation compared to sum-product decoding. Two degree-matched check node decoding approximations that depend on the check node degree d(c) are presented. Both have low complexity and can be applied to any degree distribution. Simulation results show near sum-product decoding performance for both degree-matched check node approximations for regular and irregular LDPCs.

• 出版日期2006-10