IEEE TRANSACTIONS ON BROADCASTING, VOL. 57, NO.

2, JUNE 2011

263

Improve the Performance of LDPC Coded QAM by Selective Bit Mapping in

Terrestrial Broadcasting System
Liang Gong, Student Member, IEEE, Lin Gui, Member, IEEE, Bo Liu, Member, IEEE, Bo Rong, Member, IEEE,
Yin Xu, Student Member, IEEE, Yiyan Wu, Fellow, IEEE, and Wenjun Zhang, Senior Member, IEEE

AbstractIn this paper, we employ selective bit mapping to

improve the performance of the LDPC coded QAM scheme for
terrestrial DTV broadcasting system. The threshold of message-passing decoding can be considerably lowered by selectively
mapping the binary components of LDPC codeword to the positions in the m-tuples to be mapped into 2 QAM symbols. In
our approach, the mapping pattern is described by bit-mapping
polynomials, based on which density evolution can be applied.
The optimization algorithm is developed with two implementation
concerns, using the Chinese DTMB standard as an example. Numerical results illustrate that our proposed approach can improve
the decoding threshold by 0.05 dB to 0.499 dB depending on the
code rate and the order of QAM modulation. Simulation results
show that the actual BER improvement varies from 0.09 dB
to 0.6 dB with different code-modulation combinations in both
single-carrier and OFDM modes.
Index TermsBit mapping, decoding threshold, density evolution, DTMB, LDPC codes, PAM/QAM modulation.

I. INTRODUCTION

OW-DENSITY Parity-Check (LDPC) codes, since the

original ground breaking work [1], have been studied
intensively recent years as a class of powerful error-correcting
codes that can asymptotically approach Shannon limit with
increasing code length.
There are two mathematical tools to analyze LDPC codes, i.e.
density evolution [2][4] and the extrinsic information transfer
(EXIT) chart [5]. The first is based on tracking the probability
density or distribution of the extrinsic information exchanged
during the message-passing decoding process, while the second
conducts analysis on the decoding trajectory of the curves of the
extrinsic information exchanged between bit nodes and check
nodes. Both tools can be used for LDPC code analysis, design
and optimization, such as finding decoding threshold given the
degree distribution pair. It must be mentioned that the first one is
more flexible, especially when the density input to the decoder
does not have an explicit expression.
Manuscript received August 23, 2010; revised November 26, 2010; accepted
February 02, 2011. Date of publication March 14, 2011; date of current version
May 25, 2011. This work was supported by the Major State Basic Research
Development Program of China under 973Program, Grant 2009CB320403, the
111Project (B07022), and the Shanghai Key Laboratory of Digital Media Processing and Transmissions, and it was supported in part by the National Hi-Tech
Research and Development Program of China under National 863Program,
Grant 2009AA011505, and Shanghai Science and Technology Development
Funds (10QA1403600).
L. Gong, L. Gui, B. Liu, Y. Xu, and W. Zhang are with the Department
of Electrical and Electronic Engineering, Shanghai Jiao Tong University,
Shanghai 200240, China (e-mail: gong_liang@sjtu.edu.cn;guilin@sjtu.edu.cn;
liubo_lb@sjtu.edu.cn; xuyin@sjtu.edu.cn; zhangwenjun@sjtu.edu.cn).
B. Rong and Y. Wu are with the Communication Research Center, Ottawa,
ON K2H 8S2, Canada (e-mail: bo.rong@crc.ca; yiyan.wu@crc.ca).
Digital Object Identifier 10.1109/TBC.2011.2115010

In addition to the topics on theoretical analysis, abundant

