Error correction codes (ECC) are crucial for ensuring reliable information transmission in communication systems. Choukroun & Wolf (2022b) recently introduced the Error Correction Code Transformer (ECCT), which has demonstrated promising performance across various transmission channels and families of codes. However, its high computational and memory demands limit its practical applications compared to traditional decoding algorithms. Achieving effective quantization of the ECCT presents significant challenges due to its inherently small architecture, since existing, very low-precision quantization techniques often lead to performance degradation in compact neural networks. In this paper, we introduce a novel acceleration method for transformer-based decoders. We first propose a ternary weight quantization method specifically designed for the ECCT, inducing a decoder with multiplication-free linear layers. We present an optimized self-attention mechanism to reduce computational complexity via codeaware multi-heads processing. Finally, we provide positional encoding via the Tanner graph eigendecomposition, enabling a richer representation of the graph connectivity. The approach not only matches or surpasses ECCT's performance but also significantly reduces energy consumption, memory footprint, and computational complexity. Our method brings transformer-based error correction closer to practical implementation in resource-constrained environments, achieving a 90% compression ratio and reducing arithmetic operation energy consumption by at least 224 times on modern hardware.
Error correction codes (ECC) are crucial for ensuring reliable information transmission in communication systems. Choukroun & Wolf (2022b) recently introduced the Error Correction Code Transformer (ECCT), which has demonstrated promising performance across various transmission channels and families of codes. However, its high computational and memory demands limit its practical applications compared to traditional decoding algorithms. Achieving effective quantization of the ECCT presents significant challenges due to its inherently small architecture, since existing, very low-precision quantization techniques often lead to performance degradation in compact neural networks. In this paper, we introduce a novel acceleration method for transformer-based decoders. We first propose a ternary weight quantization method specifically designed for the ECCT, inducing a decoder with multiplication-free linear layers. We present an optimized self-attention mechanism to reduce computational complexity via codeaware multi-heads processing. Finally, we provide positional encoding via the Tanner graph eigendecomposition, enabling a richer representation of the graph connectivity. The approach not only matches or surpasses ECCT's performance but also significantly reduces energy consumption, memory footprint, and computational complexity. Our method brings transformer-based error correction closer to practical implementation in resource-constrained environments, achieving a 90% compression ratio and reducing arithmetic operation energy consumption by at least 224 times on modern hardware.
Channel coding is vital for reliable sixth-generation (6G) data transmission, employing diverse error correction codes for various application scenarios. Traditional decoders require dedicated hardware for each code, leading to high hardware costs. Recently, artificial intelligence (AI)-driven approaches, such as the error correction code Transformer (ECCT) and its enhanced version, the foundation error correction code Transformer (FECCT), have been proposed to reduce the hardware cost by leveraging the Transformer to decode multiple codes. However, their excessively high computational complexity ofO(N2) due to the self-attention mechanism in the Transformer limits scalability, whereNrepresents the sequence length. To reduce computational complexity, we propose a unified Transformer-based decoder that handles multiple linear block codes within a single framework. Specifically, a standardized unit is employed to align code length and code rate across different code types, while a redesigned low-rank unified attention module, with computational complexity ofO(N), is shared across various heads in the Transformer. Additionally, a sparse mask, derived from the parity-check matrix’s sparsity, is introduced to enhance the decoder’s ability to capture inherent constraints between information and parity-check bits, improving decoding accuracy and further reducing computational complexity by 86%. Extensive experimental results demonstrate that the proposed unified Transformer-based decoder outperforms existing methods and provides a high-performance, low-complexity solution for next-generation wireless communication systems.
In communication and storage systems, error correction codes (ECCs) are pivotal in ensuring data reliability. As deep learning's applicability has broadened across diverse domains, there is a growing research focus on neural network-based decoders that outperform traditional decoding algorithms. Among these neural decoders, Error Correction Code Transformer (ECCT) has achieved the state-of-the-art performance, outperforming other methods by large margins. To further enhance the performance of ECCT, we propose two novel methods. First, leveraging the systematic encoding technique of ECCs, we introduce a new masking matrix for ECCT, aiming to improve the performance and reduce the computational complexity. Second, we propose a novel transformer architecture of ECCT called a double-masked ECCT. This architecture employs two different mask matrices in a parallel manner to learn more diverse features of the relationship between codeword bits in the masked self-attention blocks. Extensive simulation results show that the proposed double-masked ECCT outperforms the conventional ECCT, achieving the state-of-the-art decoding performance with significant margins.
With the broadening applications of deep learning, neural decoders have emerged as a key research focus, specifically aimed at improving the decoding performance of conventional decoding algorithms. In particular, error correction code transformer (ECCT), which utilizes the transformer architecture, has achieved state-of-the-art performance among neural network-based decoders. We present three technical contributions to significantly enhance the performance of ECCT. First, we propose a novel transformer architecture of ECCT, termed themultiple-masks ECCT (MM ECCT). We employ multiple masked self-attention blocks with different mask matrices in a parallel manner to learn diverse relationships among the codeword bits. Second, we discover that constructing mask matrices based on systematic parity check matrices (PCMs) can make the attention mapssparse, which not only enhances the decoding performance but also reduces computational complexity. Finally, we propose using complementary mask matrices derived from cyclic permutations of the systematic PCM. These complementary mask matrices are specifically designed to enhance the decoding of cyclic codes. Our extensive simulation results show that the proposed MM ECCT architecture with carefully designed mask matrices outperforms the original ECCT by a large margin, achieving state-of-the-art decoding performance among neural decoders. The source code is available at https://github.com/iil-postech/mm-ecct.
The Error Correction Code Transformer (ECCT) is a seminal state-of-the-art model-free neural decoder for linear block codes, leveraging parity-check-matrix-aware masked self-attention to exploit algebraic code structure. A well-known limitation of deep Transformer architectures trained with Pre-Layer Normalization (PreNorm), however, is the uncontrolled growth of hidden-state magnitudes with depth, which progressively dilutes the contribution of individual layers, a phenomenon known as PreNorm dilution, thus effectively limiting the benefit of increased architectural depth. In this paper, we propose EC-CRT, a novel Transformer-based neural decoder that integrates Attention Residuals (AttnRes) into the ECCT framework to address this limitation. AttnRes replaces fixed, additive residual connections with learned, input-dependent softmax attention over all preceding layer outputs, enabling each decoding layer to selectively aggregate the most informative earlier representations and directly mitigating PreNorm dilution. Extensive experiments on LDPC(49,24), Polar(64,32), BCH(31,16), and BCH(63,51) codes under a deep configuration and a shallow configuration demonstrate that ECCRT consistently and substantially outperforms ECCT in the deep setting across all codes and SNR values, with gains that widen at higher SNRs, while delivering comparable performance in the shallow setting. The improvement is achieved with negligible additional parameters, only one learned pseudo-query vector per Transformer layer. To the best of our knowledge, this is the first work to demonstrate the benefit of Attention Residuals outside the large language model regime, confirming that this technique generalizes across model scales and application domains.
Modern communication systems increasingly rely on efficient channel decoding, while constrained power and hardware make practical receiver design more challenging. Although the error correction code transformer (ECCT) shows strong full-precision decoding capability, prior studies have not resolved its performance degradation under quantized inputs or its incompatibility with the structured puncturing in 5G-LDPC codes. We propose a noise-assisted pre-module that mitigates discontinuities and introduces localized perturbations at punctured and quantized positions, enabling ECCT to operate effectively under low-precision and 5G-standardized conditions. Simulation results show that our proposed framework achieves comparable performance to NMS decoding without increasing complexity.
Belief propagation (BP) decoding achieves near-optimal performance with large block lengths but faces performance degradation with short blocks. Recent advances in deep learning have spurred research into neural decoders to overcome the limitations of BP decoding. The error correction code transformer (ECCT) offers state-of-the-art decoding performance, yet it demands substantial computational complexity and memory usage. This paper analyzes the hardware complexity of ECCT compared to the basic neural decoder, neural BP (NBP). We also explore strategies for model simplification, showing that applying quantization techniques can reduce resource overhead while maintaining high performance. This paper highlights the potential for advancing neural decoders to achieve greater efficiency and performance.