Latent-Attention-Based Transformer for Near ML Polar Decoding in Short-Code Regime

IF 4.9
Hongzhi Zhu;Wei Xu;Xiaohu You
{"title":"Latent-Attention-Based Transformer for Near ML Polar Decoding in Short-Code Regime","authors":"Hongzhi Zhu;Wei Xu;Xiaohu You","doi":"10.1109/TMLCN.2026.3656874","DOIUrl":null,"url":null,"abstract":"Transformer architectures have emerged as promising deep learning (DL) tools for modeling complex sequence-to-sequence interactions in channel decoding. However, existing transformer-based decoders for error correction codes (ECCs) demonstrate inferior decoding performance and generalization capabilities compared to conventional algebraic decoders, especially in short-code regimes. In this work, we propose a novel latent-attention based transformer (LAT) decoder for polar codes that addresses these limitations through three pivotal innovations. First, we develop a latent-attention mechanism that supersedes the conventional self-attention mechanism. This architectural modification enables independent learning of the Query and Key matrices for code-aware attention computation, decoupling them from the Value matrix. As a result, the LAT decoder emphasizes position-wise decoding interactions while mitigating interference from context correlations that are misaligned with the inherent code structure. Second, we devise an advanced training framework incorporating three synergistic components: entropy-aware importance sampling that emphasizes low-probability regions in the signal constellation space, experience reflow that introduces empirical labels to improve characterization of decoding boundaries, and dynamic label smoothing for likelihood-based regularization. Third, we propose a code-aware masking scheme which allows dynamic adaptation to varying code configurations without modifying the network architecture. Numerical evaluations demonstrate that the proposed LAT decoder achieves near maximum-likelihood (ML) performance in terms of both bit error rate (BER) and block error rate (BLER) for short-length polar codes. Moreover, the architecture exhibits robust generalization capabilities across a wide range of code rates and code lengths.","PeriodicalId":100641,"journal":{"name":"IEEE Transactions on Machine Learning in Communications and Networking","volume":"4 ","pages":"373-390"},"PeriodicalIF":4.9000,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11359753","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Machine Learning in Communications and Networking","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/11359753/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/21 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Transformer architectures have emerged as promising deep learning (DL) tools for modeling complex sequence-to-sequence interactions in channel decoding. However, existing transformer-based decoders for error correction codes (ECCs) demonstrate inferior decoding performance and generalization capabilities compared to conventional algebraic decoders, especially in short-code regimes. In this work, we propose a novel latent-attention based transformer (LAT) decoder for polar codes that addresses these limitations through three pivotal innovations. First, we develop a latent-attention mechanism that supersedes the conventional self-attention mechanism. This architectural modification enables independent learning of the Query and Key matrices for code-aware attention computation, decoupling them from the Value matrix. As a result, the LAT decoder emphasizes position-wise decoding interactions while mitigating interference from context correlations that are misaligned with the inherent code structure. Second, we devise an advanced training framework incorporating three synergistic components: entropy-aware importance sampling that emphasizes low-probability regions in the signal constellation space, experience reflow that introduces empirical labels to improve characterization of decoding boundaries, and dynamic label smoothing for likelihood-based regularization. Third, we propose a code-aware masking scheme which allows dynamic adaptation to varying code configurations without modifying the network architecture. Numerical evaluations demonstrate that the proposed LAT decoder achieves near maximum-likelihood (ML) performance in terms of both bit error rate (BER) and block error rate (BLER) for short-length polar codes. Moreover, the architecture exhibits robust generalization capabilities across a wide range of code rates and code lengths.
基于潜在注意的短时码近ML极译码变压器
变压器架构已经成为有前途的深度学习(DL)工具,用于在信道解码中建模复杂的序列到序列交互。然而,与传统的代数解码器相比,现有的基于变压器的纠错码(ecc)解码器表现出较差的解码性能和泛化能力,特别是在短码体制下。在这项工作中,我们提出了一种新的基于潜在注意力的变压器(LAT)极地码解码器,通过三个关键创新解决了这些限制。首先,我们发展了一种潜在注意机制,取代了传统的自我注意机制。这种架构上的修改允许独立学习Query和Key矩阵,用于代码感知的注意力计算,将它们与Value矩阵解耦。因此,LAT解码器强调位置智能解码交互,同时减轻与固有代码结构不一致的上下文相关性的干扰。其次,我们设计了一个包含三个协同组件的高级训练框架:强调信号星座空间中低概率区域的熵感知重要性采样,引入经验标签以改进解码边界特征的经验流,以及基于似然的正则化的动态标签平滑。第三,我们提出了一种代码感知掩蔽方案,该方案允许在不修改网络结构的情况下动态适应不同的代码配置。数值评估表明,所提出的LAT解码器在短长度极性码的误码率(BER)和分组误码率(BLER)方面都达到了接近最大似然(ML)的性能。此外,该体系结构在很大范围的代码速率和代码长度上展示了健壮的泛化能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书