Analysis and Design of Serially Concatenated LDGM Codes

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Kharel, Amrit, Cao, Lei
Natura: Preprint
Pubblicazione: 2018
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866929564421193728
author Kharel, Amrit
Cao, Lei
author_facet Kharel, Amrit
Cao, Lei
contents In this paper, we first present the asymptotic performance of serially concatenated low-density generator-matrix (SCLDGM) codes for binary input additive white Gaussian noise channels using discretized density evolution (DDE). We then provide a necessary condition for the successful decoding of these codes. The error-floor analysis along with the lower bound formulas for both LDGM and SCLDGM codes are also provided and verified. We further show that by concatenating inner LDGM codes with a high-rate outer LDPC code instead of concatenating two LDGM codes as in SCLDGM codes, good codes without error floors can be constructed. Finally, with an efficient DDE-based optimization approach that utilizes the necessary condition for the successful decoding, we construct optimized SCLDGM codes that approach the Shannon limit. The improved performance of our optimized SCLDGM codes is demonstrated through both asymptotic and simulation results.
format Preprint
id arxiv_https___arxiv_org_abs_1801_08270
institution arXiv
publishDate 2018
record_format arxiv
spellingShingle Analysis and Design of Serially Concatenated LDGM Codes
Kharel, Amrit
Cao, Lei
Information Theory
In this paper, we first present the asymptotic performance of serially concatenated low-density generator-matrix (SCLDGM) codes for binary input additive white Gaussian noise channels using discretized density evolution (DDE). We then provide a necessary condition for the successful decoding of these codes. The error-floor analysis along with the lower bound formulas for both LDGM and SCLDGM codes are also provided and verified. We further show that by concatenating inner LDGM codes with a high-rate outer LDPC code instead of concatenating two LDGM codes as in SCLDGM codes, good codes without error floors can be constructed. Finally, with an efficient DDE-based optimization approach that utilizes the necessary condition for the successful decoding, we construct optimized SCLDGM codes that approach the Shannon limit. The improved performance of our optimized SCLDGM codes is demonstrated through both asymptotic and simulation results.
title Analysis and Design of Serially Concatenated LDGM Codes
topic Information Theory
url https://arxiv.org/abs/1801.08270