works on practical design and application of the code have been
published over the years. For example, the QC-LDPC codes not
only show very good error-correcting capability but also possess
the quasi-cyclic structure that facilitates high-throughput hardware implementation [6], [7]; the non-binary LDPC code decan be easily combined with -ary modulafined over
tions [8]; and the last but not the least, LDPC codes can be combined with bandwidth-efficient modulations to form bit-interleaved coded modulation (BICM) scheme that shows good performance in AWGN [9] and fading channels [10][12]. Due to
its excellence in error correction and flexibility to be embedded
into communication systems, LDPC code is favored by many
performance-critical systems and standards, especially the terrestrial DTV broadcasting standards, such as the Digital Terrestrial Multimedia Broadcast (DTMB) standardthe terrestrial
DTV standard in China [13][15], and the ETSI DVB-T2 standardthe second generation terrestrial DTV standard in Europe
[16].
In this paper, it is shown that the performance of the LDPC
coded quadrature-amplitude modulation (QAM) scheme can be
improved by introducing a bit mapper in between the LDPC
encoder and the QAM modulator. By selectively mapping the
codewords binary components to the positions of m-tuples of
the QAM symbols, the message-passing decoding threshold of
LDPC code can be lowered. The concept behind is to exploit
the irregularity of LDPC code and the unequal protection property of high-order QAM modulation. The bit position of an
m-tuple correspondent to a QAM symbol is modeled by symmetric binary-input additive white Gaussian noise (BAWGN)
sub-channels, so that the noise variance can be computed given
the signal-to-noise power ratio (SNR). Based on this model,
density evolution is applied to generate the optimal bit-mapping
polynomials that ensure low decoding threshold. The LDPC
coded QAM scheme of the DTMB standard is taken as an example to implement the proposed bit mapping. The numerical
results of decoding thresholds and polynomials of optimized bit
mapping are compared with those of sequential mapping, which
is the default way of mapping by the standard. Moreover, the
actual BER improvement is shown through simulations over
AWGN channel in both single-carrier and OFDM modulation
modes.
The rest of this paper is organized as follows. The system
model is introduced with the QAM sub-channels in Section II.
The optimization algorithm of bit mapping is proposed in
Section III along with the discussion of some implementation
issues. Finally, numerical and simulation results are presented
in Section IV, followed by the conclusion and future works in
Section V.

0018-9316/$26.00 2011 IEEE

264

IEEE TRANSACTIONS ON BROADCASTING, VOL. 57, NO. 2, JUNE 2011

Fig. 1. Block diagram of the LDPC coded QAM system.

II. SYSTEM MODEL

A. System Description
We depict the transceiver block diagram of the LDPC coded
modulation system in Fig. 1. It shows that the transmitter encodes the binary information bits, groups the codewords into
and maps each m-tuple to a QAM conm-tuples
by Gray labeling, with
denoting
stellation point ,
the set of complex constellation points. Due to Gary labeling,
a complex
symbol consists of two independent parallel real
symbols and thus the analysis can be reduced
from two-dimensional to one-dimensional. For this reason, we
will not differentiate between the
and
modulations in our study.
At the receiver side, let ,
denote the channel observation and
denote the mutual information between transmitted symbols and the observation. The
demodulator extracts the logarithm likelihood ratios (LLR) for
each bits in the m-tuples from the channel observations , which
are required by the LDPC decoder. By use of these soft messages, iterative message-passing decoding can be performed. It
is worth noting that an LDPC coded modulation system, such
as the DTMB standard, may support both single-carrier and
OFDM modulation modes and involve a symbol interleaver to
combat multi-path and fading channels.
B. Modeling of Sub-Channels
The extraction of LLR from the received symbols is called
soft demodulation. There are two ways of soft demodulation.
One way is to extract the values by levels, i.e. based on the chain
rule of mutual information, where

Fig. 2. Symbol and bit channel capacity of different QAM modulations subject
to AWGN. (a) 4PAM/16QAM. (b) 8PAM/64QAM.

(1)
the other is to extract in parallel, where
(2)
Theoretically, the first way performs better, since it is mutualinformation preserving. However,
implies
that the demodulation of will rely on the previously demodulated information
, which can lead to error propagation. To overcome this drawback, error-correcting codes are
adopted to protect each component level, though with the cost
of extra latency.
Practically, the second way of demapping is preferred, because it treats each bit independently and thus does not have
the problem of error propagation. Moreover, it can be combined

with a bit-level interleaver to form the scheme of bit-interleaved

coded modulation (BICM) [10] that can improve coding gain.
This scheme is especially powerfully over fading channels. In
our work, we borrow the idea originated from BICM, which
deems the virtual channel between
and
as independent
binary-input memoryless sub-channels. For PAM/QAM modulation, the sub-channels are also symmetric when the symbol
channel is symmetric, and thus the channel capacity equals the
mutual information
. Let
denote the channel between and , i.e. the channel of symbol level, and
denote the channel between and , i.e. the bit-level sub-channel.
Fig. 3 demonstrates the model of splitting a symbol channel into
bit-level sub-channels in the upper gray box.
The capacity of sub-channels for 4PAM/16QAM and 8PAM/
64QAM over AWGN channel are shown in Fig. 2(a) and (b),

IEEE TRANSACTIONS ON BROADCASTING, VOL. 57, NO. 2, JUNE 2011

265

Fig. 3. Block diagram of PAM/QAM demodulation and LDPC decoding.

