Multilevel Decoders Surpassing Belief Propagation on the Binary Symmetric Channel

Details Multilevel Decoders Surpassing Belief Propagation on the Binary Symmetric Channel Multilevel Decoders Surpassing Belief Propagation on the Binary Symmetric Channel

2010-01-19

arxiv.org/abs/1001.3421v2

Computer Science

Information Theory

5 pages, in Proc. of 2010 IEEE International Symposium on Information Theory (ISIT)

Scientific paper

In this paper, we propose a new class of quantized message-passing decoders for LDPC codes over the BSC. The messages take values (or levels) from a finite set. The update rules do not mimic belief propagation but instead are derived using the knowledge of trapping sets. We show that the update rules can be derived to correct certain error patterns that are uncorrectable by algorithms such as BP and min-sum. In some cases even with a small message set, these decoders can guarantee correction of a higher number of errors than BP and min-sum. We provide particularly good 3-bit decoders for 3-left-regular LDPC codes. They significantly outperform the BP and min-sum decoders, but more importantly, they achieve this at only a fraction of the complexity of the BP and min-sum decoders.

Affiliated with

Also associated with

No associations

Rating

Multilevel Decoders Surpassing Belief Propagation on the Binary Symmetric Channel 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 Multilevel Decoders Surpassing Belief Propagation on the Binary Symmetric Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multilevel Decoders Surpassing Belief Propagation on the Binary Symmetric Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-127977