Single-Scan Min-Sum Algorithms for Fast Decoding of LDPC Codes

摘要：

Many implementations for decoding LDPC codes are based on the (normalized/offset) min-sum algorithm due to its satisfactory performance and simplicity in operations.Usually, each iteration of the min-sum algorithm contains two scans, the horizontal scan and the vertical scan. This paper presents a single-scan version of the min-sum algorithm to speed up the decoding process. It can also reduce memory usage or wiring because it only needs the addressing from check nodes to variable nodes while the original min-sum algorithm requires that addressing plus the addressing from variable nodes to check nodes. To cut down memory usage or wiring further, another version of the single-scan min-sum algorithm is presented where the messages of the algorithm are represented by single bit values instead of using fixed point ones. The software implementation has shown that the single-scan min-sum algorithm is more than twice as fast as the original min-sum algorithm.

作者: Xiaofei Huang

作者单位: School of Information Science and Technology Tsinghua University, Beijing P.R.China, 100084

会议类型: 国际会议

会议名称: 2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)

会议地点: 成都

会议语种:英文

页码: 140-143

在线出版日期: 2006-10-22（万方平台首次上网日期，不代表论文的发表时间）