Deriving the Normalized Min-Sum Algorithm from Cooperative Optimization

Details Deriving the Normalized Min-Sum Algorithm from Cooperative Optimization Deriving the Normalized Min-Sum Algorithm from Cooperative Optimization

2006-09-15

arxiv.org/abs/cs/0609088v1

Computer Science

Information Theory

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

Scientific paper

The normalized min-sum algorithm can achieve near-optimal performance at decoding LDPC codes. However, it is a critical question to understand the mathematical principle underlying the algorithm. Traditionally, people thought that the normalized min-sum algorithm is a good approximation to the sum-product algorithm, the best known algorithm for decoding LDPC codes and Turbo codes. This paper offers an alternative approach to understand the normalized min-sum algorithm. The algorithm is derived directly from cooperative optimization, a newly discovered general method for global/combinatorial optimization. This approach provides us another theoretical basis for the algorithm and offers new insights on its power and limitation. It also gives us a general framework for designing new decoding algorithms.

Affiliated with

Also associated with

No associations

Rating

Deriving the Normalized Min-Sum Algorithm from Cooperative Optimization 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 Deriving the Normalized Min-Sum Algorithm from Cooperative Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deriving the Normalized Min-Sum Algorithm from Cooperative Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-282618