Network coding for broadcast channel

Abstract

Relay channel has been extensively investigated with great interest. Relays are helpful for reliable transmission, rate enhancement or coverage extension. There are three categories for relay schemes which are amplify and forward (AF), decode and forward (DF), compress and forward (CF). With these basic relay schemes, there have been some efforts to analyze achievability for general network. However, analysis of achievability for general network is considered as a difficult problem. Recently, for general multicast network, Noisy Network Coding in [1] is proposed but does not consider broadcasting. Thus, in this thesis, we combine this technique of Noisy Network Coding with Marton`s coding to apply to general broadcast networks. We first describe a proposed scheme which is based on CF for broadcast relay channel and generalize this scheme for broadcast network, where one source node transmits data to two destination nodes with the help of arbitrarily many relay nodes. Specifically, we apply CF with Marton`s inner coding for broadcasting to compare with the proposed scheme. The proposed scheme have shown broader rate region than CF with Marton`s coding and conventional CF with time-sharing. There are three main contributions of this paper. Firstly, we have shown the achievabilty for general broadcast network. Secondly, the proposed scheme always has equal or better performance than conventional CF for broadcasting. Lastly, we have extended Noisy Network Coding to broadcasting with Marton`s coding.