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

IEEE Vehicular Technology Conference

Low computational complexity algorithms of LDPC decoder for DVB-s2 systems

Eun-A Choi, DaeIk Chang, Deock-Gil, Ji-Won Jung

Published Jan 18, 2006• 6 citations
Publisher

Abstract

This paper proposed the two kinds of simplified complexity reduced algorithm for LDPC decoder. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required without performance degradation. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. In this way, early detected edges are not computed following iterations, the computational complexity of further processing is reduced.

DOI
10.1109/vetecf.2005.1557969

Related papers

Complexity-Reduced Algorithms for LDPC Decoder for DVB-S2 Systems

Eun A Choi, Ji-Won Jung, Nae-Soo Kim +1 more

This paper proposes two kinds of complexity-reduced algorithms for a low density parity check(LDPC) decoder. First, sequential decoding using a partial group is proposed. It has the same hardware complexity and requires a fewer number of iterations with little performance loss. The amount of performance loss can be determined by the designer, based on a tradeoff with the desired reduction in complexity. Second, an early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Once the edges are detected, no further iteration is required; thus early detection reduces the computational complexity.

ETRI Journal•Oct 14, 2005•6 citations

Low Computational Complexity LDPC Decoding Algorithms for DVB-S2 Systems

Ji-Won Jung

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and computational complexity of early detected method is about offs in case of check node update, offs in case of check node update compared to conventional scheme.

The Journal of Korean Institute of Electromagnetic Engineering and Science•Jan 1, 2005•0 citations

A low-complexity min-sum decoding algorithm for LDPC codes

Huan Li, Jing Guo, Chen Guo +1 more

This paper proposes a low-complexity LDPC decoding algorithm with simplified check nodes updating. The proposed algorithm simplifies the result of the second-minimum in check nodes based on the first-minimum computation instead of computing it directly. In order to obtain the approximate result, effective corrected coefficients are utilized, which can reduce the complexity by eliminating the complex computations. Complexity analysis is provided and the results indicate that the complexity of the proposed algorithm is much lower than the general NMS algorithm and MS-based simplified algorithms. Simulation results show that the performance of the proposed algorithm can closely match the NMS algorithm with the same number of iterations.

IEEE International Conference on Communication Technology (ICCT)•Oct 1, 2017•16 citations

Low Complexity LDPC Decoding Techniques with Adaptive Selection of Edges

Kwangho Shin, Jungwoo Lee

In this paper, we propose low complexity LDPC decoding algorithms with variable number of edges. The main idea of this paper is to use the bit nodes selectively instead of using all the connected bit nodes. The proposed algorithms choose the bit node selectively when calculating the check node update equation. First, we study the relationship between the number of bit nodes for updating check node and the performance of the BP decoding algorithm. Two selective algorithms are proposed accordingly. The first algorithm (algorithm 1) does not use the bit nodes whose values are highly reliable when calculating the check node update equation. In the second algorithm (algorithm 2), we increase the number of bit nodes to update check node each time we have a decoding failure. These two algorithms have lower complexity with small performance degradation compared to the LLR-BP based decoding algorithm. These algorithms reduce the computational complexity at high SNR more than they do at low SNR.

IEEE Vehicular Technology Conference•Apr 1, 2007•2 citations

Fast convergence algorithm for decoding of low density parity check codes

Jin Xie, Liuguo Yin, Ning Ge +1 more

Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1

WSEAS TRANSACTIONS on COMMUNICATIONS archive•Jul 1, 2009•1 citation

Early Termination of BCH Codes Aided Iterative Decoding Algorithm for LDPC

Yongbo Wang

In conventional satellite broadcasting systems,e.g.DVB-S2,the error-correction schemes are often based on the concatenation of BCH and low-density parity-check(LDPC) codes,so as to obtain excellent bit error rate(BER) performance.As the inner codes,LDPC codes are traditionally decoded by iterative algorithms with many iteration cycles.In virtue of the concatenated structure of BCH and LDPC codes,a novel iterative decoding structure involving the embedment of BCH error-check function into each iterative cycle of LDPC is proposed.Computer simulations show that the iteration number of LDPC decoding with the proposed algorithm is obviously smaller than with traditional algorithm,thus greatly lowering the additional complexity of BCH error-check codes.Therefore,the total complexity and latency of the iterative decoding could be sufficiently reduced,while the similar system BER performance is maintained.

•Jan 1, 2011•0 citations
This paper proposed the two kinds of simplified complexity reduced algorithm for LDPC decoder. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required without performance degradation. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. In this way, early detected edges are not computed following iterations, the computational complexity of further processing is reduced.
This paper proposes two kinds of complexity-reduced algorithms for a low density parity check(LDPC) decoder. First, sequential decoding using a partial group is proposed. It has the same hardware complexity and requires a fewer number of iterations with little performance loss. The amount of performance loss can be determined by the designer, based on a tradeoff with the desired reduction in complexity. Second, an early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Once the edges are detected, no further iteration is required; thus early detection reduces the computational complexity.
In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and computational complexity of early detected method is about offs in case of check node update, offs in case of check node update compared to conventional scheme.
This paper proposes a low-complexity LDPC decoding algorithm with simplified check nodes updating. The proposed algorithm simplifies the result of the second-minimum in check nodes based on the first-minimum computation instead of computing it directly. In order to obtain the approximate result, effective corrected coefficients are utilized, which can reduce the complexity by eliminating the complex computations. Complexity analysis is provided and the results indicate that the complexity of the proposed algorithm is much lower than the general NMS algorithm and MS-based simplified algorithms. Simulation results show that the performance of the proposed algorithm can closely match the NMS algorithm with the same number of iterations.
In this paper, we propose low complexity LDPC decoding algorithms with variable number of edges. The main idea of this paper is to use the bit nodes selectively instead of using all the connected bit nodes. The proposed algorithms choose the bit node selectively when calculating the check node update equation. First, we study the relationship between the number of bit nodes for updating check node and the performance of the BP decoding algorithm. Two selective algorithms are proposed accordingly. The first algorithm (algorithm 1) does not use the bit nodes whose values are highly reliable when calculating the check node update equation. In the second algorithm (algorithm 2), we increase the number of bit nodes to update check node each time we have a decoding failure. These two algorithms have lower complexity with small performance degradation compared to the LLR-BP based decoding algorithm. These algorithms reduce the computational complexity at high SNR more than they do at low SNR.
Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1
In conventional satellite broadcasting systems,e.g.DVB-S2,the error-correction schemes are often based on the concatenation of BCH and low-density parity-check(LDPC) codes,so as to obtain excellent bit error rate(BER) performance.As the inner codes,LDPC codes are traditionally decoded by iterative algorithms with many iteration cycles.In virtue of the concatenated structure of BCH and LDPC codes,a novel iterative decoding structure involving the embedment of BCH error-check function into each iterative cycle of LDPC is proposed.Computer simulations show that the iteration number of LDPC decoding with the proposed algorithm is obviously smaller than with traditional algorithm,thus greatly lowering the additional complexity of BCH error-check codes.Therefore,the total complexity and latency of the iterative decoding could be sufficiently reduced,while the similar system BER performance is maintained.