respectively. Since there is no close expression for the capacity

function, the curves are obtained through numerical calculation.
The figures show that different bit-level sub-channels of the correspondent modulations possess different channel capacities at
the same SNR level. The difference in capacity implies the difference in noise levels on the sub-channels. Therefore, if the
PAM/QAM is regarded as an encoder, then it provides different
levels of protection for the component bits. This is often referred
to as the unequal protection property. Without loss of generality, we assume that the sub-channels are symmetric BAWGN
channels. This modeling addresses that Gaussian noise maximizes the noise entropy when the noise power is fixed, i.e.
Gaussian channel is the worst case in power-limited communication system. This diversified capacity of sub-channels can
be exploited by the LDPC code to improve the decoding performance [9], [12].
III. IMPROVE CODE PERFORMANCE BY SELECTIVELY
BIT MAPPING
A. Bit Mapping
In Fig. 3, the QAM demodulation and LDPC decoding
scheme at the receiver side is depicted. Noting the block in
between the QAM demodulator and the LDPC decoder, it associates the LDPC codeword components with the sub-channels
created by the QAM modulation. Generally, this association is
not explicitly defined, and in practice it is done in sequential
order.
On one hand, a symbol of the
modulation
provides unequal protection for its component bits, and each
bit is associated with a variable node of the LDPC codes. On
the other hand, the degree of the variable node characterizes the
error-correcting capability of this node, and it also impacts the
whole convergence behavior of the iterative message-passing
decoding process. Hence, the way in which the sub-channels
are connected to the variable node is crucial that can affect the
decoding threshold of the LDPC codes.

Based on the consideration above, we believe that additional

SNR improvement, or coding gain, of the LDPC coded QAM
scheme can be obtained by properly defining the association between the LDPC codeword components and the sub-channels
of modulation symbols. We name this association by bit mapping, which works as follows. At the transmitter, the bit mapper
maps the binary bits of LDPC codeword to the sub-channels of
the PAM/QAM according to a certain predefined pattern; at the
receiver, reversely, the bit demapper demaps the demodulated
soft values back to the correspondent codeword components for
message-passing decoding.
Enlightened by the idea that the degree distribution pair defines the ensemble performance of LDPC codes, we hope to describe this connection of variable nodes with sub-channels in an
ensemble sense as well, rather than by certain particular mapping patterns. Therefore, borrowing the polynomial representation node-degree distribution in [2], we define the fraction of the
variable nodes that connected to the -th kind of sub-channel by
the polynomial
,
, where
(3)
, is the fraction of the variable nodes
Clearly, the coefficient,
of degree mapped to the -th sub-channel. Moreover,
depend on the order of modulation as well as the variable node
profile of the underlying LDPC code. Hence, the coefficients of
are subject to the following constraints:
(4)
with
being the fraction of the variable nodes of degree of
the underlying LDPC code. We will call
,
,
the bit-mapping polynomials. By introducing this definition,
the LDPC decoding threshold with bit-mapping can be lowered through optimizing these polynomials by use of density
evolution.

266

IEEE TRANSACTIONS ON BROADCASTING, VOL. 57, NO. 2, JUNE 2011

B. Optimization of Bit Mapping

The idea of density evolution is to track the change of probability density function of the extrinsic messages exchanged
during the iterative message-passing decoding process. It can
be used for determining the decoding threshold given the degree
distribution polynomial [2]. In this case, it can be employed to
find the polynomials with optimal coefficients resulting in the
lowest decoder threshold.
The mapping polynomial optimization algorithm is listed in
Algorithm 1. In the algorithm, the candidate mapping polynomials are firstly generated and then density evolution is apconditioned on
plied to estimate the decoding threshold
these polynomials.
is defined by the minimal value of
signal-to-noise power ratio (SNR) that ensures that the probability density function at the bit-node move toward infinity
, which also implies that the
as decoding iterations
bit error probability approaches to infinitely small. When the
lowest achievable SNR is reached within some predefined precision , the algorithm stops and output the optimal mapping
is always the lowest achievable
polynomials. Note that
threshold, and once a lower threshold is achieved,
is assigned to the new value and the corresponded coefficients
are saved.
Algorithm 1

Optimization Algorithm

1:Initialization:

, for all , ,

2:while Flag do
subject to the constraint of (4);

3:

Generate

4:

Run density evolution using

;

5:

if

then

6:
7:

, save

;
then

if

8:

to find decoding threshold

9:

end if

10:

end if

11:end while
12:Output

and

