We design sparse graph codes for the two-way relay network with an orthogonal multi-access uplink channel and correlated sources. Recent results on source-channel separation demonstrate the optimality of individual optimisation of source and channel codes. We present a coding scheme based on low-density parity-check codes that performs close to the theoretical limits. Furthermore, we consider the case of non capacity-achieving codes and show the benefits of joint source-channel decoding.
['Gottfried Lechner', 'Roy Timo', 'Lawrence Ong']
Sparse Graph Codes for the Two-Way Relay Network with Correlated Sources