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 degree profiles, outperforms linear codes.
CitationMatas, 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.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com