Moreover, it is worth pointing out that this optimization is

different from the degree optimization in LDPC code design.
Firstly, it is subjected to the degree profile of the underlying
LDPC code, i.e., the variable node distribution is already given
by the original code and the optimization is to associate the variable nodes to sub-channels created by PAM/QAM modulations;
secondly, only the variable node degree distribution
is concerned with in the optimization, and the check node degree distribution
remains fixed.
C. Implementation Issues
Two implementation issues concerning Algorithm 1 will be
discussed in this section.

: The very first step of Algorithm

1) Generation of
1 is to generate the coefficients of the polynomials subject to
the constraints (4). Pure random generation will definitely lead
the algorithm to converge in a very long time. Therefore, two
methods of generation are suggested here.
The first method is to use differential evolution [4], which is
a genetic algorithm. This method is also adopted to optimize the
degree distribution pair of LDPC codes for a fixed code rate.
The second one, as we propose, is a coarse-to-fine exhaustive
searching method. The idea is to discretize the solution space to
the equation set defined by (4); then by use of the set of discrete
solutions the area where the optimal coefficients lie in can be
located. By refining the discretizing interval further, the optimal
result can then be obtained.
number of variable node
For example, suppose there are
degrees in total, thus the dimension of the solution space is
. Since
, the discretizing interval of
can be set, for example, to be
,
i.e.,
(5)
Thus, by apply density evolution to all the discrete
solutions, the one that results in the lowest decoding threshold
can be found, which is denoted by
. Then,
change the discretizing interval to be, say,
, and confine
; again by
going over all the
solutions, an even lower threshold with
coefficients with finer precision can be obtained, i.e.,
. This refining process can be carried on until a certain precision is reached. In fact, practically, since the mapping
is done on binary component basis, it is enough to set the precision to the decimal place of the reciprocal of the underlying
code length. Thus, the refining process needs at most
rounds with being the code length.
2) Initialization of Density Evolution: Density evolution requires the probability density function of the initial LLR messages. After the
/
soft demodulation, the likelihood messages input to the decoder are from kinds of virtual
BAWGN sub-channels, and thus the noise variance over these
sub-channels needs to be computed. For a given SNR and modulation order, the computation can be done in the following way:
Step 1) Calculate the capacity of the sub-channels given
SNR, i.e.,
for all
;
for
Step 2) Compute
, where
denotes the inverse the capacity formula of BAWGN channel,
.
Taking the 8PAM/64QAM as an example, we depict the above
steps in graphic form in Fig. 4. By this method, the initial probability density at the variable node of degree
can be represented by
(6)
which is a weighed linear combination of the densities of messages from
different sub-channels. Here,
is the
normal density function with mean and variance .

IEEE TRANSACTIONS ON BROADCASTING, VOL. 57, NO. 2, JUNE 2011

267

Fig. 4. Computation of noise variances on sub-channels.

TABLE I
BIT-MAPPING POLYNOMIALS AND DECODING THRESHOLD FOR THE RATE-0.4 CODE

IV. NUMERICAL RESULTS

In this section, the performance of the proposed selective
bit-mapping scheme is evaluated, in particular, on the DTMB
LDPC coded modulation scheme. The study begins with the optimization of bit-mapping polynomials and is followed by the
assessment of bit error rate (BER) performance of selective bit
mapping over AWGN channel.
The DTMB standard adopts a set of length-7488 (shortened
from 7493) irregular QC-LDPC codes of rates 0.4, 0.6 and 0.8.
It also employs the QAM modulations ranging from 4QAM to
64QAM. Since the 4QAM does not provide any unequal protection, 4PAM/16QAM and 8PAM/64QAM modulations are targeted in the bit-mapping polynomials optimization.
A. Optimized Bit-Mapping Polynomials
With Algorithm.1, we optimized the bit-mapping polynomials for the DTMB LDPC coded modulation scheme. The
results are listed in Tables IIII, respectively corresponding to
a code rate. In each table, the variable node degree distribution
of the LDPC code is listed in the top row; for each modulation
mode, the polynomials of sequential mapping and optimized
mapping are listed as well as their correspondent decoding
thresholds. By the standard, sequential mapping is the default
way of mapping which associates the variable nodes with

sub-channels in sequential order. Therefore, it is equivalent to

