Second Minimum Approximation for Min-Sum Decoders Suitable for High-Rate LDPC Codes
Sign Up to like & getrecommendations! Published in 2019 at "Circuits, Systems, and Signal Processing"
DOI: 10.1007/s00034-019-01107-z
Abstract: In this paper, a method to approximate the second minimum required in the computation of the check node update of an LDPC decoder based on min-sum algorithm is presented. The proposed approximation compensates the performance… read more here.
Keywords: high rate; second minimum; min sum;
A Low-Complexity Neural Normalized Min-Sum LDPC Decoding Algorithm Using Tensor-Train Decomposition
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2022.3207506
Abstract: 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… read more here.
Keywords: normalized min; ldpc decoding; nnms algorithm; neural normalized ... See more keywords
Normalized Min-Sum Neural Network for LDPC Decoding
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Transactions on Cognitive Communications and Networking"
DOI: 10.1109/tccn.2022.3212438
Abstract: The success of deep learning has encouraged its applications in decoding error-correcting codes, e.g., LDPC decoding. In this paper, we propose a model-driven deep learning method for normalized min-sum (NMS) low-density parity-check (LDPC) decoding, namely… read more here.
Keywords: network; normalized min; ldpc decoding; min sum ... See more keywords
LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Transactions on Pattern Analysis and Machine Intelligence"
DOI: 10.1109/tpami.2016.2582165
Abstract: In our recent work, we showed that solving the LP relaxation of the pairwise min-sum labeling problem (also known as MAP inference in graphical models or discrete energy minimization) is not much easier than solving… read more here.
Keywords: relaxation; labeling problem; min sum; linear program ... See more keywords
Low Routing Complexity Multiframe Pipelined LDPC Decoder Based on a Novel Pseudo Marginalized Min-Sum Algorithm for High Throughput Applications
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Transactions on Very Large Scale Integration (VLSI) Systems"
DOI: 10.1109/tvlsi.2022.3224084
Abstract: This article presents a high throughput and low routing complexity multiframe pipelined low-density parity check (LDPC) decoder design based on a novel pseudo marginalized min-sum (PMMS) message passing approach. The proposed PMMS approach reduces the… read more here.
Keywords: decoder; min sum; high throughput; design ... See more keywords