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 International Symposium on Information Theory (ISIT)

Rate-compatible non-binary LDPC codes concatenated with multiplicative repetition codes

Kenta Kasai, David Declercq, Charly Poulliat, Kohichi Sakaniwa

Published Jun 1, 2010• 13 citations
Publisher

Abstract

We propose non-binary LDPC codes concatenated with multiplicative repetition codes. To the best of the authors' knowledge, for the transmissions over the memoryless binary-input output-symmetric channels, 2m-ary the (2,dc)-regular LDPC code for m ~ 8 and dc≥ 3 is the best code so far among codes with moderate code length. By multiplicatively repeating the 2m-ary (2,3)-regular LDPC code of rate 1/3, we construct rate-compatible codes of lower rates 1/6,1/9,1/12,.... Surprisingly, such simple low-rate codes outperform the best low-rate binary codes so far.

DOI
10.1109/isit.2010.5513615

Related papers

Multiplicatively Repeated Nonbinary LDPC Codes

Kenta Kasai, David Declercq, Charly Poulliat +1 more

We propose nonbinary LDPC codes concatenated with multiplicative repetition codes. By multiplicatively repeating the (2,3)-regular nonbinary LDPC mother code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9, 1/12,.... Surprisingly, such simple low-rate nonbinary LDPC codes outperform the best low-rate binary LDPC codes so far. Moreover, we propose the decoding algorithm for the proposed codes, which can be decoded with almost the same computational complexity as that of the mother code.

arXiv:1004.5367•IEEE Transactions on Information Theory•Oct 1, 2011•47 citations

NB-LDPC Codes with High Rates Achieving Low BER over the AWGN Channel with QAM Signaling

Gada Rezgui, Asma Maaloui, Iryna Andriyanova +2 more

The paper investigates high-rate Low-Density-Parity-Check (LDPC) codes, able to achieve a low bit error rate (BER). Such an operational regime of LDPC codes finds its application in optical transmissions. For this reason the considered transmission model is the one close to optical communications: it is a M-ary Quadrature-Amplitude Modulation (QAM) signaling over the M-ary input additive Gaussian channel.We study three main points: a) which LDPC codes of fixed codelength can achieve low BER for a code rate R ≥ 0.8; b) whether non-binary LDPC (NB-LDPC) codes, defined over GF(Q), are efficient in this setting; c) how to keep a reasonable decoding complexity for a given modulation order. Our performance analysis is complete and it is based on the calculation of the average bit error rate of a given ensemble, by using both asymptotic and finite-length tools of sparse-graph codes.Our results show that NB-LDPC codes with moderate values of Q, together with a Symbol Interleaved Coded Modulation (SICM) approach, offer the best performance at low BER.

•Oct 24, 2020•2 citations

Low-Rate Non-Binary LDPC Codes for Coherent and Blockwise Non-Coherent AWGN Channels

Balázs Matuz, Gianluigi Liva, Enrico Paolini +2 more

Low-rate non-binary low-density parity-check (LDPC) codes for coherent and blockwise non-coherent additive white Gaussian noise (AWGN) channels are developed. The proposed construction is based on the concatenation of non-binary outer LDPC codes with inner binary codes. In case the binary codes are chosen to be Hadamard or Reed-Muller (RM) codes, the complexity of the decoding scheme is considerably reduced. An asymptotic analysis of the concatenation with help of composite capacity considerations anddensity evolution (DE) is provided, from which guidelines on the choice of both inner and outer codes are devised. Finite length designs presented in this work confirm the excellent performance of the proposed codes.

IEEE Transactions on Communications•Sep 16, 2013•12 citations

Irregular LDPC codes as concatenation of regular LDPC codes

M.P.C. Fossorier, N. Miladinovic

In this letter, the construction of irregular LDPC codes obtained by concatenating regular ones is considered. These codes are analyzed for the binary symmetric channel (BSC). It is shown via proper distribution evolution that such concatenated codes have in general a threshold value weaker (but not necessarily much different) than their unconstrained counterparts for the BSC. On the other hand, they can offer advantages in term of convergence and error performance for lengths of practical interest and long enough to validate the degree distribution selection.

IEEE Communications Letters•Jul 1, 2005•10 citations

Low-rate non-binary hybrid LDPC codes

Lucile Sassatelli, David Declercq, Charly Poulliat

In this paper, we use the class of non-binary hybrid LDPC codes to design very efficient low rate codes. To this end, we consider both asymptotic and finite length designs. First, we present an asymptotic analysis to design hybrid LDPC codes distributions and we explicit the cases when it is useful to use it. Then, by optimizing the algebraic properties of some topologies related to the Tanner graph, we design finite length codes. These codes show significant performance improvements both in the waterfall and in the error floor regions, in comparison with existing state-of-the-art low rate coding schemes, like turbo Hadamard or parallel concatenated Zigzag Hadamard codes, and with no increase of complexity. In particular, the minimum distance of low rate hybrid LDPC codes is by far greater than the ones of previously mentioned codes.

International Symposium on Turbo Codes and Iterative Information Processing•Sep 1, 2008•2 citations

On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels

Amir Bennatan, David Burshtein