mapping uniformly and the correspondent mapping polynomials equal
,
. For optimized
mapping, the polynomials are the results of Algorithm 1.
It can be observed that for rate-0.4 code, the decoding
threshold is reduced by 0.296 dB and 0.499 dB for
4PAM/16QAM and 8PAM/64QAM modulations, respectively, and the reduction is 0.21 dB and 0.328 dB for rate-0.6
code, 0.048 dB and 0.1 dB for rate-0.8 code, respectively. The
numerical results illustrate that, from the code rate perspective,
the improvement of the lower-rate code is greater than that of
the higher-rate code for each modulation mode, and that, from
the modulation perspective, higher-order modulation receives
better improvement than the lower-order one for individual
code rate. The first phenomenon can be explained by the fact
that large check degree will prohibit those good variable
nodes, i.e., nodes connecting to sub-channels with greater
capacity, from helping the bad variable nodes, i.e. nodes
connecting to sub-channels with smaller capacity. As a result,
the variable nodes connecting to good sub-channels only have
a limited devotion to the whole decoding process. In terms
of the DTMB LDPC codes, the rate-0.8 code has check node
degrees 27 and 28, while those values are 7 and 8 for rate-0.4
code, and 12 and 13 for rate-0.6 code. Thus, the margin of
optimization for rate-0.8 code is largely limited by its high

268

IEEE TRANSACTIONS ON BROADCASTING, VOL. 57, NO. 2, JUNE 2011

TABLE II
BIT-MAPPING POLYNOMIALS AND DECODING THRESHOLD FOR THE RATE-0.6 CODE

TABLE III
BIT-MAPPING POLYNOMIALS AND DECODING THRESHOLD FOR THE RATE-0.8 CODE

Fig. 5. BER performance of the DTMB LDPC coded QAM scheme. (a) Single-carrier 4PAM/16QAM. (b) OFDM 8PAM/64QAM.

check node degrees. For the second phenomenon, the reason

is that higher-order modulation can provide more sub-channel
diversities than the low-order one, and hence there is much
more room for optimization.
B. BER Performance
Using the mapping polynomials from the previous section,
we simulated the selective bit-mapping scheme over AWGN
channel. The simulation for the 4PAM/16QAM coded modulation is carried out in single-carrier mode and the simulation for
the 8PAM/64QAM is in OFDM mode. Throughout the simulation, at least 20,000 and at most 300,000 encoded data blocks

are transmitted and decoded. The sum-product decoding algorithm is adopted and the maximum decoding iteration is set to
be 50. The compiled statistics for BER is to the level of
.
The BER curves of single-carrier 4PAM/16QAM and OFDM
8PAM/64QAM modes, as well as the decoding thresholds, are
plotted in Fig. 5(a) and (b), respectively.
In the figures, the differences in the curves between sequential and optimized mapping are marked regarding the decoding
thresholds and BER. In general, the improvement in BER are
consistent with those of the thresholds estimated by density evolution. The results of single-carrier 4PAM/16QAM in Fig 5(a)
show that the improvement of rate-0.4 code by bit mapping
is about 0.25 dB, and the improvement is about 0.18 dB for

IEEE TRANSACTIONS ON BROADCASTING, VOL. 57, NO. 2, JUNE 2011

rate-0.6 code and around 0.09 dB for rate-0.8 code. For the case
of OFDM 8PAM/64QAM in Fig 5(b), the BER performance is
improved by 0.6 dB for rate-0.4 code, 0.34 dB for rate-0.6 code
and 0.11 dB for rate-0.8 code, respectively. The actual BER improvement for rate-0.4 and 0.6 code is a little bit less than the
estimated threshold for 4PAM/16QAM but greater for 8PAM/
64QAM, while the BER improvement for rate-0.8 code betters
the numerical prediction in both cases. It is worth pointing out
that the BER performance in AWGN channel is carrier-modulation independent, so that similar results can be obtained for
OFDM 4PAM/16QAM and single-carrier 8PAM/64QAM modulation. The above observations indicate that the results of numerical estimation by Algorithm 1 are relatively accurate and
the bit-mapping scheme is practically feasible.
In particular, we must mention that the rate-0.4 code appears
error floor by the optimized bit mapping with the following
reason. In the mapping polynomials, large portions of low degree variable nodes are mapped to the relatively worse sub-channels. Moreover, the rate-0.4 code itself works at low SNR level.
As a result, the errors from those worse sub-channels will dominate at relatively high SNR levels and these errors are not easy
to be recovered because of the low variable node degree.
V. CONCLUSION
In this paper, a technique called bit mapping is proposed for
the LDPC coded QAM scheme of terrestrial DTV broadcasting
system. By selectively mapping the variable nodes to the subchannels created by QAM modulations, the LDPC decoding
performance can be improved. As an example, this technique
is applied on the LDPC coded QAM of the DTMB standard.
The improvement in performance is shown numerically by decoding threshold as well as the BER simulation over AWGN
channel. Although LDPC codes itself can be optimized especially for a given QAM modulation, it is impractical to design
a code tailored for each modulation mode when standardizing
a system. Therefore, the practical aspect of this work is that the
code performance can be further optimized for different modulation modes by selectively bit mapping for fixed LDPC codes in
standard terrestrial broadcasting systems. In this work, bit mapping is optimized in the scenario of AWGN channel, but scenarios, such as multi-path and fading channels, still need further
investigation. In addition, the rate-0.4 code appears error floor
by bit mapping, though at relatively low BER level. This leads
to another interesting topic of how to trade off between the theoretically optimized decoding threshold and the error floor.

