Channel coding and decoding in a relay system operated with physical-layer network coding

This paper investigates link-by-link channel-coded PNC (physical layer network coding), in which a critical process at the relay is to transform the superimposed channel-coded packets received from the two end nodes (plus noise), Y
₃
= X
₁
+ X
₂
+W
₃
, to the network-coded combination of the source packets, S
₁
oplus S
₂
. This is in contrast to the traditional multiple-access problem, in which the goal is to obtain both S
₁
and S
₂
explicitly at the relay node. Trying to obtain S
₁
and S
₂
explicitly is an overkill if we are only interested in S1oplusS
₂
. In this paper, we refer to the transformation Y
₃
rarr S
₁
oplus S
₂
as the channel-decoding- network-coding process (CNC) in that it involves both channel decoding and network coding operations. This paper shows that if we adopt the repeat accumulate (RA) channel code at the two end nodes, then there is a compatible decoder at the relay that can perform the transformation Y
₃
rarr S
₁
oplusS
₂
efficiently. Specifically, we redesign the belief propagation decoding algorithm of the RA code for traditional point-to-point channel to suit the need of the PNC multiple-access channel. Simulation results show that our new scheme outperforms the previously proposed schemes significantly in terms of BER without added complexity.