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.

Effective Methods of Constructing Irregular LDPC Codes under Message-Passing Decoding and Updating Order for Sequential Decoding

Yuki Taniguchi, Gou Hosoya, Masayuki Goto, Shigeichi Hirasawa

Published Jul 16, 2009• 0 citations
OpenAlex

Related papers

Partially-parallel decoder based on high-efficiency message-passing schedule for irregular LDPC code

Xing Li, Kazunori Shimizu, Takeshi Ikenaga +1 more

IEICE Technical Report; IEICE Tech. Rep.•Feb 28, 2007•0 citations

An Algebraic Method for Constructing Efficiently Encodable Irregular LDPC Codes

好一 坂庭, KOHICHI SAKANIWA

•Sep 1, 2005•0 citations

Partially-parallel irregular LDPC decoder based on improved message passing schedule

Xing Li, Kazunori Shimizu, Zhen Qiu +2 more

In this paper, we propose a new efficient message-passing schedule for irregular LPDC code. Our approach is based on the schedule designed for regular LDPC code. We have modified the original schedule for regular LDPC code and improved it particularly for the irregular LDPC coder realization. The experimental results show that our method could achieve better performance than conventional one, and improve the converging rate as well.

IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)•Aug 1, 2007•0 citations

Information-Optimum LDPC Decoders with Message Alignment for Irregular Codes

Maximilian Stark, Jan Lewandowsky, Gerhard Bauch

In practical implementations, message passing decoding of LDPC codes has to be implemented with finite precision, i.e., the messages are quantized with a small number of bits. This results in a significant performance degradation with respect to decoding with high-precision messages. Recently, we have proposed so-called information bottleneck decoders to design finite-precision decoders with error-correction performance close to high-precision belief-propagation decoding. Earlier works solely focus on the design of information bottleneck decoders for regular LDPC codes or specifically optimized irregular LDPC codes. In this paper, we extend the concept of information bottleneck decoders to irregular LDPC with arbitrary degree distribution. We show that this extension is not straightforward and requires an additional information-optimum step. Therefore, we devise a novel intermediate construction step which we call message alignment. Exemplary numerical simulations using an irregular LDPC code taken from the IEEE 802.11 standard show that incorporating message alignment in the construction yields a 4-bit information bottleneck decoder which performs only 0.15 dB worse than a double-precision belief propagation decoder and outperforms a min-sum decoder.

Globecom•Dec 1, 2018•21 citations

Iterative decoding of LDPC codes: some bounds and properties

David Burshtein, Gadi Miller

Physica A Statistical Mechanics and its Applications•Dec 1, 2001•0 citations

On the Construction and Decoding of Cyclic LDPC Codes

Chao Chen

•Jan 1, 2014•0 citations
In practical implementations, message passing decoding of LDPC codes has to be implemented with finite precision, i.e., the messages are quantized with a small number of bits. This results in a significant performance degradation with respect to decoding with high-precision messages. Recently, we have proposed so-called information bottleneck decoders to design finite-precision decoders with error-correction performance close to high-precision belief-propagation decoding. Earlier works solely focus on the design of information bottleneck decoders for regular LDPC codes or specifically optimized irregular LDPC codes. In this paper, we extend the concept of information bottleneck decoders to irregular LDPC with arbitrary degree distribution. We show that this extension is not straightforward and requires an additional information-optimum step. Therefore, we devise a novel intermediate construction step which we call message alignment. Exemplary numerical simulations using an irregular LDPC code taken from the IEEE 802.11 standard show that incorporating message alignment in the construction yields a 4-bit information bottleneck decoder which performs only 0.15 dB worse than a double-precision belief propagation decoder and outperforms a min-sum decoder.