|
Title:
|
Asymptotic MAP upper bounds for LDPC codes
|
|
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:
|
This paper aims at computing tight upper bounds for the maximum a posteriori threshold of low-density parity check codes in the asymptotic blocklength regime for the transmission over binary-input memoryless symmetricoutput channels. While these bounds are already known, we propose a novel derivation based on a completely different approach: based solely on the concept of the chain rule and the conditional entropy, resorting to the concentration theorem for the code ensemble to compute the syndrome entropy with low complexity employing density
evolution. |
|
Abstract:
|
Peer Reviewed |
|
Subject(s):
|
-Àrees temàtiques de la UPC::Enginyeria de la telecomunicació
-Entropy
-Error-correcting codes (Information theory)
-Maximum likelihood estimation
-Parity check codes
-Asymptotic MAP upper bounds
-LDPC codes
-Maximum a posteriori
-Low-density parity check codes
-Binary-input memoryless symmetric-output channels
-Entropia
-Codis correctors d'errors (Teoria de la informació) |
|
Rights:
|
|
|
Document type:
|
Article - Published version
Conference Object |
|
Published by:
|
Institute of Electrical and Electronics Engineers (IEEE)
|
|
Share:
|
|
