Hybrid-ARQ Protocols using Iterative Threshold Decoding of OSMLD Product Codes

F. Ayoub, Mustapha Hilia, Faissal El Bouanani, Mohamed Chergui, Khalil Ibrahimi
{"title":"Hybrid-ARQ Protocols using Iterative Threshold Decoding of OSMLD Product Codes","authors":"F. Ayoub, Mustapha Hilia, Faissal El Bouanani, Mohamed Chergui, Khalil Ibrahimi","doi":"10.1109/CommNet52204.2021.9641872","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate the impact of cyclic One-Step Majority-Logic Decodable (OSMLD) Product Codes, when decoded with the Iterative Threshold decoding algorithm, proposed by [2]. We propose to evaluate Hybrid Automatic Repeat Request (HARQ) Protocols using these attractive codes. The idea behind this study is to prove the attracting ARQ/FEC scheme offered by the proposed codes, and to show that we can reach a good trade-off between error rates, the average throughput and complexity. Numerical results shows that the proposed scheme may be interesting to compete many concatenated schemes applied to HARQ protocols.","PeriodicalId":354985,"journal":{"name":"2021 4th International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 4th International Conference on Advanced Communication Technologies and Networking (CommNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CommNet52204.2021.9641872","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we investigate the impact of cyclic One-Step Majority-Logic Decodable (OSMLD) Product Codes, when decoded with the Iterative Threshold decoding algorithm, proposed by [2]. We propose to evaluate Hybrid Automatic Repeat Request (HARQ) Protocols using these attractive codes. The idea behind this study is to prove the attracting ARQ/FEC scheme offered by the proposed codes, and to show that we can reach a good trade-off between error rates, the average throughput and complexity. Numerical results shows that the proposed scheme may be interesting to compete many concatenated schemes applied to HARQ protocols.
基于OSMLD产品码迭代阈值解码的混合arq协议
在本文中,我们研究了循环一步多数逻辑可解码(OSMLD)产品代码在使用迭代阈值解码算法(由[2]提出)解码时的影响。我们建议使用这些吸引码来评估混合自动重复请求(HARQ)协议。这项研究背后的想法是证明所提出的代码提供的吸引ARQ/FEC方案,并表明我们可以在错误率,平均吞吐量和复杂性之间达到良好的权衡。数值结果表明,该方案可以与许多用于HARQ协议的串联方案相竞争。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信