Iterative LDPC decoding using neighborhood reliabilities
| dc.creator | Savin, Valentin | |
| dc.date | 2007-01-15 | |
| dc.date.accessioned | 2026-07-07T08:16:58Z | |
| dc.date.available | 2026-07-07T08:16:58Z | |
| dc.description | 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. | |
| dc.description | 5 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0701091 | |
| dc.identifier | http://arxiv.org/abs/cs/0701091 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133971 | |
| dc.subject | Information Theory | |
| dc.title | Iterative LDPC decoding using neighborhood reliabilities | |
| dc.type | text |