A Hybrid ARQ Scheme for Resilient Packet Header Compression

V. Suryavanshi, Aria Nosratinia
{"title":"A Hybrid ARQ Scheme for Resilient Packet Header Compression","authors":"V. Suryavanshi, Aria Nosratinia","doi":"10.1109/ACSSC.2005.1599696","DOIUrl":null,"url":null,"abstract":"In this work we address resilient packet header compression in a setup similar to RFC 3095 (robust header compression - ROHC), where a noisy feedback channel is available. We propose a new predictive hybrid ARQ (HARQ), using a systematic convolutional code with delay-limited interleaving. The compressed packet headers are bit interleaved, encoded, and the parity bits are loaded onto the packets in a manner that is consistent with existing standards. Our HARQ design is distinct from previous ones in that it cannot wait until the end of a codeword for retransmission, rather, ARQ's corresponding to individual packet headers arrive continually during a convolutional codeword and must be processed at that time. In our system, each time a NACK is encountered, the encoder estimates the state of the Viterbi decoder, deciding when a retransmission is necessary. The use of coding in conjunction with a specially designed interleaver, provides a flexible and powerful design methodology that makes it possible to improve the throughput via FEC and interleaving, while strictly limiting the delay to avoid timeout in higher layers. Simulations show that the throughput of the resulting system is superior to ROHC, and the delay is less sensitive to the channel conditions. Furthermore, over a large part of the operating range the delay is comparable to, or smaller than, the delay of RQHC","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2005.1599696","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this work we address resilient packet header compression in a setup similar to RFC 3095 (robust header compression - ROHC), where a noisy feedback channel is available. We propose a new predictive hybrid ARQ (HARQ), using a systematic convolutional code with delay-limited interleaving. The compressed packet headers are bit interleaved, encoded, and the parity bits are loaded onto the packets in a manner that is consistent with existing standards. Our HARQ design is distinct from previous ones in that it cannot wait until the end of a codeword for retransmission, rather, ARQ's corresponding to individual packet headers arrive continually during a convolutional codeword and must be processed at that time. In our system, each time a NACK is encountered, the encoder estimates the state of the Viterbi decoder, deciding when a retransmission is necessary. The use of coding in conjunction with a specially designed interleaver, provides a flexible and powerful design methodology that makes it possible to improve the throughput via FEC and interleaving, while strictly limiting the delay to avoid timeout in higher layers. Simulations show that the throughput of the resulting system is superior to ROHC, and the delay is less sensitive to the channel conditions. Furthermore, over a large part of the operating range the delay is comparable to, or smaller than, the delay of RQHC
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
弹性包头压缩的混合ARQ方案
在这项工作中,我们在类似于RFC 3095(鲁棒报头压缩- ROHC)的设置中解决弹性数据包报头压缩问题,其中有一个噪声反馈通道可用。我们提出了一种新的预测混合ARQ (HARQ)算法,该算法使用了一种具有延迟限制交错的系统卷积码。压缩的包头是位交错的,编码的,奇偶校验位以与现有标准一致的方式加载到包上。我们的HARQ设计与以前的设计不同,它不能等到码字结束再进行重传,而是在一个卷积码字期间,对应于单个包头的ARQ不断到达,并且必须在那个时候进行处理。在我们的系统中,每次遇到NACK时,编码器估计Viterbi解码器的状态,决定何时需要重传。将编码与专门设计的交织器结合使用,提供了一种灵活而强大的设计方法,可以通过FEC和交织来提高吞吐量,同时严格限制延迟以避免高层超时。仿真结果表明,该系统的吞吐量优于ROHC,延迟对信道条件的敏感性较低。此外,在大部分工作范围内,延迟与RQHC的延迟相当或小于RQHC的延迟
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Construction of M-QAM STCC Based on QPSK STCC Multi-Source Cooperative Networks with Distributed Convolutional Coding Synchronization of Multiple UWB Piconets Source and Channel Coding for Quasi-Static Fading Channels A Joint Precoding and Scheduling Technique for Multiuser MIMO Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1