Computer Science – Information Theory
Scientific paper
2010-09-07
Computer Science
Information Theory
45 pages, 3 figures, 3 tables, submitted to IEEE Transactions on Information Theory. Updated version to match reviewer comment
Scientific paper
We consider the N-user broadcast erasure channel with N unicast sessions (one for each user) where receiver feedback is regularly sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the capacity of this system; we then propose a virtual-queue-based inter-session mixing coding algorithm, determine its throughput region and show that it achieves capacity under certain conditions on channel statistics, assuming that instantaneous feedback is known to all users. Removing this assumption results in a throughput region that differs from the outer bound by a factor O(N/L), where L is the fixed packet length. For the case of arbitrary channel statistics, we present a modification of the previous algorithm whose throughput region is identical to the outer bound for N = 3, when instant feedback is known to all users, and differs from the bound by O(1/L), when the 3 users know only their own ACK. The proposed algorithms do not require any prior knowledge of channel statistics.
Gatzianas Marios
Georgiadis Leonidas
Tassiulas Leandros
No associations
LandOfFree
Multiuser broadcast erasure channel with feedback - capacity and algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Multiuser broadcast erasure channel with feedback - capacity and algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiuser broadcast erasure channel with feedback - capacity and algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-704572