Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Symposium on Information Theory and its Applications

Enhancing Proximal Decoding for LDPC Codes through Deep Unfolding

Asahi Ito, Lantian Wei, Tadashi Wadayama

Published Nov 10, 2024• 2 citations
Publisher

Abstract

This paper introduces a deep unfolding-assisted proximal decoding for low-density parity-check (LDPC) codes. Proximal decoding method is a decoding algorithm based on the proximal gradient method. Our proposal, deep unfolding-assisted proximal (DU-Proximal) decoding, is obtained by applying deep unfolding to the proximal decoding. We especially focus on the decoding performance in multiple-input multiple-output (MIMO) channels. In numerical experiments, we compare the error correcting capability of the proposed algorithm with the minimum mean squared error (MMSE) signal detection method, the tanh signal detection method, and the MMSE jointly with belief propagation (BP) algorithm for LDPC decoding. The experimental results demonstrate that parameter optimization via DU yields significant performance gains, especially at high signal-to-noise ratio levels.

DOI
10.23919/isita60732.2024.10858271

Related papers

Practical MU-MIMO Detection and LDPC Decoding Through Digital Annealing

Po-Shao Chen, Wei Tang, Zhengya Zhang

Digital annealing has been successfully applied to solving combinatorial optimization (CO) problems. It is more flexible, robust, and easier to deploy on edge platforms compared to its counterparts including quantum annealing and analog and in-memory Ising machines. In this work, we apply digital annealing to compute-intensive communication digital signal processing problems, including multi-user detection in multiple-input and multiple-output (MU-MIMO) wireless communication systems and decoding low-density parity-check (LDPC) codes. We show that digital annealing can achieve near maximum likelihood (ML) accuracy for MIMO detection with even lower complexity than the conventional minimum mean square error (MMSE) detection. In LDPC decoding, we enhance digital annealing by introducing a new cost function that improves decoding accuracy and reduces computational complexity compared to the standard formulations.

Design, Automation, and Test in Europe•Mar 31, 2025•0 citations

An Improved Decoding Algorithm for LDPC Codes

XU Yong-tai

An improved decoding algorithm based on minimum mean square error(MMSE) for low-density parity-check(LDPC) codes is proposed.The new algorithm combines processing methods of two modified uniformly most powerful(UMP) BP-based algorithms(normalized UMP BP-based algorithm and offset UMP BP-based algorithm) and attains the corresponding normalization factor and offset factor according to MMSE criterion.Simulations indicate that,compared with the two above-mentioned algorithms,a gain of 0.03 dB can be achieved at bit error rate(BER) of 10-6 with the proposed algorithm when a(3,6) regular LDPC code of code length 1 008 and code rate 1/2 is used.

Beijing Youdian Xueyuan xuebao•Jan 1, 2007•0 citations

A comprehensive Study of Decoding Algorithms for Low Density Parity-Check(LDPC)

C S Anil Kumar, M Vedhashri, L Vanditha +2 more

The near-capacity performance and effective decoding algorithms of Low-Density Parity-Check (LDPC) codes have made them a mainstay of contemporary error correction. With an emphasis on iterative techniques like the Belief Propagation (BP) algorithm, the Min-Sum algorithm, and their variations, this paper offers a thorough analysis of decoding algorithms for LDPC codes. We investigate the trade-offs between various algorithmic techniques’ computational complexity, decoding latency, and error correction performance. Particular focus is placed on new methods and hardware-friendly algorithms that are tailored for next-generation communication systems, such 5 G and beyond.

International Conference on Knowledge Engineering and Communication Systems (ICKECS)•Apr 28, 2025•0 citations

A Channel-Blind Decoding for LDPC Based on Deep Learning and Dictionary Learning

Xu Pang, Chao Yang, Zaichen Zhang +2 more

Low-density parity-check (LDPC) codes are used to correct encoding errors that occur during transmission, which enjoys an excellent performance. The performance of existing Min-Sum decoders for LDPC codes relies heavily on accurate channel estimation. A two-dimensional blind channel decoding algorithm that does not require precise channel estimation is presented in this paper. The algorithm converts the original one-dimensional signal into a two-dimensional LDPC signal according to the template. Dictionary learning is introduced for pre-filtering, and deep learning is adopted for further denoising and decoding. It is revealed that the two-dimensional blind decoding algorithm has a significant improvement over the traditional belief propagation (BP) decoding algorithm when the channel noise is unknown. Moreover, the combination of dictionary learning and deep learning has a great improvement in performance and data size reduction.

SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems•Oct 1, 2019•8 citations

Belief-propagation with information correction: improved near maximum-likelihood decoding of low-density parity-check codes

Nedeljko Varnica, M.P.C. Fossorier

We propose an improved belief-propagation (BP) decoder for low-density parity-check (LDPC) codes based on channel information correction. We show that our algorithm achieves sizeable performance gains (in waterfall and error floor regions) compared to the standard BP decoder. We verify by examples that the proposed decoder almost achieves the maximum-likelihood decoding performance for short LDPC codes

IEEE International Symposium on Information Theory (ISIT)•Dec 23, 2004•18 citations

Design and Implementation of Low Bit Error Rate of LDPC Decoder

