Loading...
Loading...

Go to the content (press return)

Non-linear graph-based codes for joint source-channel coding

Author
Matas, D.; Lamarca, M.; García-Frías, J.
Type of activity
Presentation of work at congresses
Name of edition
6th International symposium on turbo codes & iterative information processing
Date of publication
2010
Presentation's date
2010-09
Book of congress proceedings
6th International symposium on turbo codes & iterative information processing
First page
399
Last page
403
Repository
http://hdl.handle.net/2117/10447 Open in new window
Abstract
We study the behavior of a new family of nonlinear graph-based codes, previously introduced for compression of asymmetric binary memoryless sources, for the joint source-channel coding scenario in which the codewords are transmitted through an additive white Gaussian noise channel. We focus on low entropy sources (with high redundancy) and compression rates. Monte Carlo simulation and density evolution results show that the proposed family, with a regular and simple parametrization of the degre...
Citation
Matas, D.; Lamarca, M.; Garcia-Frias, J. Non-linear graph-based codes for joint source-channel coding. A: International symposium on turbo codes & iterative information processing. "6th International symposium on turbo codes & iterative information processing". Brest: 2010, p. 399-403.
Group of research
SPCOM - Signal Processing and Communications Group

Participants

Attachments