PCI复位法适用于伴有SR-ARQ的ii型HARQ

Fumiki Uzawa, T. Koyama, K. Mitsuyama, N. Iai, K. Aoki, T. Hiraguri
{"title":"PCI复位法适用于伴有SR-ARQ的ii型HARQ","authors":"Fumiki Uzawa, T. Koyama, K. Mitsuyama, N. Iai, K. Aoki, T. Hiraguri","doi":"10.1109/CQR.2015.7129086","DOIUrl":null,"url":null,"abstract":"Hybrid automatic repeat request (HARQ) can make efficient and reliable transmission possible for radio communications. However, in the HARQ scheme, packet control information (PCI), such as HARQ block identifiers (HARQ block ids) in selective repeat ARQ (SR-ARQ), are required and the reduction of PCI overhead is an issue. In particular, type-II HARQ handles a large amount of PCI because it includes the HARQ block ids and sub-block ids. The sub-block id identifies the set of parity bits in the HARQ block of the corresponding sub-block, and is used to combine the sub-blocks. This report proposes a method of PCI reduction suitable for type-II HARQ with SR-ARQ. The method can inform the HARQ block id and sub-block id of each HARQ block by sending only the information on how many HARQ blocks are contained in each 1st, 2nd, 3rd, and 4th transmission group. The estimated size of reduced PCI and simulation results of our TDD communication system confirms that the proposed method greatly reduces PCI and improves data throughput compared to a conventional method.","PeriodicalId":274592,"journal":{"name":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"PCI reduction method suitable for type-II HARQ with SR-ARQ\",\"authors\":\"Fumiki Uzawa, T. Koyama, K. Mitsuyama, N. Iai, K. Aoki, T. Hiraguri\",\"doi\":\"10.1109/CQR.2015.7129086\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hybrid automatic repeat request (HARQ) can make efficient and reliable transmission possible for radio communications. However, in the HARQ scheme, packet control information (PCI), such as HARQ block identifiers (HARQ block ids) in selective repeat ARQ (SR-ARQ), are required and the reduction of PCI overhead is an issue. In particular, type-II HARQ handles a large amount of PCI because it includes the HARQ block ids and sub-block ids. The sub-block id identifies the set of parity bits in the HARQ block of the corresponding sub-block, and is used to combine the sub-blocks. This report proposes a method of PCI reduction suitable for type-II HARQ with SR-ARQ. The method can inform the HARQ block id and sub-block id of each HARQ block by sending only the information on how many HARQ blocks are contained in each 1st, 2nd, 3rd, and 4th transmission group. The estimated size of reduced PCI and simulation results of our TDD communication system confirms that the proposed method greatly reduces PCI and improves data throughput compared to a conventional method.\",\"PeriodicalId\":274592,\"journal\":{\"name\":\"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CQR.2015.7129086\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CQR.2015.7129086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

混合自动重复请求(HARQ)可以使无线电通信的高效可靠传输成为可能。然而,在HARQ方案中,在选择性重复ARQ (SR-ARQ)中需要数据包控制信息(PCI),例如HARQ块标识符(HARQ块id),并且PCI开销的减少是一个问题。特别是,ii型HARQ处理大量的PCI,因为它包括HARQ块id和子块id。子块id标识相应子块的HARQ块中的奇偶校验位集合,用于组合子块。本报告提出了一种适用于伴有SR-ARQ的ii型HARQ的PCI复位方法。该方法可以通过只发送每个第1、2、3、4个传输组中包含多少个HARQ块的信息来通知每个HARQ块的HARQ块id和子块id。减少PCI的估计大小和我们的TDD通信系统的仿真结果证实,与传统方法相比,所提出的方法大大降低了PCI,提高了数据吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PCI reduction method suitable for type-II HARQ with SR-ARQ
Hybrid automatic repeat request (HARQ) can make efficient and reliable transmission possible for radio communications. However, in the HARQ scheme, packet control information (PCI), such as HARQ block identifiers (HARQ block ids) in selective repeat ARQ (SR-ARQ), are required and the reduction of PCI overhead is an issue. In particular, type-II HARQ handles a large amount of PCI because it includes the HARQ block ids and sub-block ids. The sub-block id identifies the set of parity bits in the HARQ block of the corresponding sub-block, and is used to combine the sub-blocks. This report proposes a method of PCI reduction suitable for type-II HARQ with SR-ARQ. The method can inform the HARQ block id and sub-block id of each HARQ block by sending only the information on how many HARQ blocks are contained in each 1st, 2nd, 3rd, and 4th transmission group. The estimated size of reduced PCI and simulation results of our TDD communication system confirms that the proposed method greatly reduces PCI and improves data throughput compared to a conventional method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信