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

한국통신학회논문지

LDPC 부호를 위한 복잡도와 대기시간을 낮춘 VCRBP 알고리즘

Jung-Hyun Kim, Hong‐Yeop Song

Published Jan 1, 2009• 0 citations
OpenAlex

Abstract

This paper proposes some new improved versions of node-wise VCRBP algorithm for low-density parity-check (LDPC) codes, called forced-convergence node-wise VCRBP algorithm and sign based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.

Related papers

Reduced complexity-and-latency variable-to-check residual belief propagation decoding algorithms for LDPC codes

Jung Hyun Kim, Hong‐Yeop Song

This paper proposes some new improved versions of node-wise VCRBP algorithm, called forced-convergence node-wise VCRBP and sign-based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.

International Workshop on Signal Design and its Applications in Communications•Oct 1, 2009•1 citation

Bit-Flipping Post-Processing For Forced Convergence Decoding Of Ldpc Codes

Ernesto Zimmermann, Prakash Pattisapu, Gerhard Paul Fettweis

The recently proposed forced convergence technique allows for reducing the decoding complexity of Low-Density Parity-Check Codes (LDPCC) at only slight deterioration in performance. The basic idea is to restrict the message passing during LDPC decoding to the nodes that still significantly contribute to the decoding result. In this paper, we propose to add a bit-flipping post-processor to the forced convergence decoder in order to alleviate some problems of this novel technique, namely the error floors observed when aiming for high reduction in decoding complexity. Our results show that combining a hard decision bit-flipping with the forced convergence approach enables to almost retain original error correction performance while further reducing decoding complexity. 1.

European Signal Processing Conference (EUSIPCO)•Sep 8, 2005•13 citations

이진 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

Forced Convergence Decoding of LDPC Codes - EXIT Chart Analysis and Combination with Node Complexity Reduction Techniques

Ernesto Zimmermann, Wolfgang Rave, Gerhard Paul Fettweis

Abstract: Recently, the concept of forced convergence decoding for Low-Density Parity-Check Codes has been introduced. Restricting the message passing in the iterative process to the nodes that still significantly contribute to the decoding result, this approach allows for substantial reduction in decoding complexity at negligible deterioration in performance. We analyze this novel technique using EXIT charts and show how it compares to and can be combined with other complexity reduction techniques. Our findings imply that forced convergence works effectively in conjunction with other complexity reduction techniques while retaining its attractiveness in terms of the complexity-performance trade-off. 1

European Wireless Conference•Apr 10, 2005•23 citations

Improvement of the forced-convergence decoding for LDPC codes

Rumi Aoyama, Yuichi Kaji

An improvement of the forced-convergence decoding algorithm is discussed. Iterative decoding schemes such as the sum-product (SP) decoding bring out excellent performance of low-density parity check (LDPC) codes. The forced-convergence (FC) decoding is also an iterative decoding algorithm obtained by modifying the SP decoding. The FC decoding succeeds to reduce the decoding complexity of the SP decoding, but the error correcting performance is severely degraded by the modification. The performance degradation of the FC decoding is expected to be mitigated if the convergence criterion used in the algorithm is appropriately modified. This paper discusses several types of modifications of the convergence criteria. Computer simulation shows that the proposed modifications improve the performance of the FC decoding algorithm.

International Symposium on Information Theory and its Applications•Dec 1, 2008•7 citations

Reduced Complexity LDPC Decoding using Forced Convergence

Ernesto Zimmermann, Gerhard Paul Fettweis, Prakash Pattisapu +1 more

Abstract — Low-density parity-check (LDPC) codes have recently emerged as a viable option for forward error correction (FEC) in future wireless communications systems. One factor influencing the decision of whether to use a specific FEC technique in a system is its suitability for real time systems – and hence, its computational complexity. In this paper, we present a novel LDPC decoding architecture, where we use a threshold rule to decide whether a variable node of the LDPC decoder should update its information in subsequent iterations of the decoding process, or be considered as converged. We show that by choosing this threshold appropriately, decoding complexity can be significantly reduced with only negligible deterioration in error correction performance. I.

•Jan 1, 2004•51 citations
This paper proposes some new improved versions of node-wise VCRBP algorithm for low-density parity-check (LDPC) codes, called forced-convergence node-wise VCRBP algorithm and sign based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.
The recently proposed forced convergence technique allows for reducing the decoding complexity of Low-Density Parity-Check Codes (LDPCC) at only slight deterioration in performance. The basic idea is to restrict the message passing during LDPC decoding to the nodes that still significantly contribute to the decoding result. In this paper, we propose to add a bit-flipping post-processor to the forced convergence decoder in order to alleviate some problems of this novel technique, namely the error floors observed when aiming for high reduction in decoding complexity. Our results show that combining a hard decision bit-flipping with the forced convergence approach enables to almost retain original error correction performance while further reducing decoding complexity. 1.
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.
Abstract: Recently, the concept of forced convergence decoding for Low-Density Parity-Check Codes has been introduced. Restricting the message passing in the iterative process to the nodes that still significantly contribute to the decoding result, this approach allows for substantial reduction in decoding complexity at negligible deterioration in performance. We analyze this novel technique using EXIT charts and show how it compares to and can be combined with other complexity reduction techniques. Our findings imply that forced convergence works effectively in conjunction with other complexity reduction techniques while retaining its attractiveness in terms of the complexity-performance trade-off. 1
An improvement of the forced-convergence decoding algorithm is discussed. Iterative decoding schemes such as the sum-product (SP) decoding bring out excellent performance of low-density parity check (LDPC) codes. The forced-convergence (FC) decoding is also an iterative decoding algorithm obtained by modifying the SP decoding. The FC decoding succeeds to reduce the decoding complexity of the SP decoding, but the error correcting performance is severely degraded by the modification. The performance degradation of the FC decoding is expected to be mitigated if the convergence criterion used in the algorithm is appropriately modified. This paper discusses several types of modifications of the convergence criteria. Computer simulation shows that the proposed modifications improve the performance of the FC decoding algorithm.
Abstract — Low-density parity-check (LDPC) codes have recently emerged as a viable option for forward error correction (FEC) in future wireless communications systems. One factor influencing the decision of whether to use a specific FEC technique in a system is its suitability for real time systems – and hence, its computational complexity. In this paper, we present a novel LDPC decoding architecture, where we use a threshold rule to decide whether a variable node of the LDPC decoder should update its information in subsequent iterations of the decoding process, or be considered as converged. We show that by choosing this threshold appropriately, decoding complexity can be significantly reduced with only negligible deterioration in error correction performance. I.