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

IEICE Technical Report; IEICE Tech. Rep.

An Improvement of Layered BP Decoding Algorithm for Rate-Compatible Punctured LDPC Codes

Gou Hosoya, Hideki Yagi, Manabu Kobayashi

Published Jan 11, 2011• 0 citations
OpenAlex

Related papers

Layered BP Decoding for Rate-Compatible Punctured LDPC Codes

Jeongseok Ha, Demijan Klinc, Jini Kwon +1 more

Rate-compatible punctured LDPC codes have shown to perform well over a wide variety of code rates, both theoretically and practically. However it has been reported that the belief propagation (BP) decoding for these codes converges slower than for unpunctured codes. Layered BP algorithm is a modified BP algorithm that accelerates the decoding convergence by means of sequential scheduling of check node updates. In this letter, we propose an efficient scheduling of check node updates for rate-compatible punctured LDPC codes that performs well. We show that the convergence speed of the proposed scheduling outperforms conventional (random) scheduling and conventional BP decoding. Performance improvements become more distinctive with the growing fraction of punctured bits

IEEE Communications Letters•May 1, 2007•22 citations

AN IMPROVED ITERATIVE DECODING ALGORITHM OF RATE-COMPATIBLE PUNCTURED LDPC CODES

Gou Hosoya

Far East Journal of Electronics and Communications•Sep 14, 2015•0 citations

Improved BP-Based Decoding Algorithms Integrated with GA for LDPC Codes

Zerong Deng, Xingcheng Liu

Advances in intelligent and soft computing•Jan 1, 2009•2 citations

Fast Decoding of Rate-Compatible Punctured LDPC Codes

Jini Kwon, Demijan Klinc, Jeongseok Ha +1 more

While rate-compatible punctured low-density parity-check (RCP-LDPC) codes offer high flexibility in terms of code rate at a relatively low cost in implementation complexity, they are reported to require more decoding iterations than unpunctured LDPC codes. In this paper1we consider layered belief propagation decoding and propose efficient check node layering that significantly accelerates the decoding convergence of RCP-LDPC codes. We show that the proposed layering outperforms both random layering and conventional BP decoding. The performance improvements become more distinctive at high rates and they come at no additional implementation cost.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•7 citations

Selective Layered BP Decoding for low-latency NR LDPC Codes

Chanho Yoon, Woncheol Cho, Young‐Jo Ko

In this paper, we propose selective layered BP decoding approach for decoding 3GPP NR rate compatible punctured LDPC codes that eliminates the ambiguity of BP decoding for information bit punctured codes. Conventional BP or layered BP decoding approach for NR LDPC codes does not perform well in frequency selective fading channels, and, with the sub iteration applying to the sub matrix portion, the proposed SL layered BP decoding improves the performance drastically. We show that faster decoding speed by applying the proposed scheme to the 3GPP NR LDPC code is achieved in terms of decoding latency.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 19, 2022•2 citations

Rate-compatible punctured ldpc codes with two subgraphs

Gou Hosoya, Osada Keishi, Masayuki Goto

Far East Journal of Electronics and Communications•Jun 1, 2013•1 citation
Rate-compatible punctured LDPC codes have shown to perform well over a wide variety of code rates, both theoretically and practically. However it has been reported that the belief propagation (BP) decoding for these codes converges slower than for unpunctured codes. Layered BP algorithm is a modified BP algorithm that accelerates the decoding convergence by means of sequential scheduling of check node updates. In this letter, we propose an efficient scheduling of check node updates for rate-compatible punctured LDPC codes that performs well. We show that the convergence speed of the proposed scheduling outperforms conventional (random) scheduling and conventional BP decoding. Performance improvements become more distinctive with the growing fraction of punctured bits
While rate-compatible punctured low-density parity-check (RCP-LDPC) codes offer high flexibility in terms of code rate at a relatively low cost in implementation complexity, they are reported to require more decoding iterations than unpunctured LDPC codes. In this paper1we consider layered belief propagation decoding and propose efficient check node layering that significantly accelerates the decoding convergence of RCP-LDPC codes. We show that the proposed layering outperforms both random layering and conventional BP decoding. The performance improvements become more distinctive at high rates and they come at no additional implementation cost.
In this paper, we propose selective layered BP decoding approach for decoding 3GPP NR rate compatible punctured LDPC codes that eliminates the ambiguity of BP decoding for information bit punctured codes. Conventional BP or layered BP decoding approach for NR LDPC codes does not perform well in frequency selective fading channels, and, with the sub iteration applying to the sub matrix portion, the proposed SL layered BP decoding improves the performance drastically. We show that faster decoding speed by applying the proposed scheme to the 3GPP NR LDPC code is achieved in terms of decoding latency.