基于证候的任意码HARQ方案

Xiaoxi Yu, Md. Noor-A.-Rahim, Lijun Deng, Zhaojie Yang, Y. L. Guan
{"title":"基于证候的任意码HARQ方案","authors":"Xiaoxi Yu, Md. Noor-A.-Rahim, Lijun Deng, Zhaojie Yang, Y. L. Guan","doi":"10.1109/ICCCWorkshops57813.2023.10233766","DOIUrl":null,"url":null,"abstract":"Anytime code is a new class of error-correcting code with arbitrarily long coding memory (by design) so that its decoding performance can be improved by an expanding decoding window size (i.e., decoding delay). The anytime code has been shown to help stabilize an unstable system over noisy channels. Among practical anytime codes, spatially coupled repeat-accumulate (SC-RA) anytime codes have been proven to provide outstanding asymptotic performance while offering a simple encoding process. However, in the finite block-length regime, high erasure/error floors are observed for the SC-RA anytime codes even as the decoding window size (decoding delay) is enlarged. In this paper, to alleviate the high erasure/error floors problem, novel syndrome-based hybrid automatic repeat request (HARQ) schemes are designed for the SC-RA anytime codes over the binary erasure channel (BEC) and the binary input additive white Gaussian noise (BI-AWGN) channel, respectively. Simulation results show that the proposed syndrome-based HARQ schemes offer better decoding performance and spectral efficiency than the prior-art anytime code HARQ schemes.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Syndrome-Based HARQ Schemes for Anytime Codes\",\"authors\":\"Xiaoxi Yu, Md. Noor-A.-Rahim, Lijun Deng, Zhaojie Yang, Y. L. Guan\",\"doi\":\"10.1109/ICCCWorkshops57813.2023.10233766\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Anytime code is a new class of error-correcting code with arbitrarily long coding memory (by design) so that its decoding performance can be improved by an expanding decoding window size (i.e., decoding delay). The anytime code has been shown to help stabilize an unstable system over noisy channels. Among practical anytime codes, spatially coupled repeat-accumulate (SC-RA) anytime codes have been proven to provide outstanding asymptotic performance while offering a simple encoding process. However, in the finite block-length regime, high erasure/error floors are observed for the SC-RA anytime codes even as the decoding window size (decoding delay) is enlarged. In this paper, to alleviate the high erasure/error floors problem, novel syndrome-based hybrid automatic repeat request (HARQ) schemes are designed for the SC-RA anytime codes over the binary erasure channel (BEC) and the binary input additive white Gaussian noise (BI-AWGN) channel, respectively. Simulation results show that the proposed syndrome-based HARQ schemes offer better decoding performance and spectral efficiency than the prior-art anytime code HARQ schemes.\",\"PeriodicalId\":201450,\"journal\":{\"name\":\"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233766\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233766","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

任意码是一种新的纠错码,它具有任意长的编码内存(通过设计),从而可以通过扩大解码窗口大小(即解码延迟)来提高解码性能。随时码已被证明有助于稳定一个不稳定的系统在噪声信道。在实用的任意时刻码中,空间耦合重复累积(SC-RA)任意时刻码已被证明具有出色的渐近性能,同时提供了简单的编码过程。然而,在有限块长度的情况下,即使解码窗口大小(解码延迟)扩大,SC-RA随时码也会出现高擦除/错误层。针对SC-RA任意码在二进制擦除信道(BEC)和二进制输入加性高斯白噪声信道(BI-AWGN)上存在的高擦除/错误层数问题,分别设计了基于证型的混合自动重复请求(HARQ)方案。仿真结果表明,与现有技术的任意码HARQ方案相比,本文提出的基于综合征的HARQ方案具有更好的解码性能和频谱效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Syndrome-Based HARQ Schemes for Anytime Codes
Anytime code is a new class of error-correcting code with arbitrarily long coding memory (by design) so that its decoding performance can be improved by an expanding decoding window size (i.e., decoding delay). The anytime code has been shown to help stabilize an unstable system over noisy channels. Among practical anytime codes, spatially coupled repeat-accumulate (SC-RA) anytime codes have been proven to provide outstanding asymptotic performance while offering a simple encoding process. However, in the finite block-length regime, high erasure/error floors are observed for the SC-RA anytime codes even as the decoding window size (decoding delay) is enlarged. In this paper, to alleviate the high erasure/error floors problem, novel syndrome-based hybrid automatic repeat request (HARQ) schemes are designed for the SC-RA anytime codes over the binary erasure channel (BEC) and the binary input additive white Gaussian noise (BI-AWGN) channel, respectively. Simulation results show that the proposed syndrome-based HARQ schemes offer better decoding performance and spectral efficiency than the prior-art anytime code HARQ schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信