An LDPCC decoding algorithm based on Bowman-Levin approximation --Comparison with BP and CCCP--

Details An LDPCC decoding algorithm based on Bowman-Levin approximation --Comparison with BP and CCCP-- An LDPCC decoding algorithm based on Bowman-Levin approximation --Comparison with BP and CCCP--

2004-10-21

arxiv.org/abs/cond-mat/0410529v2

Physics

Condensed Matter

Statistical Mechanics

2005 IEEE International Symposium on Information Theory

Scientific paper

Belief propagation (BP) and the concave convex procedure (CCCP) are both methods that utilize the Bethe free energy as a cost function and solve information processing tasks. We have developed a new algorithm that also uses the Bethe free energy, but changes the roles of the master variables and the slave variables. This is called the Bowman-Levin (BL) approximation in the domain of statistical physics. When we applied the BL algorithm to decode the Gallager ensemble of short-length regular low-density parity check codes (LDPCC) over an additive white Gaussian noise (AWGN) channel, its average performance was somewhat better than that of either BP or CCCP. This implies that the BL algorithm can also be successfully applied to other problems to which BP or CCCP has already been applied.

Affiliated with

Also associated with

No associations

Rating

An LDPCC decoding algorithm based on Bowman-Levin approximation --Comparison with BP and CCCP-- 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 An LDPCC decoding algorithm based on Bowman-Levin approximation --Comparison with BP and CCCP--, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An LDPCC decoding algorithm based on Bowman-Levin approximation --Comparison with BP and CCCP-- will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-227690