|
Title:
|
Analysis of LDPC code syndrome entropy based on subgraphs
|
|
Author:
|
Matas Navarro, David; Lamarca Orozco, M. Meritxell
|
|
Other authors:
|
Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions; Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions |
|
Abstract:
|
We propose a method to bound the syndrome entropy of linear block codes from their factor graph representation. It is specially suited for sparse graphs such as those of low density parity check codes. It is based on the chain rule decomposition of the entropy and the confinement of dependencies within code subgraphs. After
forcing or assuming the subgraphs to have a tree structure, the computation is done by means of density evolution as for a belief propagation analysis. We employ this method to compute upper bounds of the LDPC code syndrome entropy, which allows us to obtain asymptotic MAP upper bounds that match the ones obtained by the generalized area theorem. |
|
Abstract:
|
Peer Reviewed |
|
Subject(s):
|
-Àrees temàtiques de la UPC::Enginyeria de la telecomunicació
-Graph theory
-Block codes
-Entropy codes
-Graph theory
-Linear codes
-Parity check codes
-Tree codes
-LDPC code syndrome entropy analysis
-Code subgraph analysis
-Linear block code syndrome entropy bound
-Factor graph representation
-Entropy chain rule decomposition
-Density evolution
-Belief propagation analysis
-Asymptotic MAP upper bound
-Grafs, Teoria de |
|
Rights:
|
|
|
Document type:
|
Article - Published version
Conference Object |
|
Published by:
|
Institute of Electrical and Electronics Engineers (IEEE)
|
|
Share:
|
|
