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

International Symposium on Turbo Codes and Iterative Information Processing

LDPC codes for the q-ary bit-measurement channel

Rami Cohen, Yuval Cassuto

Published Sep 1, 2016• 3 citations
Publisher

Abstract

In this paper, we introduce a new channel model we term the q-ary bit-measurement channel (QBMC). This channel models a memory device, where q-ary symbols (q = 2s) are stored in the form of current/voltage levels. The symbols are read by measuring a single bit from the symbol in each read step, starting from the most significant bit. An error event occurs when not all the symbol bits are known, e.g., due to a premature termination of the read sequence. To deal with such error events, we propose the use of GF(q) low-density parity-check (LDPC) codes and analyze their iterative-decoding performance. In particular, we show how to exploit the algebraic structure of the QBMC channel for efficient analysis, and study the effect of the Tanner graph's edge-label distribution on the decoding performance. It is shown that for q = 4 the optimal correction of single-bit erasures is achieved by a distribution different from the uniform distribution on the non-zero elements of GF(4).

DOI
10.1109/istc.2016.7593117

Related papers

Finite-length LDPC codes on the q-ary multi-bit channel

Rami Cohen, Yuval Cassuto

In this paper, we address the finite-length decoding performance of LDPC codes over the q-ary multi-bit channel (QMBC). The QMBC is defined over the full q-ary symbols, while addressing the differences in reliability between the bits composing the symbols. We show that unlike the binary erasure channel, the QMBC iterative decoder does not necessarily halt at stopping sets. Instead, its performance depends on the edge-label configuration of the LDPC code graph. We characterize good edge-label configurations, and propose an edge-labeling algorithm for improved iterative-decoding performance. We then provide finite-length maximum-likelihood decoding analysis for both the standard non-binary random ensemble and LDPC ensembles. Finally, simulations are presented to demonstrate the advantages of the proposed edge-labeling algorithm.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•0 citations

Density Evolution for Nonbinary LDPC Codes Under Gaussian Approximation

Ge Li, I.J. Fair, Witold A. Krzymień

This paper extends the work on density evolution for binary low-density parity-check (LDPC) codes with Gaussian approximation to LDPC codes over GF(q) . We first generalize the definition of channel symmetry for nonbinary inputs to include q-ary phase-shift keying (PSK) modulated channels for prime q and binary-modulated channels for q that is a power of 2. For the well-defined q-ary-input symmetric-output channel, we prove that under the Gaussian assumption, the density distribution for messages undergoing decoding is fully characterized by (q-1) quantities. Assuming uniform edge weights, we further show that the density of messages computed by the check node decoder (CND) is fully defined by a single number. We then present the approximate density evolution for regular and irregular LDPC codes, and show that the (q-1) -dimensional integration involved can be simplified using a dimensionality reduction algorithm for the important case of q=2p. Through application of approximate density evolution and linear programming, we optimize the degree distribution of LDPC codes over GF(3) and GF(4). The optimized irregular LDPC codes demonstrate performance close to the Shannon capacity for long codewords. We also design GF(q) codes for high-order modulation by using the idea of a channel adapter. We find that codes designed in this fashion outperform those optimized specifically for the binary additive white Gaussian noise (AWGN) channel for a short codewords and a spectral efficiency of 2 bits per channel use (b/cu).

IEEE Transactions on Information Theory•Feb 26, 2009•82 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

Analysis of Error Floors for Non-binary LDPC Codes over General Linear Group through q-Ary Memoryless Symmetric Channels

T. Nozaki, Kenta Kasai, Kohichi Sakaniwa

In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over general linear groups with those for non-binary LDPC codes over finite fields transmitted through the q-ary memoryless symmetric channels under belief propagation decoding. To analyze non-binary LDPC codes defined over both the general linear group $\mathrm{GL}(m,\mathbb{F}_2)$ and the finite field $\mathbb{F}_{2^m}$, we investigate non-binary LDPC codes defined over $\mathrm{GL}(m_3,\mathbb{F}_{2^{m_4}})$. We propose a method to lower the error floors for non-binary LDPC codes. In this analysis, we see that the non-binary LDPC codes constructed by our proposed method defined over general linear group have the same decoding performance in the error floors as those defined over finite field. The non-binary LDPC codes defined over general linear group have more choices of the labels on the edges which satisfy the condition for the optimization.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2012•1 citation

Analysis of error floors of generalized non-binary LDPC codes over q-ary memoryless symmetric channels

T. Nozaki, Kenta Kasai, Kohichi Sakaniwa

In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over the general linear group with those for non-binary LDPC codes over finite field transmitted over the q-ary memoryless symmetric channel under belief propagation decoding. To analyze non-binary LDPC codes defined over both general linear group GL(m, F2) and finite field F2m, we investigate non-binary LDPC codes defined over GL(m3, F2m4). We propose a method to lower the error floors for non-binary LDPC codes. In this analysis, we see that the optimized non-binary LDPC codes defined over general linear group have the same decoding performance in the error floors as those defined over finite field. The non-binary LDPC codes defined over general linear group have more choices of the labels in the edges which satisfy the condition for the optimization.

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

Design of LDPC codes for the q-ary partial erasure channel

