2005Unpublished venueRequires access

EXIT charts for non-binary LDPC codes over arbitrary discrete-memoryless channels

Amir Bennatan, David Burshtein

Open publisher page 1 citations

Abstract

We consider coset LDPC codes over GF(q), designed for use over arbitrary channels (particularly nonbinary and asymmetric channels). We show that the random selection of the nonzero elements of the GF(q) parity-check matrix induces a permutation-invariance property on the densities of the messages produced by the decoder. We use this property to show that under a Gaussian approximation, the entire q - 1 dimensional distribution of the vector messages is described by a single scalar parameter. We apply this result to develop EXIT charts for our codes. We use appropriately designed signal constellations to obtain substantial shaping gains. Simulation results indicate that our codes outperform multilevel codes at short block lengths. We also present results for the AWGN channel at 0.56 dB of the unconstrained Shannon limit (i.e. not restricted to any signal constellation) at a spectral efficiency of 6 bits/s/Hz

About this research paper

What this paper is about

We consider coset LDPC codes over GF(q), designed for use over arbitrary channels (particularly nonbinary and asymmetric channels). We show that the random selection of the nonzero elements of the GF(q) parity-check matrix induces a permutation-invariance property on the densities of the messages produced by the decoder. We use this property to show that under a Gaussian approximation, the entire q - 1 dimensional distribution of the vector messages is described by a single scalar parameter. We apply this result to develop EXIT charts for our codes. We use appropriately designed signal constellations to obtain substantial shaping gains. Simulation results indicate that our codes outperform multilevel codes at short block lengths. We also present results for the AWGN channel at 0.56 dB of the unconstrained Shannon limit (i.e. not restricted to any signal constellation) at a spectral efficiency of 6 bits/s/Hz

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We consider coset LDPC codes over GF(q), designed for use over arbitrary channels (particularly nonbinary and asymmetric channels). We show that the random selection of the nonzero elements of the GF(q) parity-check matrix induces a permutation-invariance property on the densities of the messages produced by the decoder. We use this property to show that under a Gaussian approximation, the entire q - 1 dimensional distribution of the vector messages is described by a single scalar parameter. We apply this result to develop EXIT charts for our codes. We use appropriately designed signal constellations to obtain substantial shaping gains. Simulation results indicate that our codes outperform multilevel codes at short block lengths. We also present results for the AWGN channel at 0.56 dB of the unconstrained Shannon limit (i.e. not restricted to any signal constellation) at a spectral efficiency of 6 bits/s/Hz

Key concepts: Low-density parity-check code, Additive white Gaussian noise, Mathematics, Algorithm, Decoding methods, Channel (broadcasting), Scalar (mathematics), Constellation diagram

Related papers

Back to paper searchBrowse research topicsOriginal source
EXIT charts for non-binary LDPC codes over arbitrary discrete-memoryless channels — Research Paper | ScholarLens