Iterative Network and Channel Decoding on a Tanner Graph
F. Schreckenbach C. Hausl, Gerhard Bauch · mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich) · 2005
We propose a joint network-channel coding scheme for the multiple-access relay channel.In this scenario, two users use a common relay which performs network coding.We show how a distributed Low-Density Parity-Check (LDPC) code can be applied as a joint network-channel code.The network-channel code is described by one single regular Tanner graph and is decoded with the iterative messagepassing algorithm.A numerical comparison with reference systems for block fading channels confirms the diversity and code length gain which is provided by iterative network and channel decoding.