Iterative LDPC decoding using neighborhood reliabilities

Details Iterative LDPC decoding using neighborhood reliabilities Iterative LDPC decoding using neighborhood reliabilities

2007-01-15

arxiv.org/abs/cs/0701091v1

Computer Science

Information Theory

5 pages, 5 figures

Scientific paper

In this paper we study the impact of the processing order of nodes of a bipartite graph, on the performance of an iterative message-passing decoding. To this end, we introduce the concept of neighborhood reliabilities of graph's nodes. Nodes reliabilities are calculated at each iteration and then are used to obtain a processing order within a serial or serial/parallel scheduling. The basic idea is that by processing first the most reliable data, the decoder is reinforced before processing the less reliable one. Using neighborhood reliabilities, the Min-Sum decoder of LDPC codes approaches the performance of the Sum-Product decoder.

Affiliated with

Also associated with

No associations

Rating

Iterative LDPC decoding using neighborhood reliabilities 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 Iterative LDPC decoding using neighborhood reliabilities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Iterative LDPC decoding using neighborhood reliabilities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-584716