Ashlesha P. Kshirsagar, Sandeep Kakde, Manish Devendra Chawhan +1 more

Many classes of high-performance Low-density parity check codes are based on parity check matrices composed of permutation sub matrices. The emulation-simulation framework further allows the algorithm and implementation to be iteratively redefined to improve the error floor performance of message passing decoder. Log-Like hood-Ratio (LLR) based Belief-Propagation (BP) algorithm is presented for Low Density Parity Check codes. Numerically accurate representation of check node update computation used in LLR-BP decoding is described. The implementation of Sum-Product algorithm (SPA) within Low Density Parity Check Code (LDPC) decoder is described in this paper and the correction term is used to improve the decoding performance of min-sum algorithm (MSA). Quantization and log-tanh function approximation in sum-product decoder strongly affect which absorbing set dominates in error floor region. For LDPC decoder, bit error rate (BER) decreases with increase in the signal to noise ratio.

International Conference on Communication Systems and Network Technologies•Apr 1, 2015•1 citation
This paper introduces a deep unfolding-assisted proximal decoding for low-density parity-check (LDPC) codes. Proximal decoding method is a decoding algorithm based on the proximal gradient method. Our proposal, deep unfolding-assisted proximal (DU-Proximal) decoding, is obtained by applying deep unfolding to the proximal decoding. We especially focus on the decoding performance in multiple-input multiple-output (MIMO) channels. In numerical experiments, we compare the error correcting capability of the proposed algorithm with the minimum mean squared error (MMSE) signal detection method, the tanh signal detection method, and the MMSE jointly with belief propagation (BP) algorithm for LDPC decoding. The experimental results demonstrate that parameter optimization via DU yields significant performance gains, especially at high signal-to-noise ratio levels.
Digital annealing has been successfully applied to solving combinatorial optimization (CO) problems. It is more flexible, robust, and easier to deploy on edge platforms compared to its counterparts including quantum annealing and analog and in-memory Ising machines. In this work, we apply digital annealing to compute-intensive communication digital signal processing problems, including multi-user detection in multiple-input and multiple-output (MU-MIMO) wireless communication systems and decoding low-density parity-check (LDPC) codes. We show that digital annealing can achieve near maximum likelihood (ML) accuracy for MIMO detection with even lower complexity than the conventional minimum mean square error (MMSE) detection. In LDPC decoding, we enhance digital annealing by introducing a new cost function that improves decoding accuracy and reduces computational complexity compared to the standard formulations.
An improved decoding algorithm based on minimum mean square error(MMSE) for low-density parity-check(LDPC) codes is proposed.The new algorithm combines processing methods of two modified uniformly most powerful(UMP) BP-based algorithms(normalized UMP BP-based algorithm and offset UMP BP-based algorithm) and attains the corresponding normalization factor and offset factor according to MMSE criterion.Simulations indicate that,compared with the two above-mentioned algorithms,a gain of 0.03 dB can be achieved at bit error rate(BER) of 10-6 with the proposed algorithm when a(3,6) regular LDPC code of code length 1 008 and code rate 1/2 is used.
The near-capacity performance and effective decoding algorithms of Low-Density Parity-Check (LDPC) codes have made them a mainstay of contemporary error correction. With an emphasis on iterative techniques like the Belief Propagation (BP) algorithm, the Min-Sum algorithm, and their variations, this paper offers a thorough analysis of decoding algorithms for LDPC codes. We investigate the trade-offs between various algorithmic techniques’ computational complexity, decoding latency, and error correction performance. Particular focus is placed on new methods and hardware-friendly algorithms that are tailored for next-generation communication systems, such 5 G and beyond.
Low-density parity-check (LDPC) codes are used to correct encoding errors that occur during transmission, which enjoys an excellent performance. The performance of existing Min-Sum decoders for LDPC codes relies heavily on accurate channel estimation. A two-dimensional blind channel decoding algorithm that does not require precise channel estimation is presented in this paper. The algorithm converts the original one-dimensional signal into a two-dimensional LDPC signal according to the template. Dictionary learning is introduced for pre-filtering, and deep learning is adopted for further denoising and decoding. It is revealed that the two-dimensional blind decoding algorithm has a significant improvement over the traditional belief propagation (BP) decoding algorithm when the channel noise is unknown. Moreover, the combination of dictionary learning and deep learning has a great improvement in performance and data size reduction.
Many classes of high-performance Low-density parity check codes are based on parity check matrices composed of permutation sub matrices. The emulation-simulation framework further allows the algorithm and implementation to be iteratively redefined to improve the error floor performance of message passing decoder. Log-Like hood-Ratio (LLR) based Belief-Propagation (BP) algorithm is presented for Low Density Parity Check codes. Numerically accurate representation of check node update computation used in LLR-BP decoding is described. The implementation of Sum-Product algorithm (SPA) within Low Density Parity Check Code (LDPC) decoder is described in this paper and the correction term is used to improve the decoding performance of min-sum algorithm (MSA). Quantization and log-tanh function approximation in sum-product decoder strongly affect which absorbing set dominates in error floor region. For LDPC decoder, bit error rate (BER) decreases with increase in the signal to noise ratio.