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

Low-complexity Finite-Precision Decoders for LDPC Codes

Shiva Kumar Planjery, Bane V. Vasic, David Declercq, Michael W. Marcellin

Published Oct 1, 2010• 0 citations
OpenAlex

Related papers

이진 LDPC 부호를 위한 저복잡도 복호 알고리즘

민우홍

Low-density parity-check (LDPC) codes can be efficiently decoded with high performance. Especially, sum-product algorithm can achieve excellent performance, but high complexity. Min-sum algorithm is low complexity, but less performance. So, low complexity and high performance decoding algorithm is needed. \n \n In this thesis, we consider low complexity, high performance decoding algorithms. First, we introduce various decoding algorithms for binary LDPC codes. Second, we propose normalized min-sum algorithm with three normalization factors. This algorithm outperforms the existing normalized min-sum algorithm, normalized min-sum algorithm with two normalization factors. Third, we introduce finite alphabet iterative decoders (FAID) which is a new paradigm for finite precision iterative decoding. But existing FAID algorithm only considers binary LDPC codes with column weight three. So, we propose FAID for binary LDPC codes with column weight five. Our proposed algorithms have low-complexity and good error correcting performance.

•Jan 1, 2018•0 citations

Implementation of the Low complexity and High throughput LDPC Decoder

Amrit Pal Singh, Sanjay Sharma

•Aug 27, 2013•0 citations

On the Decoding of LDPC Codes in Finite-Precision Arithmetics

Massimo Rovini, Guido Masera, Luca Fanucci +4 more

IST Mobile and Wireless Communications Summit•Jan 1, 2006•0 citations

Code-aware quantizer design for finite-precision min-sum decoders

Zeina Mheich, Truong Nguyen, Valentin Savin +1 more

Classically, the quantization of the soft information supplied to a finite-precision decoder is chosen to optimize a certain criterion which does not depend on the characteristics of the existing code. This work studies code-aware quantizers, for finite-precision min-sum decoders, which optimize the noise threshold of the existing family of Low-Density Parity-Check (LDPC) codes. We propose a code-aware quantizer with lower complexity than that obtained by optimizing all decision levels and approaching its performance, for few quantization bits. We show that code-aware quantizers outperform code-independent quantizers in terms of noise threshold for both regular and irregular LDPC codes. To overcome the error floor behavior of LDPC codes, we propose the design of the quantizer for a target error probability at the decoder output. The results show that the quantizer optimized to get a zero error probability could lead to a very bad performance for practical range of signal to noise ratios. Finally, we propose to design jointly irregular LDPC codes and code-aware quantizers for finite-precision min-sum decoders. We show that they achieve significant decoding gains with respect to LDPC codes designed for infinite-precision belief propagation decoding, but decoded by finite-precision min-sum.

IEEE International Black Sea Conference on Communications and Networking•Jan 1, 2016•7 citations

Iteration-Aware LDPC Code Design for Low-Power Optical Communications

Toshiaki Koike–Akino, David S. Millar, Keisuke Kojima +4 more

Recent low-density parity-check (LDPC) codes have shown capacity-approaching performance for various communications systems. However, their promising performance cannot always be obtained due to practical constraints, such as finite codeword length, finite iteration, finite memory, and finite precision. In this paper, we focus on a practical design method of high-performance LDPC codes under a constraint of finite-iteration decoding for low-power optical communications. We introduce an iteration-aware LDPC code design approach, which is based on decoding trajectory in extrinsic information transfer chart analysis. It is demonstrated that an LDPC code designed by the conventional curve-fitting method exhibits nearly 2 dB of penalty, when the maximum number of iterations is limited. The results suggest that the LDPC code should be adaptively changed, e.g., when the number of decoding iterations is decreased to save power consumption. We also extend our design method to a multi-objective optimization concept by taking average degrees into account, so that the threshold and the computational complexity are minimized at the same time. The proposed Pareto-optimal codes can achieve additional 2-dB gain or 50% complexity reduction at maximum, in low-power decoding scenarios.

Journal of Lightwave Technology•Sep 11, 2015•37 citations

Fast-convergence architectures and low-complexity algorithms for LDPC decoding

Massimo Rovini, Luca Fanucci, Francesco Rossi

•Jan 1, 2006•0 citations
Low-density parity-check (LDPC) codes can be efficiently decoded with high performance. Especially, sum-product algorithm can achieve excellent performance, but high complexity. Min-sum algorithm is low complexity, but less performance. So, low complexity and high performance decoding algorithm is needed. \n \n In this thesis, we consider low complexity, high performance decoding algorithms. First, we introduce various decoding algorithms for binary LDPC codes. Second, we propose normalized min-sum algorithm with three normalization factors. This algorithm outperforms the existing normalized min-sum algorithm, normalized min-sum algorithm with two normalization factors. Third, we introduce finite alphabet iterative decoders (FAID) which is a new paradigm for finite precision iterative decoding. But existing FAID algorithm only considers binary LDPC codes with column weight three. So, we propose FAID for binary LDPC codes with column weight five. Our proposed algorithms have low-complexity and good error correcting performance.
Classically, the quantization of the soft information supplied to a finite-precision decoder is chosen to optimize a certain criterion which does not depend on the characteristics of the existing code. This work studies code-aware quantizers, for finite-precision min-sum decoders, which optimize the noise threshold of the existing family of Low-Density Parity-Check (LDPC) codes. We propose a code-aware quantizer with lower complexity than that obtained by optimizing all decision levels and approaching its performance, for few quantization bits. We show that code-aware quantizers outperform code-independent quantizers in terms of noise threshold for both regular and irregular LDPC codes. To overcome the error floor behavior of LDPC codes, we propose the design of the quantizer for a target error probability at the decoder output. The results show that the quantizer optimized to get a zero error probability could lead to a very bad performance for practical range of signal to noise ratios. Finally, we propose to design jointly irregular LDPC codes and code-aware quantizers for finite-precision min-sum decoders. We show that they achieve significant decoding gains with respect to LDPC codes designed for infinite-precision belief propagation decoding, but decoded by finite-precision min-sum.
Recent low-density parity-check (LDPC) codes have shown capacity-approaching performance for various communications systems. However, their promising performance cannot always be obtained due to practical constraints, such as finite codeword length, finite iteration, finite memory, and finite precision. In this paper, we focus on a practical design method of high-performance LDPC codes under a constraint of finite-iteration decoding for low-power optical communications. We introduce an iteration-aware LDPC code design approach, which is based on decoding trajectory in extrinsic information transfer chart analysis. It is demonstrated that an LDPC code designed by the conventional curve-fitting method exhibits nearly 2 dB of penalty, when the maximum number of iterations is limited. The results suggest that the LDPC code should be adaptively changed, e.g., when the number of decoding iterations is decreased to save power consumption. We also extend our design method to a multi-objective optimization concept by taking average degrees into account, so that the threshold and the computational complexity are minimized at the same time. The proposed Pareto-optimal codes can achieve additional 2-dB gain or 50% complexity reduction at maximum, in low-power decoding scenarios.