Analog Network Coding in General SNR Regime: Performance of a Greedy Scheme

The problem of maximum rate achievable with analog network coding for a unicast communication over a layered relay network with directed links is considered. A relay node performing analog network coding scales and forwards the signals received at its input. Recently this problem has been considered under certain assumptions on per node scaling factor and received SNR. Previously, the authors established a result that allows one to characterize the optimal performance of analog network coding in network scenarios beyond those that can be analyzed using the approaches based on such assumptions. The key contribution of this paper is a scheme to greedily compute a lower bound to the optimal rate achievable with analog network coding in the general layered networks.