Rami Cohen, Yuval Cassuto

In this paper, we discuss practical design of low-density parity-check (LDPC) codes for the q-ary partial erasure channel (QPEC). This channel is an extension of the binary erasure channel (BEC), where partial information on the output is available. We provide a linear programming (LP) optimization for the design of good degree distributions, and compare our code design results to codes obtained using an LP optimization formulated for the BEC. We show superior performance in terms of code rate and complexity, when designing an LDPC code for a desired decoding threshold.

IEEE Information Theory Workshop (ITW)•Apr 1, 2015•0 citations
In this paper, we introduce a new channel model we term the q-ary bit-measurement channel (QBMC). This channel models a memory device, where q-ary symbols (q = 2s) are stored in the form of current/voltage levels. The symbols are read by measuring a single bit from the symbol in each read step, starting from the most significant bit. An error event occurs when not all the symbol bits are known, e.g., due to a premature termination of the read sequence. To deal with such error events, we propose the use of GF(q) low-density parity-check (LDPC) codes and analyze their iterative-decoding performance. In particular, we show how to exploit the algebraic structure of the QBMC channel for efficient analysis, and study the effect of the Tanner graph's edge-label distribution on the decoding performance. It is shown that for q = 4 the optimal correction of single-bit erasures is achieved by a distribution different from the uniform distribution on the non-zero elements of GF(4).
In this paper, we address the finite-length decoding performance of LDPC codes over the q-ary multi-bit channel (QMBC). The QMBC is defined over the full q-ary symbols, while addressing the differences in reliability between the bits composing the symbols. We show that unlike the binary erasure channel, the QMBC iterative decoder does not necessarily halt at stopping sets. Instead, its performance depends on the edge-label configuration of the LDPC code graph. We characterize good edge-label configurations, and propose an edge-labeling algorithm for improved iterative-decoding performance. We then provide finite-length maximum-likelihood decoding analysis for both the standard non-binary random ensemble and LDPC ensembles. Finally, simulations are presented to demonstrate the advantages of the proposed edge-labeling algorithm.
This paper extends the work on density evolution for binary low-density parity-check (LDPC) codes with Gaussian approximation to LDPC codes over GF(q) . We first generalize the definition of channel symmetry for nonbinary inputs to include q-ary phase-shift keying (PSK) modulated channels for prime q and binary-modulated channels for q that is a power of 2. For the well-defined q-ary-input symmetric-output channel, we prove that under the Gaussian assumption, the density distribution for messages undergoing decoding is fully characterized by (q-1) quantities. Assuming uniform edge weights, we further show that the density of messages computed by the check node decoder (CND) is fully defined by a single number. We then present the approximate density evolution for regular and irregular LDPC codes, and show that the (q-1) -dimensional integration involved can be simplified using a dimensionality reduction algorithm for the important case of q=2p. Through application of approximate density evolution and linear programming, we optimize the degree distribution of LDPC codes over GF(3) and GF(4). The optimized irregular LDPC codes demonstrate performance close to the Shannon capacity for long codewords. We also design GF(q) codes for high-order modulation by using the idea of a channel adapter. We find that codes designed in this fashion outperform those optimized specifically for the binary additive white Gaussian noise (AWGN) channel for a short codewords and a spectral efficiency of 2 bits per channel use (b/cu).
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.
In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over general linear groups with those for non-binary LDPC codes over finite fields transmitted through the q-ary memoryless symmetric channels under belief propagation decoding. To analyze non-binary LDPC codes defined over both the general linear group GL(m,F2)\mathrm{GL}(m,\mathbb{F}_2)GL(m,F2​) and the finite field F2m\mathbb{F}_{2^m}F2m​, we investigate non-binary LDPC codes defined over GL(m3,F2m4)\mathrm{GL}(m_3,\mathbb{F}_{2^{m_4}})GL(m3​,F2m4​​). We propose a method to lower the error floors for non-binary LDPC codes. In this analysis, we see that the non-binary LDPC codes constructed by our proposed method defined over general linear group have the same decoding performance in the error floors as those defined over finite field. The non-binary LDPC codes defined over general linear group have more choices of the labels on the edges which satisfy the condition for the optimization.
In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over the general linear group with those for non-binary LDPC codes over finite field transmitted over the q-ary memoryless symmetric channel under belief propagation decoding. To analyze non-binary LDPC codes defined over both general linear group GL(m, F2) and finite field F2m, we investigate non-binary LDPC codes defined over GL(m3, F2m4). We propose a method to lower the error floors for non-binary LDPC codes. In this analysis, we see that the optimized non-binary LDPC codes defined over general linear group have the same decoding performance in the error floors as those defined over finite field. The non-binary LDPC codes defined over general linear group have more choices of the labels in the edges which satisfy the condition for the optimization.
In this paper, we discuss practical design of low-density parity-check (LDPC) codes for the q-ary partial erasure channel (QPEC). This channel is an extension of the binary erasure channel (BEC), where partial information on the output is available. We provide a linear programming (LP) optimization for the design of good degree distributions, and compare our code design results to codes obtained using an LP optimization formulated for the BEC. We show superior performance in terms of code rate and complexity, when designing an LDPC code for a desired decoding threshold.