Broadcast erasure channel with feedback - Capacity and algorithms

Abstract

We consider the two-user broadcast erasure channel where feedback in the form of ack messages is fed back to the transmitter. We provide an upper bound to the capacity region of this system. We then present two algorithms whose rate region (information bits per transmitted bit) becomes arbitrarily close to the upper bound for large packet sizes. The first algorithm relies on random coding techniques while the second relies only on XOR operations between pairs of packets. Complexity and feedback information tradeoffs for the two algorithms are discussed. For the case where, in addition to traffic destined exclusively to either one of the users there is additional multicast traffic, we present an algorithm that shows that the rate region of the system can be increased by allowing intersession coding. Finally, for the case where there are random arrivals to the system we present an algorithm, based on the previous algorithms, whose stability region gets close to the capacity region for reasonably large packet sizes. The latter algorithm operates without knowledge of arrival process and channel statistics.