...
首页> 外文期刊>Information Theory, IEEE Transactions on >Capacity and Stable Throughput Regions for the Broadcast Erasure Channel With Feedback: An Unusual Union
【24h】

Capacity and Stable Throughput Regions for the Broadcast Erasure Channel With Feedback: An Unusual Union

机译:具有反馈的广播擦除信道的容量和稳定的吞吐量区域:一个不寻常的联合

获取原文
获取原文并翻译 | 示例
           

摘要

We consider a source node broadcasting to two receivers over a general erasure channel with receiver feedback. We characterize the capacity region of the channel and construct algorithms based on linear network coding (either randomized or depending on channel dynamics) that achieve this capacity. We then consider stochastic arrivals at the source for the two destinations and characterize the stable throughput region achieved by adapting the same algorithms that achieve capacity. Next, we modify these algorithms to improve their delay performance and characterize their stable throughput regions. Although the capacity and stability regions obtained by the algorithms are not always identical (because of the extra overhead needed for the algorithms to handle stochastic traffic), they are within a few bits of each other and have similar forms. This example exhibits an unusual relationship between capacity and stability regions and extends similar prior studies for multiple access channels.
机译:我们考虑一个源节点在具有接收器反馈的普通擦除信道上向两个接收器广播。我们表征信道的容量区域,并基于线性网络编码(随机化或取决于信道动态)构造实现该容量的算法。然后,我们考虑两个目的地在源的随机到达,并通过调整实现容量的相同算法来描述稳定的吞吐量区域。接下来,我们修改这些算法以提高其延迟性能并表征其稳定的吞吐量区域。尽管通过算法获得的容量和稳定性区域并不总是相同的(由于算法处理随机流量所需的额外开销),但它们彼此之间只有几位之遥,并且具有相似的形式。此示例展示了容量和稳定性区域之间的异常关系,并扩展了针对多个访问通道的类似先前研究。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号