A Low-Complexity Neural Normalized Min-Sum LDPC Decoding Algorithm using Tensor-Train Decomposition

Compared with traditional low-density parity-check (LDPC) decoding algorithms, the current model-driven deep learning (DL)-based LDPC decoding algorithms face the disadvantage of high computational complexity. Based on the Neural Normalized Min-Sum (NNMS) algorithm, we propose a low-complexity model...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE communications letters Vol. 26; no. 12; p. 1
Main Authors:	Liang, Yuanhui, Lam, Chan-Tong, Ng, Benjamin K.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.12.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Artificial neural networks Bit error rate Complexity Computational complexity Decoding Decomposition Error correcting codes Iterative decoding Machine learning Mathematical analysis Model-Driven LDPC Decoding Neural Normalized Min-Sum Propagation losses Symbols Syndrome Loss Tensor-Train Decomposition Tensors
ISSN:	1089-7798, 1558-2558
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!