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

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

2006-09-16

arxiv.org/abs/cs/0609090v1

Computer Science

Information Theory

Accepted by IEEE Information Theory Workshop, Chengdu, China, 2006

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Single-Scan Min-Sum Algorithms for Fast Decoding of LDPC Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Single-Scan Min-Sum Algorithms for Fast Decoding of LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Single-Scan Min-Sum Algorithms for Fast Decoding of LDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-282632