Deriving the Normalized Min-Sum Algorithm from Cooperative Optimization
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.
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)
成都
英文
204-208
2006-10-22(万方平台首次上网日期,不代表论文的发表时间)