Selective Coding Strategy for Unicast Composite Networks

Arash Behboodi (1) , Pablo Piantanida (1)

1 E3S - Supélec Sciences des Systèmes

Consider a composite unicast relay network where the channel statistic is randomly drawn from a set of conditional distributions indexed by θ ϵ Θ, which is assumed to be unknown at the source, fully known at the destination and only partly known at the relays. Commonly, the coding strategy at each relay is fixed regardless of its channel measurement. A novel coding for unicast composite networks with multiple relays is introduced. This enables the relays to select dynamically-based on its channel measurement - the best coding scheme between compress-and-forward (CF) and decode-and-forward (DF). As a part of the main result, a generalization of Noisy Network Coding is shown for the case of unicast general networks where the relays are divided between those using DF and CF coding. Furthermore, the relays using DF scheme can exploit the help of those based on CF scheme via offset coding. It is demonstrated via numerical results that this novel coding, referred to as Selective Coding Strategy (SCS), outperforms conventional coding schemes.

Domains: Information Theory [math.IT]; Information Theory [cs.IT]

Arash Behboodi, Pablo Piantanida. Selective Coding Strategy for Unicast Composite Networks. 2012 IEEE International Symposium on Information Theory Proceedings, Jul 2012, Cambridge, MA, United States. pp.1321 - 1325, ⟨10.1109/ISIT.2012.6283072⟩. ⟨hal-00749308⟩