Abstract: In this paper, a Joint Source Channel coding scheme
based on LDPC codes is investigated. We consider two concatenated
LDPC codes, one allows to compress a correlated source and the
second to protect it against channel degradations. The original
information can be reconstructed at the receiver by a joint decoder,
where the source decoder and the channel decoder run in parallel by
transferring extrinsic information. We investigate the performance of
the JSC LDPC code in terms of Bit-Error Rate (BER) in the case
of transmission over an Additive White Gaussian Noise (AWGN)
channel, and for different source and channel rate parameters.
We emphasize how JSC LDPC presents a performance tradeoff
depending on the channel state and on the source correlation. We
show that, the JSC LDPC is an efficient solution for a relatively
low Signal-to-Noise Ratio (SNR) channel, especially with highly
correlated sources. Finally, a source-channel rate optimization has
to be applied to guarantee the best JSC LDPC system performance
for a given channel.
Abstract: The decoding of Low-Density Parity-Check (LDPC) codes is operated over a redundant structure known as the bipartite graph, meaning that the full set of bit nodes is not absolutely necessary for decoder convergence. In 2008, Soyjaudah and Catherine designed a recovery algorithm for LDPC codes based on this assumption and showed that the error-correcting performance of their codes outperformed conventional LDPC Codes. In this work, the use of the recovery algorithm is further explored to test the performance of LDPC codes while the number of iterations is progressively increased. For experiments conducted with small blocklengths of up to 800 bits and number of iterations of up to 2000, the results interestingly demonstrate that contrary to conventional wisdom, the error-correcting performance keeps increasing with increasing number of iterations.