...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Delay Asymptotics With Retransmissions and Incremental Redundancy Codes Over Erasure Channels
【24h】

Delay Asymptotics With Retransmissions and Incremental Redundancy Codes Over Erasure Channels

机译：在擦除信道上具有重传和增量冗余码的延迟渐近

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

摘要

Recent studies have shown that retransmissions can cause heavy-tailed transmission delays even when packet sizes are light tailed. In addition, the impact of heavy-tailed delays persists even when packets size are upper bounded. The key question we study in this paper is how the use of coding techniques to transmit information, together with different system configurations, would affect the distribution of delay. To investigate this problem, we model the underlying channel as a Markov modulated binary erasure channel, where transmitted bits are either received successfully or erased. Erasure codes are used to encode information prior to transmission, which ensures that a fixed fraction of the bits in the codeword can lead to successful decoding. We use incremental redundancy codes, where the codeword is divided into codeword trunks and these trunks are transmitted one at a time to provide incremental redundancies to the receiver until the information is recovered. We characterize the distribution of delay under two different scenarios: 1) decoder uses memory to cache all previously successfully received bits and 2) decoder does not use memory, where received bits are discarded if the corresponding information cannot be decoded. In both cases, we consider codeword length with infinite and finite support. From a theoretical perspective, our results provide a benchmark to quantify the tradeoff between system complexity and the distribution of delay.
机译：最近的研究表明，即使数据包大小为轻尾，重传也会导致重尾传输延迟。此外，即使数据包大小上限，重尾延迟的影响仍然存在。我们在本文中研究的关键问题是，使用编码技术来传输信息以及不同的系统配置将如何影响延迟的分布。为了研究此问题，我们将基础信道建模为马尔可夫调制二进制擦除信道，在该信道中，成功接收或擦除了已传输的位。擦除码用于在传输之前对信息进行编码，以确保码字中固定比例的比特可导致成功解码。我们使用增量冗余码，其中码字被分为码字干线，并且这些干线一次被传输一次，以向接收器提供增量冗余，直到信息被恢复。我们描述了在两种不同情况下的延迟分布特征：1）解码器使用内存来缓存所有先前成功接收的位，以及2）解码器不使用内存，如果相应的信息无法解码，则会丢弃接收到的位。在这两种情况下，我们都考虑具有无限和有限支持的码字长度。从理论上讲，我们的结果为量化系统复杂性和延迟分布之间的折衷提供了基准。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号