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 Wireless Communications and Networking Conference

Analysis of Check-Node Merging Decoding for Punctured LDPC Codes with Dual-Diagonal Parity Structure

Jung-Ae Kim, Sung-Rae Kim, Dong‐Joon Shin, Song‐Nam Hong

Published Jan 1, 2007• 4 citations
Publisher

Abstract

In this paper, the authors propose new decoding scheme of punctured LDPC codes with dual-diagonal parity structure by merging check nodes connected to the punctured parity nodes. This check-node merging decoding not only needs smaller number of operations at each iteration but also shows faster decoding convergence speed than the conventional erasure decoding. For the binary erasure channel (BEC) and AWGN channel, the authors analyze and compare the check-node merging and the conventional erasure decoding schemes of the punctured LDPC codes with dual-diagonal parity structure using density evolution. Analytical results show that the check-node merging decoding gives faster convergence speed for both BEC and AWGN channel. Also, simulation results are provided to confirm the analytical results.

DOI
10.1109/wcnc.2007.111

Related papers

Optimal Puncturing of Block-Type LDPC Codes and Their Fast Convergence Decoding

Song‐Nam Hong, Hyeong‐Gun Joo, Dong‐Joon Shin

In this paper, we study and propose a puncturing algorithm of block-type low-density parity-check (B-LDPC) codes. This optimal puncturing algorithm is derived from the fact that puncturing of parity bits is equivalent to merging the check nodes. Furthermore, we propose a new decoding algorithm suitable for the punctured B-LDPC codes. This decoding algorithm needs not only smaller number of operations at each iteration, but also shows faster decoding convergence speed than the conventional erasure decoding algorithm. If the optimally punctured B-LDPC code is decoded by the new decoding algorithm, it results in the same performance as the unpunctured B-LDPC code of the same code rate.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2006•8 citations

Early detection of successful decoding for dual-diagonal block-based LDPC codes

Cheng-Hung Lin, M.-K. Ku

A fast, successful decoding detection mechanism is proposed for dual-diagonal block-based low-density parity-check (LDPC) codes. The algorithm eliminates unnecessary parity check computation by exploiting the structure of dual-diagonal LDPC codes. The average number of decoding iterations can be reduced for both two-phase decoders and layered decoders with no performance degradation on the AWGN channel. Simulation results show that the proposed mechanism reduces average iterations by 10–15% at 10−5 bit error rate compared with standard parity-check equations.

Electronics Letters•Nov 5, 2008•4 citations

A Decoding Method of Low-Density Parity-Check Codes Over the Binary Erasure Channel

Gou Hosoya, Toshiyasu Matsushima, Shigeichi Hirasawa

We propose a new decoding algorithm of LDPC codes over the binary erasure channel (BEC). The proposed decoding algorithm is an iterative one which uses the sparse- ness structure of the parity-check matrix of LDPC codes. We show by simulation results that the proposed decoding algorithm and the conventional decoding algorithm have a trade-o between remaining erasure rate and complexity.

IEEE International Symposium on Information Theory (ISIT)•Dec 14, 2004•6 citations

Node-wise Analysis of Puncturing Patterns for LDPC Codes over AWGN Channel

Sunghoon Choi, Jun Heo

In this paper, we analyze the effect of puncturing patterns for rate-compatible Low-Density Parity-Check (LDPC) codes. Each punctured variable node are connected with multiple check nodes and the check nodes are categorized into two groups named as ‘survived check (SC) node’ and ‘dead check (DC) node’ according to the role of them [3]. With this categorization, we derived the node-wise error probability using density evolution and presented simulation results which were well matched with the analysis.

International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)•Jul 1, 2007•0 citations

Rate-Compatible Puncturing of Finite-Length Low-Density Parity-Check Codes

Badri N. Vellambi, R. Badri, Faramarz Fekri

In this paper, we study rate-compatible puncturing of finite-length Low-Density Parity-Check (LDPC) codes. First, we derive simple and yet good bounds on the expected performance of punctured codes (constructed by random puncturing) over Binary Erasure Channel (BEC) as a function of the performance of their parent LDPC code. We then present a novel rate-compatible puncturing scheme that is very easy to implement. Our scheme uses the idea that a more uniform distribution of punctured bits across the Tanner graph results in punctured codes with better performance. Although the puncturing scheme tailored to regular codes is presented, it is also directly applicable to irregular parent ensembles. By simulations, the proposed rate-compatible puncturing scheme is shown to be superior to the existing puncturing methods for both regular and irregular LDPC codes over BEC and Additive White Gaussian Noise (AWGN) Channel.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2006•5 citations

