Analysis and Design of Binary Message-Passing Decoders

Details Analysis and Design of Binary Message-Passing Decoders Analysis and Design of Binary Message-Passing Decoders

2010-04-22

arxiv.org/abs/1004.4020v1

Computer Science

Information Theory

8 pages, 6 figures, submitted to the IEEE Transactions on Communications

Scientific paper

Binary message-passing decoders for low-density parity-check (LDPC) codes are studied by using extrinsic information transfer (EXIT) charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations in the L-value domain. A hard decision channel results in the well-know Gallager B algorithm, and increasing the output alphabet from hard decisions to two bits yields a gain of more than 1.0 dB in the required signal to noise ratio when using optimized codes. The code optimization requires adapting the mixing property of EXIT functions to the case of binary message-passing decoders. Finally, it is shown that errors on cycles consisting only of degree two and three variable nodes cannot be corrected and a necessary and sufficient condition for the existence of a cycle-free subgraph is derived.

Affiliated with

Also associated with

No associations

Rating

Analysis and Design of Binary Message-Passing Decoders 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 Analysis and Design of Binary Message-Passing Decoders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis and Design of Binary Message-Passing Decoders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-693626