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.