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.

Design and Evaluation of LDPC Code Decoder Using Generalized BP Algorithm

Hashimoto Akiyoshi, Morino Harumi

Published May 14, 2015• 0 citations
OpenAlex

Related papers

Design of a layered LDPC decoder

Francesco Beatrice

•Dec 20, 2012•0 citations

Design of Lookup-Table (LUT) Decoder for Protograph-Based Low-Density Parity-Check (LDPC) codes

Chatuporn Duangthong, Watid Phakphisut

The Belief-propagation (BP) algorithm is a powerful decoder for LDPC codes. However, the BP algorithm requires the high complexity of the check node operation. Therefore, in the previous works, a lookup table (LUT)-based decoder has been proposed for LDPC codes. In this work, we propose the LUT design for protograph LDPC codes. Our LUT design can support the parallel edge, variable node with degree-1 and punctured variable node. As a result, the coding losses of 2-, 3- and 4-bit quantization of LUT decoder are 1.6, 0.5 and 0.1 dB compared to BP algorithm.

International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)•Jul 5, 2022•2 citations

Design and decoding algorithms of non-binary LDPC codes

Kenta Kasai, Kohichi Sakaniwa

IEICE Technical Report; IEICE Tech. Rep.•Dec 3, 2009•0 citations

Improved Belief Propagation (BP) Decoding for LDPC Codes with a large number of short cycles

Kyuhyuk Chung, Jun Heo

In this paper, we improve performance of Low Density Parity Check (LDPC) codes by adding a large number of short cycles. Short cycles, especially cycles of length 4, degrade performance of LDPC codes if the standard BP (Belief Propagation) decoding is used. Therefore current researches have focused on removing cycles of length 4 for designing good performance LDPC codes. We found that a large number of cycles of length 4 improve performance of LDPC codes if a modified BP decoding is used. We present the modified BP decoding algorithm for LDPC codes with a large number of short cycles. We show that the modified BP decoding performance of LDPC codes with a large number of short cycles is better than the standard BP decoding performance of LDPC codes designed by avoiding short cycles.

IEEE Vehicular Technology Conference•Sep 8, 2006•16 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

Improved Performance Decoding for LDPC Codes with a Large Number of Short Cycles

Kyuhyuk Chung

In this paper, we improve performance of Low Density Parity Check (LDPC) codes with adding a large number of short cycles. Short cycles, especially cycles of length 4, degrade performance of LDPC codes if the standard BP (Belief Propagation) decoding is used. Therefore current researches have focused on removing cycles of length 4 for designing good performance LDPC codes. We found that a large number of cycles of length 4 improve performance of LDPC codes if a modified BP decoding is used. We present the modified BP decoding algorithm for LDPC codes with a large number of short cycles. We show that the modified BP decoding performance of LDPC codes with a large number of short cycles is better than the standard BP decoding performance of LDPC codes designed by avoiding short cycles.

한국통신학회논문지•Jan 1, 2008•0 citations
The Belief-propagation (BP) algorithm is a powerful decoder for LDPC codes. However, the BP algorithm requires the high complexity of the check node operation. Therefore, in the previous works, a lookup table (LUT)-based decoder has been proposed for LDPC codes. In this work, we propose the LUT design for protograph LDPC codes. Our LUT design can support the parallel edge, variable node with degree-1 and punctured variable node. As a result, the coding losses of 2-, 3- and 4-bit quantization of LUT decoder are 1.6, 0.5 and 0.1 dB compared to BP algorithm.
In this paper, we improve performance of Low Density Parity Check (LDPC) codes by adding a large number of short cycles. Short cycles, especially cycles of length 4, degrade performance of LDPC codes if the standard BP (Belief Propagation) decoding is used. Therefore current researches have focused on removing cycles of length 4 for designing good performance LDPC codes. We found that a large number of cycles of length 4 improve performance of LDPC codes if a modified BP decoding is used. We present the modified BP decoding algorithm for LDPC codes with a large number of short cycles. We show that the modified BP decoding performance of LDPC codes with a large number of short cycles is better than the standard BP decoding performance of LDPC codes designed by avoiding short cycles.
In this paper, we improve performance of Low Density Parity Check (LDPC) codes with adding a large number of short cycles. Short cycles, especially cycles of length 4, degrade performance of LDPC codes if the standard BP (Belief Propagation) decoding is used. Therefore current researches have focused on removing cycles of length 4 for designing good performance LDPC codes. We found that a large number of cycles of length 4 improve performance of LDPC codes if a modified BP decoding is used. We present the modified BP decoding algorithm for LDPC codes with a large number of short cycles. We show that the modified BP decoding performance of LDPC codes with a large number of short cycles is better than the standard BP decoding performance of LDPC codes designed by avoiding short cycles.