Modulation Doping For Iterative Demapping of Bit-Interleaved Coded Modulation
Modulation Doping For Iterative Demapping of Bit-Interleaved Coded Modulation
Modulation Doping For Iterative Demapping of Bit-Interleaved Coded Modulation
1031
I. I NTRODUCTION
Manuscript received June 10, 2005. The associate editor coordinating the
review of this letter and approving it for publication was Dr. James Ritcey.
The research supported by the government of Canada under research grant
NSERC 249704-02.
The authors are with the Institut National de la Recherche Scientifique
(INRS-EMT), University of Quebec, Montreal, Canada (e-mail: {leszek,
chafnaji, hermosil}@emt.inrs.ca).
Digital Object Identifier 10.1109/LCOMM.2005.12008.
c 2005 IEEE
1089-7798/05$20.00
1032
c(t)
Encoder
ex
L k (t)
ap
L b ()
t { . }
s(t)
Decoder
.
1
t { }
r(t)
g(t)
(t)
L k (t)
Fig. 1.
BLER
b()
10
10
System model.
10
|r(t) g(t)a|2
N0
aX0
j=k
|r(t) g(t)a|2
min
N0
aX1k
j=k
where Lak (t) is the a priori LLR for the coded bit ck (t)
obtained from the decoder in the previous iteration, j {a} is
an operator extracting the j-th bit labelling the symbol a X
and Xk is the set of symbols having the k-th bit set to ,
i.e. Xk = {a : k {a} = }. Since the sets Xk depend on
the mappings t {}, the de-mapper must adjust its operation
according to the time t. The decisions about the information
bits b( ) are made from the sign of a-posteriori LLRs Lap
b ( )
produced by the decoder.
The LLRs calculated by the demapper are deinterleaved
(inverting the operation of the bit-level interleaver {} applied prior to the modulation) and fed to the soft-input softoutput (SISO) a-posteriori decoder [11], implemented here
using the max-log simplification. Thanks to the deinterleaver
the LLRs obtained from symbols with different mappings are
spread throughout the data block. The extrinsic LLRs related
to the coded bits and produced by the decoder are used in the
subsequent iterations as a-priori LLRs in (1).
For the numerical simulations presented in this letter, X
is a 16-ary quadrature amplitude modulation (16-QAM) and
Gray and anti-Gray mappings are shown in Fig. 3; the latter
taken from [5]. A systematic recursive convolutional code of
rate R = 12 with generating polynomials {1 23/35}8 is used
[5], bits are not flushed at the blocks end, i.e., the trellis is
Gray
= 0.5
= 0.6
= 0.7
anti-Gray
7
SNR
10
11
SZCZECINSKI et al.: MODULATION DOPING FOR ITERATIVE DEMAPPING OF BIT-INTERLEAVED CODED MODULATION
1
Decoders input/demappers output MIs
0.9
0.8
0.7
Traj
DEC
anti-Gray
= 0.4
Gray
IV. C ONCLUSIONS
0.6
0.5
0.4
0.3
0.2
0.1
0
0
1033
antiGray
Gray
0.2
0.4
0.6
0.8
Demappers input/decoders output MIs
Fig. 3.
Decoders EXIT function (DEC) and the demappers functions
obtained for SN R=6.5dB when using mappings Gray, anti-Gray and for the
proposed modulation doping with = 0.4. For the latter, the EXIT trajectory
(TRAJ) is shown to illustrate the evolution of the MI throughout the iterations.
The labellings Gray and anti-Gray are shown in hexadecimal format.
R EFERENCES
[1] G. Caire, G. Tarrico, and E. Biglieri, Bit-interleaved coded modulation,
IEEE Trans. Inform. Theory, vol. 44, pp. 927946, May 1998.
[2] X. Li and J. A. Ritcey, Bit-interleaved coded modulation with iterative
decoding, IEEE Commun. Lett., vol. 1, pp. 169171, Nov. 2002.
[3] S. ten Brink, Iterative demapping for QPSK modulation, IEE Electronics Lett., vol. 34, pp. 14591460, July 1998.
[4] A. Chindapol and J. A. Ritcey, Design, analysis, and performance
evaluation for BICM-ID with square QAM constellations in rayleigh
fading channels, IEEE J. Select. Areas Commun., vol. 19, pp. 944
957, May 2001.
[5] F. Schreckenbach, N. Gortz, J. Hagenauer, and G. Bauch, Optimization
of symbol mappings for bit-interleaved coded modulation with iterative
decoding, IEEE Commun. Lett., vol. 07, pp. 593595, Dec. 2003.
[6] S. ten Brink, Convergence of iterative decoding, IEE Electronics Lett.,
vol. 35, pp. 806808, May 1999.
[7] M. Tuchler, Design of serially concatenated systems depending on the
block length, IEEE Trans. Commun., vol. 52, pp. 209218, Feb. 2004.
[8] S. ten Brink and G. Kramer, Design of repeat-accumulate codes for
iterative detection and decoding, IEEE Trans. Signal Processing, vol.
51, pp. 27642772, Nov. 2003.
[9] F. Schreckenbach and G. Bauch, Irregular signal constellations, mappings and precoder, in Proc. International Symposium on Information
Theory and its Applications (ISITA), Oct. 2004.
[10] F. Schreckenbach and G. Bauch, Adaptive bit-interleaved coded irregular modulation, in Proc. 14th IST Mobile & Wireless Communications
Summit, pp. 13321336, June 2005.
[11] S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, A soft-input
soft-output APP module for iterative decoding of concatenated codes,
IEEE Commun. Lett., vol. 1, pp. 2224, Jan. 1997.
[12] S. ten Brink, Convergence behaviour of iteratively decoded parallel
concatenated codes, IEEE Trans. Commun., vol. 49, pp. 1727 1737,
Oct. 2001.