We discuss three structures of modified low-density parity-check (LDPC) code ensembles designed for transmission over arbitrary discrete memoryless channels. The first structure is based on the well-known binary LDPC codes following constructions proposed by Gallager and McEliece, the second is based on LDPC codes of arbitrary (q-ary) alphabets employing modulo-q addition, as presented by Gallager, and the third is based on LDPC codes defined over the field GF(q). All structures are obtained by applying a quantization mapping on a coset LDPC ensemble. We present tools for the analysis of nonbinary codes and show that all configurations, under maximum-likelihood (ML) decoding, are capable of reliable communication at rates arbitrarily close to the capacity of any discrete memoryless channel. We discuss practical iterative decoding of our structures and present simulation results for the additive white Gaussian noise (AWGN) channel confirming the effectiveness of the codes.

IEEE Transactions on Information Theory•Mar 1, 2004•136 citations
We propose non-binary LDPC codes concatenated with multiplicative repetition codes. To the best of the authors' knowledge, for the transmissions over the memoryless binary-input output-symmetric channels, 2m-ary the (2,dc)-regular LDPC code for m ~ 8 and dc≥ 3 is the best code so far among codes with moderate code length. By multiplicatively repeating the 2m-ary (2,3)-regular LDPC code of rate 1/3, we construct rate-compatible codes of lower rates 1/6,1/9,1/12,.... Surprisingly, such simple low-rate codes outperform the best low-rate binary codes so far.
We propose nonbinary LDPC codes concatenated with multiplicative repetition codes. By multiplicatively repeating the (2,3)-regular nonbinary LDPC mother code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9, 1/12,.... Surprisingly, such simple low-rate nonbinary LDPC codes outperform the best low-rate binary LDPC codes so far. Moreover, we propose the decoding algorithm for the proposed codes, which can be decoded with almost the same computational complexity as that of the mother code.
The paper investigates high-rate Low-Density-Parity-Check (LDPC) codes, able to achieve a low bit error rate (BER). Such an operational regime of LDPC codes finds its application in optical transmissions. For this reason the considered transmission model is the one close to optical communications: it is a M-ary Quadrature-Amplitude Modulation (QAM) signaling over the M-ary input additive Gaussian channel.We study three main points: a) which LDPC codes of fixed codelength can achieve low BER for a code rate R ≥ 0.8; b) whether non-binary LDPC (NB-LDPC) codes, defined over GF(Q), are efficient in this setting; c) how to keep a reasonable decoding complexity for a given modulation order. Our performance analysis is complete and it is based on the calculation of the average bit error rate of a given ensemble, by using both asymptotic and finite-length tools of sparse-graph codes.Our results show that NB-LDPC codes with moderate values of Q, together with a Symbol Interleaved Coded Modulation (SICM) approach, offer the best performance at low BER.
Low-rate non-binary low-density parity-check (LDPC) codes for coherent and blockwise non-coherent additive white Gaussian noise (AWGN) channels are developed. The proposed construction is based on the concatenation of non-binary outer LDPC codes with inner binary codes. In case the binary codes are chosen to be Hadamard or Reed-Muller (RM) codes, the complexity of the decoding scheme is considerably reduced. An asymptotic analysis of the concatenation with help of composite capacity considerations anddensity evolution (DE) is provided, from which guidelines on the choice of both inner and outer codes are devised. Finite length designs presented in this work confirm the excellent performance of the proposed codes.
In this letter, the construction of irregular LDPC codes obtained by concatenating regular ones is considered. These codes are analyzed for the binary symmetric channel (BSC). It is shown via proper distribution evolution that such concatenated codes have in general a threshold value weaker (but not necessarily much different) than their unconstrained counterparts for the BSC. On the other hand, they can offer advantages in term of convergence and error performance for lengths of practical interest and long enough to validate the degree distribution selection.
In this paper, we use the class of non-binary hybrid LDPC codes to design very efficient low rate codes. To this end, we consider both asymptotic and finite length designs. First, we present an asymptotic analysis to design hybrid LDPC codes distributions and we explicit the cases when it is useful to use it. Then, by optimizing the algebraic properties of some topologies related to the Tanner graph, we design finite length codes. These codes show significant performance improvements both in the waterfall and in the error floor regions, in comparison with existing state-of-the-art low rate coding schemes, like turbo Hadamard or parallel concatenated Zigzag Hadamard codes, and with no increase of complexity. In particular, the minimum distance of low rate hybrid LDPC codes is by far greater than the ones of previously mentioned codes.
We discuss three structures of modified low-density parity-check (LDPC) code ensembles designed for transmission over arbitrary discrete memoryless channels. The first structure is based on the well-known binary LDPC codes following constructions proposed by Gallager and McEliece, the second is based on LDPC codes of arbitrary (q-ary) alphabets employing modulo-q addition, as presented by Gallager, and the third is based on LDPC codes defined over the field GF(q). All structures are obtained by applying a quantization mapping on a coset LDPC ensemble. We present tools for the analysis of nonbinary codes and show that all configurations, under maximum-likelihood (ML) decoding, are capable of reliable communication at rates arbitrarily close to the capacity of any discrete memoryless channel. We discuss practical iterative decoding of our structures and present simulation results for the additive white Gaussian noise (AWGN) channel confirming the effectiveness of the codes.