On the Capacity of Broadcast Erasure Channels with Feedback

Navid Reyhanian

University of Tehran

Abstract:

The capacity region of two-user broadcast packet erasure channels with feedback has recently been obtained. It has been shown that feedback increases the capacity as it facilitates more efficient encoding schemes by tracking which packets have been erased. In this work, we study a probabilistic encoding scheme and its applications in two broadcast scenarios.

In the first scenario, we study a two-user broadcast packet erasure channel with feedback and memory. We model the memory of the channel by a finite state machine and assume that its state is known causally at the encoder. We propose a rate-optimal probabilistic encoding scheme which makes use of the feedback and the knowledge of the state. We furthermore discuss the role of memory via numerical simulations. In the second scenario, we analyze the performance of our probabilistic encoding scheme over three-user broadcast packet erasure channels with feedback and show performance gains offered by this scheme via numerical simulations.

Biography:

Navid Reyhanian received the B.Sc. (Hons) in electrical engineering from Iran University of Science and Technology in 2012. In September 2012, he started his graduate studies at University of Tehran, Iran. From February 2014 he has been working on his master thesis at the Institute for Communications Engineering, TUM. His research interests include algorithms for network coding, wireless networking and applications of optimization and game theory in communication systems.