• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Annual Allerton Conference on Communication, Control, and Computing; 20040929-1001; Monticello,IL(US) >The Anytime Reliability of Constrained Packet Erasure Channels with Feedback
【24h】

The Anytime Reliability of Constrained Packet Erasure Channels with Feedback

机译：带反馈的约束分组擦除信道的随时可靠性

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We study the anytime reliability of packet erasure channels where the erasures are iid and known to both the transmitter and receiver. The packets are allowed to carry a variable number of bits within them although only one packet may be transmitted at any given time step. For any moment constraint on the size of the packets, we show that the anytime reliability is constant at all rates up to the Shannon capacity of the channel and that this constant is essentially the logarithm of the probability of erasure. For cases where there is both a first moment constraint and a constraint on the maximum number of bits that a packet can carry, we show that the optimum anytime reliability is determined primarily by the peak-packet size, but drops abruptly to zero above the Shannon capacity. In order to show achievability of these reliabilities, we give schemes involving FIFO queues where the server can adjust its service rate based on the number of bits awaiting transmission. When many bits are waiting, larger packets are used.
机译：我们研究分组擦除信道在任何时候都具有可靠性的情况，在这种情况下，擦除被识别，并且发射机和接收机都知道。尽管在任何给定的时间步长只能发送一个数据包，但允许这些数据包在其中携带可变数量的位。对于数据包大小的任何时刻限制，我们表明，随时可到的可靠性在直至信道的Shannon容量的所有速率下都是恒定的，并且该常数本质上是擦除概率的对数。对于既有第一个矩约束又有一个数据包可携带的最大位数约束的情况，我们表明最佳的随时可靠性主要由峰值数据包大小决定，但在Shannon之上突然下降到零。容量。为了显示这些可靠性的可实现性，我们给出了涉及FIFO队列的方案，其中服务器可以根据等待传输的位数来调整其服务速率。当等待许多位时，将使用较大的数据包。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号