Sequential message-passing decoding of LDPC codes by partitioning check nodes

Sunghwan Kim, Min‐Ho Jang, Jong‐Seon No +2 more

In this paper, we analyze the sequential message- passing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This decoding algorithm shows better bit error rate (BER) performance than the conventional message-passing decoding algorithm, especially for the small number of iterations. Analytical results indicate that as the number of partitioned subsets of check nodes increases, the BER performance is improved. We also derive the recursive equations for mean values of messages at check and variable nodes by using density evolution with a Gaussian approximation. From these equations, the mean values are obtained at each iteration of the sequential decoding algorithm and the corresponding BER values are calculated. They show that the sequential decoding algorithm converges faster than the conventional one. Finally, the analytical results are confirmed by the simulation results.

IEEE Transactions on Communications•Jul 1, 2008•7 citations
In this paper, the authors propose new decoding scheme of punctured LDPC codes with dual-diagonal parity structure by merging check nodes connected to the punctured parity nodes. This check-node merging decoding not only needs smaller number of operations at each iteration but also shows faster decoding convergence speed than the conventional erasure decoding. For the binary erasure channel (BEC) and AWGN channel, the authors analyze and compare the check-node merging and the conventional erasure decoding schemes of the punctured LDPC codes with dual-diagonal parity structure using density evolution. Analytical results show that the check-node merging decoding gives faster convergence speed for both BEC and AWGN channel. Also, simulation results are provided to confirm the analytical results.
In this paper, we study and propose a puncturing algorithm of block-type low-density parity-check (B-LDPC) codes. This optimal puncturing algorithm is derived from the fact that puncturing of parity bits is equivalent to merging the check nodes. Furthermore, we propose a new decoding algorithm suitable for the punctured B-LDPC codes. This decoding algorithm needs not only smaller number of operations at each iteration, but also shows faster decoding convergence speed than the conventional erasure decoding algorithm. If the optimally punctured B-LDPC code is decoded by the new decoding algorithm, it results in the same performance as the unpunctured B-LDPC code of the same code rate.
A fast, successful decoding detection mechanism is proposed for dual-diagonal block-based low-density parity-check (LDPC) codes. The algorithm eliminates unnecessary parity check computation by exploiting the structure of dual-diagonal LDPC codes. The average number of decoding iterations can be reduced for both two-phase decoders and layered decoders with no performance degradation on the AWGN channel. Simulation results show that the proposed mechanism reduces average iterations by 10–15% at 10−5 bit error rate compared with standard parity-check equations.
In this paper, we analyze the effect of puncturing patterns for rate-compatible Low-Density Parity-Check (LDPC) codes. Each punctured variable node are connected with multiple check nodes and the check nodes are categorized into two groups named as ‘survived check (SC) node’ and ‘dead check (DC) node’ according to the role of them [3]. With this categorization, we derived the node-wise error probability using density evolution and presented simulation results which were well matched with the analysis.
In this paper, we study rate-compatible puncturing of finite-length Low-Density Parity-Check (LDPC) codes. First, we derive simple and yet good bounds on the expected performance of punctured codes (constructed by random puncturing) over Binary Erasure Channel (BEC) as a function of the performance of their parent LDPC code. We then present a novel rate-compatible puncturing scheme that is very easy to implement. Our scheme uses the idea that a more uniform distribution of punctured bits across the Tanner graph results in punctured codes with better performance. Although the puncturing scheme tailored to regular codes is presented, it is also directly applicable to irregular parent ensembles. By simulations, the proposed rate-compatible puncturing scheme is shown to be superior to the existing puncturing methods for both regular and irregular LDPC codes over BEC and Additive White Gaussian Noise (AWGN) Channel.
In this paper, we analyze the sequential message- passing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This decoding algorithm shows better bit error rate (BER) performance than the conventional message-passing decoding algorithm, especially for the small number of iterations. Analytical results indicate that as the number of partitioned subsets of check nodes increases, the BER performance is improved. We also derive the recursive equations for mean values of messages at check and variable nodes by using density evolution with a Gaussian approximation. From these equations, the mean values are obtained at each iteration of the sequential decoding algorithm and the corresponding BER values are calculated. They show that the sequential decoding algorithm converges faster than the conventional one. Finally, the analytical results are confirmed by the simulation results.