.png){kind=icon}
Return
perm2vec: Attentive Graph Permutation Selection for Decoding of Error Correction Codes
.png){kind=icon}
OA
AI
DOI：10.1109/JSAC.2020.3036951.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Error correction codes are an integral part of communication applications, boosting the reliability of transmission. The optimal decoding of transmitted codewords is the maximum likelihood rule, which is NP-hard due to the curse of dimensionality. For practical realizations, sub-optimal decoding algorithms are employed; yet limited theoretical insights prevent one from exploiting the full potential of these algorithms. One such insight is the choice of permutation in permutation decoding. We present a data-driven framework for permutation selection, combining domain knowledge with machine learning concepts such as node embedding and self-attention. Significant and consistent improvements in the bit error rate are introduced for all simulated codes, over the baseline decoders. To the best of the authors' knowledge, this work is the first to leverage the benefits of the neural Transformer networks in physical layer communication systems.
Keywords:
Maximum likelihood decoding
Bit error rate
Task analysis
Iterative decoding
Electrical engineering
Convergence
Inference algorithms
Decoding
error correcting codes
belief propagation
deep learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
ShareSave
View more