会议专题

New Efficient Check Node Update Method for Improved Min-Sum LDPC Decoding

This paper has presented various Min-Sum related LDPC decoding algorithms and their typical hardware architectures of check node update in the scenario of parallel implementation. For one check node update of Normalized Min-Sum algorithm, if the current row weight is dc, dc multiplications are needed. If dc is large, dc multiplications are needed, which leads to high complexity.In this article, one innovative method for check node update has been found, which can obviously reduce the number of multiplication operations for the Normalized Min-Sum algorithm and the number of comparison/selection operations for the Row Weight Matched Min-Sum algorithm of high rate LDPC codes. Simulations have claimed the performance of Normalized Min-Sum and Row Weight Matched Min-Sum is nearly the same as that of Log-BP, namely the optimal algorithm, which has shown that Normalized Min-Sum and Row Weight Matched Min-Sum are good choices for LDPC decoding.

LDPC CNU BP Min-Sum

LU Xin XU Jun LIANG Yong-sheng

Shenzhen Information Technology Institute, Shenzhen, P.R.China Baseband Algorithm Department, Mobile division, ZTE Corporation

国际会议

第三届信号设计及其在通信中的应用国际会议(Proceedings of 2007 International Workshop on Signal Design and Its Applications in Communications IWSDA07)

成都

英文

152-156

2007-09-23(万方平台首次上网日期,不代表论文的发表时间)