适用于任意线性编码的低复杂度分集保护通用比特翻转增强型硬判决译码器

IF 5.3 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Praveen Sai Bere;Mohammed Zafar Ali Khan;Lajos Hanzo
{"title":"适用于任意线性编码的低复杂度分集保护通用比特翻转增强型硬判决译码器","authors":"Praveen Sai Bere;Mohammed Zafar Ali Khan;Lajos Hanzo","doi":"10.1109/OJVT.2024.3437470","DOIUrl":null,"url":null,"abstract":"V2X (Vehicle-to-everything) communication relies on short messages for short-range transmissions over a fading wireless channel, yet requires high reliability and low latency. Hard-decision decoding sacrifices the preservation of diversity order, leading to pronounced performance degradation in fading channels. By contrast, soft-decision decoding retains diversity order, albeit at the cost of increased computational complexity. We introduce a novel enhanced hard-decision decoder termed as the Diversity Flip decoder (DFD) designed for preserving the diversity order. Moreover, it exhibits ‘universal’ applicability to all linear block codes. For a \n<inline-formula><tex-math>$\\mathscr {C}(n,k)$</tex-math></inline-formula>\n code having a minimum distance \n<inline-formula><tex-math>${d_{\\min }}$</tex-math></inline-formula>\n, the proposed decoder incurs a worst-case complexity order of \n<inline-formula><tex-math>$2^{({d_{\\min }}-1)}-1$</tex-math></inline-formula>\n. Notably, for codes having low \n<inline-formula><tex-math>${d_{\\min }}$</tex-math></inline-formula>\n, this complexity represents a significant reduction compared to the popular soft and hard decision decoding algorithms. Due to its capability of maintaining diversity at a low complexity, it is eminently suitable for applications such as V2X (Vehicle-to-everything), IoT (Internet of Things), mMTC (Massive Machine type Communications), URLLC (Ultra-Reliable Low Latency Communications) and WBAN (Wireless Body Area Networks) for efficient decoding with favorable performance characteristics. The simulation results provided for various known codes and decoding algorithms validate the performance versus complexity benefits of the proposed decoder.","PeriodicalId":34270,"journal":{"name":"IEEE Open Journal of Vehicular Technology","volume":"5 ","pages":"1496-1517"},"PeriodicalIF":5.3000,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10621450","citationCount":"0","resultStr":"{\"title\":\"A Low-Complexity Diversity-Preserving Universal Bit-Flipping Enhanced Hard Decision Decoder for Arbitrary Linear Codes\",\"authors\":\"Praveen Sai Bere;Mohammed Zafar Ali Khan;Lajos Hanzo\",\"doi\":\"10.1109/OJVT.2024.3437470\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"V2X (Vehicle-to-everything) communication relies on short messages for short-range transmissions over a fading wireless channel, yet requires high reliability and low latency. Hard-decision decoding sacrifices the preservation of diversity order, leading to pronounced performance degradation in fading channels. By contrast, soft-decision decoding retains diversity order, albeit at the cost of increased computational complexity. We introduce a novel enhanced hard-decision decoder termed as the Diversity Flip decoder (DFD) designed for preserving the diversity order. Moreover, it exhibits ‘universal’ applicability to all linear block codes. For a \\n<inline-formula><tex-math>$\\\\mathscr {C}(n,k)$</tex-math></inline-formula>\\n code having a minimum distance \\n<inline-formula><tex-math>${d_{\\\\min }}$</tex-math></inline-formula>\\n, the proposed decoder incurs a worst-case complexity order of \\n<inline-formula><tex-math>$2^{({d_{\\\\min }}-1)}-1$</tex-math></inline-formula>\\n. Notably, for codes having low \\n<inline-formula><tex-math>${d_{\\\\min }}$</tex-math></inline-formula>\\n, this complexity represents a significant reduction compared to the popular soft and hard decision decoding algorithms. Due to its capability of maintaining diversity at a low complexity, it is eminently suitable for applications such as V2X (Vehicle-to-everything), IoT (Internet of Things), mMTC (Massive Machine type Communications), URLLC (Ultra-Reliable Low Latency Communications) and WBAN (Wireless Body Area Networks) for efficient decoding with favorable performance characteristics. The simulation results provided for various known codes and decoding algorithms validate the performance versus complexity benefits of the proposed decoder.\",\"PeriodicalId\":34270,\"journal\":{\"name\":\"IEEE Open Journal of Vehicular Technology\",\"volume\":\"5 \",\"pages\":\"1496-1517\"},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2024-08-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10621450\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Open Journal of Vehicular Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10621450/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Open Journal of Vehicular Technology","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10621450/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

V2X(车对万物)通信依靠短信息在衰减的无线信道上进行短距离传输,但要求高可靠性和低延迟。硬决策解码牺牲了分集顺序的保持,导致在衰减信道中性能明显下降。相比之下,软决策解码保留了分集顺序,但代价是增加了计算复杂度。我们引入了一种新的增强型硬判决解码器,称为分集翻转解码器(Diversity Flip decoder,DFD),旨在保留分集顺序。此外,它还表现出对所有线性块编码的 "普遍 "适用性。对于具有最小距离 ${d_{\min }}$ 的 $\mathscr {C}(n,k)$ 代码,所提出的解码器在最坏情况下的复杂度为 2^{({d_{\min }}-1)}-1$ 。值得注意的是,对于具有较低{d_{\min }}$的编码来说,与流行的软决策和硬决策解码算法相比,这一复杂度显著降低。由于它能以较低的复杂度保持多样性,因此非常适合 V2X(车对万物)、IoT(物联网)、mMTC(大规模机器类型通信)、URLLC(超可靠低延迟通信)和 WBAN(无线体域网)等应用,可实现具有良好性能特征的高效解码。针对各种已知编码和解码算法提供的仿真结果验证了拟议解码器的性能与复杂性优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Low-Complexity Diversity-Preserving Universal Bit-Flipping Enhanced Hard Decision Decoder for Arbitrary Linear Codes
V2X (Vehicle-to-everything) communication relies on short messages for short-range transmissions over a fading wireless channel, yet requires high reliability and low latency. Hard-decision decoding sacrifices the preservation of diversity order, leading to pronounced performance degradation in fading channels. By contrast, soft-decision decoding retains diversity order, albeit at the cost of increased computational complexity. We introduce a novel enhanced hard-decision decoder termed as the Diversity Flip decoder (DFD) designed for preserving the diversity order. Moreover, it exhibits ‘universal’ applicability to all linear block codes. For a $\mathscr {C}(n,k)$ code having a minimum distance ${d_{\min }}$ , the proposed decoder incurs a worst-case complexity order of $2^{({d_{\min }}-1)}-1$ . Notably, for codes having low ${d_{\min }}$ , this complexity represents a significant reduction compared to the popular soft and hard decision decoding algorithms. Due to its capability of maintaining diversity at a low complexity, it is eminently suitable for applications such as V2X (Vehicle-to-everything), IoT (Internet of Things), mMTC (Massive Machine type Communications), URLLC (Ultra-Reliable Low Latency Communications) and WBAN (Wireless Body Area Networks) for efficient decoding with favorable performance characteristics. The simulation results provided for various known codes and decoding algorithms validate the performance versus complexity benefits of the proposed decoder.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
9.60
自引率
0.00%
发文量
25
审稿时长
10 weeks
×
引用
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学术官方微信