On Capacity Regions of Two-Receiver Broadcast Packet Erasure Channels with Feedback and Memory

被引：0

作者：

Heindlmaier, Michael ^{[1
]}

Reyhanian, Navid ^{[2
]}

Bidokhti, Shirin Saeedi ^{[1
]}

机构：

[1] Tech Univ Munich, Inst Commun Engn, Munich, Germany

[2] Univ Tehran, Tehran, Iran

来源：

2014 52ND ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON) | 2014年

关键词：

THROUGHPUT; DISCRETE; MAXIMIZATION;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modelled using a finite-state Markov chain representing a channel state. Outer and inner bounds on the capacity region are derived when the channel state is strictly causally known at the transmitter. The bounds are both formulated in terms of feasibility problems and they are matching in all but one of the constraints. The results are extended to feedback with larger delay. Numerical results show that the gains offered through feedback can be quite large.

引用

页码：191 / 198

页数：8