269

ACKNOWLEDGMENT
The authors would like to thank the anonymous reviewers for
the their valuable comments, which help to improve the quality
the paper.
REFERENCES
[1] R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA:
MIT Press, 1963.
[2] T. Richardson and R. L. Urkanke, Modern Coding Theory.. Cambridge, U.K.: Cambridge University Press, 2008.
[3] S.-Y. Chung, T. Richardson, and R. Urbanke, Analysis of sum-product
decoding of low-density parity-check codes using a Gaussian approximation, IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 657670, Feb.
2001.
[4] J. Hou, P. Siegel, and L. Milstein, Performance analysis and code optimization of low-density parity-check codes on Raleigh fading channels, IEEE J. Sel. Areas Commun., vol. 19, no. 5, pp. 924934, May
2001.
[5] S. ten Brink, G. Kramer, and A. Ashikhmin, Design of low-density parity-check codes for modulation and detection, IEEE Trans.
Commun., vol. 52, no. 4, pp. 670678, Apr. 2004.
[6] N. Jiang, K. Peng, J. Song, C. Pan, and Z. Yang, High-throughput
QC-LDPC decoders, IEEE Trans. Broadcast., vol. 55, no. 2, pp.
251259, Jun. 2009.
[7] L. Zhang, L. Gui, Y. Xu, and W. Zhang, Configurable multi-rate decoder architecture for QC-LDPC codes based on broadband broadcasting system, IEEE Trans. Broadcast., vol. 54, no. 2, pp. 226235,
Jun. 2008.
[8] B. Rong, T. Jiang, X. Li, and M. Soleymani, Combine LDPC codes
( ) with -ary modulations for bandwidth efficient transmisover
sion, IEEE Trans. Broadcast., vol. 54, no. 1, pp. 7884, Mar. 2008.
[9] G. Richter, A. Hof, and M. Bossert, On the mapping of low-density parity-check codes for bit-interleaved coded modulation, in Proc.
IEEE ISIT , Jun. 2007.
[10] G. Caire, G. Taricco, and E. Biglieri, Bit-interleaved coded modulation, IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 927946, May 1998.
[11] Y. Wang, L. Xie, H. Chen, and K. Wang, Improved decoding algorithm of bit-interleaved coded modulation for LDPC code, IEEE
Trans. Broadcast., vol. 56, no. 1, pp. 103109, Mar. 2010.
[12] H. Sankar, N. Sindhushayana, and K. Narayanan, Design of low-density parity-check (LDPC) codes for high order constellations, in Proc.
IEEE GLOBECOM , Dec. 2004, vol. 5, pp. 31133117.
[13] W. Zhang, Y. Guan, W. Liang, D. He, F. Ju, and J. Sun, An introduction of the Chinese dttb standard and analysis of the pn595 working
modes, IEEE Trans. Broadcast., vol. 53, no. 1, pp. 813, Mar. 2007.
[14] J. Song, Z. Yang, L. Yang, K. Gong, C. Pan, J. Wang, and Y. Wu, Technical review on Chinese digital terrestrial television broadcasting standard and measurements on some working modes, IEEE Trans. Broadcast., vol. 53, no. 1, pp. 17, Mar. 2007.
[15] X. Wang, J. Wang, J. Wang, Y. Li, S. Tang, and J. Song, Embedded
transmission of multi-service over dtmb system, IEEE Trans. Broadcast., vol. 56, no. 4, pp. 504513, Dec. 2010.
[16] Frame Structure, Channel Coding and Modulation for a Second Generation Digital Terrestrial Television Broadcasting System (DVB-T2),
ETSI Std. EN 302 755 V1.1.1, Sep. 2009.

GF q