2009
Fresia, Maria; Perez-Cruz, Fernando; Poor, Vincent H; Verdu, Sergio
Joint Source-Channel Coding with Concatenated LDPC Codes Proceedings Article
En: Information Theory and Applications (ITA), San Diego, 2009.
Resumen | Enlaces | BibTeX | Etiquetas: Learning/Statistics & Optimisation
@inproceedings{Fresia2009a,
title = {Joint Source-Channel Coding with Concatenated LDPC Codes},
author = {Maria Fresia and Fernando Perez-Cruz and Vincent H Poor and Sergio Verdu},
url = {http://eprints.pascal-network.org/archive/00004905/},
year = {2009},
date = {2009-01-01},
booktitle = {Information Theory and Applications (ITA)},
address = {San Diego},
abstract = {The separation principle, a milestone in information theory, establishes that for stationary sources and channels there is no loss of optimality when a channel-independent source encoder followed by a source-independent channel encoder are used to transmit the data, as the code length tends to infinity. Thereby, the source and channel encoding have been typically treated as independent problems. For finite-length codes, the separation principle does not hold and a joint encoder and decoder can potentially increase the achieved information transmission rate. In this paper, a scheme for joint source-channel coding based on low-density parity-check (LDPC) codes is presented. The source is compressed and protected with two concatenated LDPC codes and a joint belief propagation decoder is implemented. EXIT chart performance of the proposed schemes is studied. The results are verified with some illustrative experiments.},
keywords = {Learning/Statistics \& Optimisation},
pubstate = {published},
tppubtype = {inproceedings}
}
The separation principle, a milestone in information theory, establishes that for stationary sources and channels there is no loss of optimality when a channel-independent source encoder followed by a source-independent channel encoder are used to transmit the data, as the code length tends to infinity. Thereby, the source and channel encoding have been typically treated as independent problems. For finite-length codes, the separation principle does not hold and a joint encoder and decoder can potentially increase the achieved information transmission rate. In this paper, a scheme for joint source-channel coding based on low-density parity-check (LDPC) codes is presented. The source is compressed and protected with two concatenated LDPC codes and a joint belief propagation decoder is implemented. EXIT chart performance of the proposed schemes is studied. The results are verified with some illustrative experiments.