DocumentCode
2265020
Title
EXIT charts for non-binary LDPC codes over arbitrary discrete-memoryless channels
Author
Bennatan, Amir ; Burshtein, David
Author_Institution
Dept. of Electr. Eng., Tel Aviv Univ.
fYear
2005
fDate
4-9 Sept. 2005
Firstpage
37
Lastpage
41
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
Keywords
AWGN channels; approximation theory; matrix algebra; memoryless systems; parity check codes; AWGN channel; EXIT charts; Gaussian approximation; Shannon limit; arbitrary discrete-memoryless channels; nonbinary LDPC codes; parity-check matrix; signal constellations; AWGN channels; Constellation diagram; Decoding; Design engineering; Gaussian approximation; Instruments; Parity check codes; Random variables; Signal design; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location
Adelaide, SA
Print_ISBN
0-7803-9151-9
Type
conf
DOI
10.1109/ISIT.2005.1523288
Filename
1523288
Link To Document