Achievable rates optimization for broadcast channels using finite size constellations under transmission constraints
- Zeina Mheich^{1, 2, 3},
- Florence Alberge^{1, 2, 3}Email author and
- Pierre Duhamel^{1, 2, 3}
https://doi.org/10.1186/1687-1499-2013-254
© Mheich et al.; licensee Springer. 2013
Received: 27 June 2013
Accepted: 20 October 2013
Published: 31 October 2013
Abstract
In this paper, maximal achievable rate regions are derived for power-constrained AWGN broadcast channel involving finite constellations and two users. The achievable rate region is studied for various transmission strategies including superposition coding and compared to standard schemes such as time sharing. The maximal achievable rates are obtained by optimizing over both the joint distribution of probability and over the constellation symbol positions. A numerical solution is proposed for solving this non-convex optimization problem. Then, we consider several variations of the same problem by introducing various constraints on the optimization variables. The aim is to evaluate efficiency vs. complexity tradeoffs of several transmission strategies, some of which (the simplest ones) can be found in actual standards. The improvement for each scheme is evaluated in terms of SNR savings for target achievable rates or/and percentage of gain in achievable rates for one user compared to a reference scheme. As an application, two scenarios of coverage areas and user alphabets are considered. This study allows to evaluate with practical criteria the performance improvement brought by more advanced schemes.
Keywords
AWGN broadcast channels Achievable rate region Hierarchical modulation Superposition modulation Superposition coding Constellation shaping Non-convex optimization1 Introduction
During the past few decades, information networks have witnessed tremendous and rapid advances, based on the important growth in the adoption of new wireless technologies, applications and services, first from cellular networks and more recently for computer networks (WLANs). Consequently, wireless networks are exposed to capacity and coverage problems, and the focus is now shifting towards capturing some of the aspects of realistic networks by studying natural network models such as models with broadcasting.
In 1972, achievable rate region is obtained by Cover in [1] for Gaussian broadcast channels with two outputs and generalized by Bergmans to broadcast channels with any number of outputs [2]. Roughly a year later, the optimality of the sets of achievable rates was established by Bergmans [3] and Gallager [4]. Superposition coding is a possible solution to achieve good rate regions in which information intended for high-noise receivers and information intended for low-noise receivers are superimposed and transmitted simultaneously on the same radio resource. The low-noise receivers can always decode messages intended for the high-noise receivers. Thus, they effectively cancel out the interference due to the signal intended for the high-noise receivers, and then decode their own message. The high-noise receivers decode their messages by treating the low-noise receivers message as noise. Superposition coding appears in several contexts in information theory and is closely related to multilevel coding and unequal error protection [5, 6]. Cover showed [1] that the superposition coding reaches the theoretical limit of the capacity region for two user Gaussian broadcast channel using an infinite Gaussian input alphabet for each user. A treatment of the case of multiple transmitter/receivers for the band-limited additive white Gaussian noise channel is given by Bergmans and Cover in [7], where it is proved that superposition coding can achieve higher-rate region than orthogonal schemes such as frequency-division multiple access (FDMA) or time division multiple access (TDMA). However, in actual transmission systems, the channel input is constrained to a finite size alphabet with equal probability symbols. A well-known practical implementation of superposition coding is hierarchical modulation, also called layered modulation, which uses constellations with non-uniformly spaced signal points creating different levels of error protection. Hierarchical modulation is used to mitigate the cliff effect in digital television broadcast and is included in various standards, such as Digital Video Broadcast for Terrestrial Television (DVB-T) [8], DVB to Handhelds (DVB-H), and DVB Satellite services to Handhelds (DVB-SH) [9] standard proposal for mobile digital TV transmission. A study about the performance of hierarchical modulation and a comparison with time sharing strategy in terms of achievable rates can be found in [10].
The restriction imposed by practical systems in using finite signaling constellation and equiprobable symbols reduces the achievable rates and leads to a gap with the capacity region achieved with Gaussian input alphabets for AWGN broadcast channel. This gap can be reduced using a technique called constellation shaping. In fact, most results for constellation shaping with finite signal constellations consider only point-to-point communication systems [11]. Then, the concept of constellation shaping has been adapted to most modern coding and modulation techniques as for example turbo coding and BICM schemes [12–19]. For broadcast channels, the achievable rate region for two-user AWGN broadcast channels with finite input alphabets is derived in [20] when superposition of modulated signal is used as transmission strategy. In their work, the authors assume a uniform distribution over the finite input set. To our knowledge, no study is available about the maximization of the achievable rate region for two-user AWGN broadcast channels with finite size constellations by optimizing over both the joint probability distribution and constellation symbol positions for a broadcast transmission strategy. This general framework encompasses hierarchical modulations as a special case. In this paper, maximal achievable rate regions are derived for power-constrained AWGN broadcast channel of two users with M-pulse amplitude modulation (M-PAM) constellations of M points using various transmission strategies. A numerical solution is proposed for solving this non-concave optimization problem. In a typical broadcast system, there is a trade off between achievable rates and coverage areas. Therefore, we are interested in determining the transmission strategy which provides the best achievable rates or the maximal SNR gain for a given coverage scenario. The compromise between the simplicity of implementation and expected gains is also evaluated.
The organization of the paper is as follows. Section 2 recalls some information theory results on broadcast channels and degraded broadcast channels. In section 3, various transmission strategies for broadcast systems are described. Section 4 gives a formulation of the problem in terms of optimization for the various transmission strategies under consideration. Then, computational aspects are discussed. An iterative algorithm is proposed for the computation of maximal achievable rate regions using superposition coding (general case) and M-PAM constellation or in the particular case of superposition modulation. The proposed algorithm can handle an optimization with respect to the joint distribution of probability or with respect to the positions of constellation symbols. Both variables can also be considered jointly. Obviously, the best results are obtained for the most general case. Our target is to (1) evaluate the loss experienced using simple schemes, (2) identify situations in which complex schemes (non-standard) lead to significant improvements. As an application, we consider, in section 5, several scenarios of coverage areas and user alphabets, and we give conclusions about the transmission strategies which can provide the best trade off between efficiency and complexity of implementation.
2 AWGN broadcast channels
In our system model, W_{1} denotes the private message intended for receiver 1 only, and W_{2} is a common message for both receivers. A typical example of this situation is digital TV broadcasting to two different groups of receivers, classified according to their channel conditions, where the basic signal (common signal) should be available to all receivers. The higher quality is realized by adding the basic signal with an incremental signal (private signal for receivers of good channel conditions) which carries TV signal with a high data rate, such as HDTV.
for some joint distribution ${P}_{{\mathit{\text{UXY}}}_{1}{Y}_{2}}={P}_{\mathit{\text{UX}}}\xb7{P}_{{Y}_{1}|X}\xb7{P}_{{Y}_{2}|X}$ on $\{\mathcal{U}\times \mathcal{X}\times {\mathcal{Y}}_{1}\times {\mathcal{Y}}_{2}\}$[21]. ${P}_{{Y}_{1}|X}$ and ${P}_{{Y}_{2}|X}$ are conditional pdfs that depend on the channel model. P_{ UX } is the joint probability distribution of U and X, where the auxiliary random variable U has cardinality bounded by $\left|\mathcal{U}\right|\le min\left\{\right|\mathcal{X}|,|{\mathcal{Y}}_{1}|,|{\mathcal{Y}}_{2}\left|\right\}$. The capacity region is achieved using superposition coding, where U serves as the center of a cloud of codewords that can be distinguished by both receivers. Since the capacity region of a BC depends only on the conditional marginals, the capacity region of the stochastically degraded BC is equal to that of the corresponding physically degraded channel. Cover [1] showed that in the case of binary symmetric BC and AWGN BC, superposition coding expands the rate region beyond that achievable with time sharing.
for all α∈ [ 0,1], where $C\left(x\right)=\frac{1}{2}\xb7\underset{2}{log}(1+x)$. The theoretical limit of two-user AWGN BC is achieved using signal superposition [1].
3 Broadcast transmission strategies
In this section, various transmission strategies for broadcast systems are described. The strategies are presented in ascending order of implementation complexity. Specifically, by moving from one strategy to another, we release some constraints on the system implementation to reach finally the most complex strategy that can be used to broadcast information for users. Obviously, since the simple schemes can be understood as adding constraints to the most general case, they are less efficient in terms of attainable rates.
3.1 Time sharing
Time sharing (TS) has been widely used in broadcast systems as broadcast transmission strategy. In time sharing scheme, a percentage of time is used to send one message, and the rest of the time is used to send another message. Thus, it is practical to implement because the rate pairs can be achieved by strategies used for point-to-point channel and sharing the time between messages. As in previous works on broadcasting, this situation serves as a reference for the more advanced schemes.
3.2 Hierarchical Modulation (HM)
In two-layer hierarchical modulation, constellation symbols are used to transmit two data streams simultaneously for two users [22, 23]. Constellation symbols are usually chosen with the same probability but may be non-equally spaced. These symbols can be considered as the sum of two lower-order modulations, one for each user. The modulation with higher power is used for the 'bad’ channel, the one with smallest power for the 'good’ channel. Hence, the encoding using hierarchical modulation can be separable for the two streams which is more practical.
3.3 Superposition modulation
In superposition modulation (SM) [24], the M constellation points are used such that the labeling is separable, i.e., M=M_{1}M_{2}, and that the M points are obtained by adding (in ) two rv’s X_{1} and X_{2} of cardinality M_{1} and M_{2}, respectively (${M}_{1},{M}_{2}\in \mathbb{N}\setminus \{0,1\}$). Thus, this scheme is with an enlarged set of feasible labelings than in the previous case [25, 26]. This leads also to U≡X_{2} for superposition modulation because user 2 can distinguish only U.
This work studies several cases of superposition modulation. First, when the constellation symbols for each user are used with equal probability. This case will be denoted as ${\text{SM}}_{\mathcal{X},\overline{{P}_{\mathit{\text{UX}}}},\overline{{P}_{X}}}$. This is a practical case since the encoding of the messages is separable, and the symbols are used with equal probability as in real transmission systems. Then, the constraint of using equiprobable symbols is released and the symbols of user constellations can be dependent and used with non-equal probability (P_{ UX } non-uniform). Thus, the encoding here is done jointly for the two messages. This strategy will be denoted ${\text{SM}}_{\overline{\mathcal{X}},{P}_{\mathit{\text{UX}}},{P}_{X}}$ when the symbols take the values of a standard M-PAM and ${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$, otherwise. In the latter case, the symbol positions can take arbitrary values and will be considered as variables to be optimized. The definition of superposition modulation can be generalized using more general form for P_{ UX } than the uniform case. In superposition modulation, ${2}^{{\mathit{\text{nR}}}_{2}}$ independent codewords u^{ n }=x^{(2)n}(w_{2}) of length n are generated according to P_{ U }; for each of these codewords, ${2}^{{\mathit{\text{nR}}}_{1}}$ satellite codewords v^{ n }=x^{(1)n}(w_{1}) are generated and added to form codewords x^{ n }(w_{1},w_{2})=u^{ n }+v^{ n } according to P_{X|U}. Thus, the fine information v^{ n } is superimposed on the coarse information u^{ n }.
where P_{ UX }[ i,j]=p_{i-1,j-1}= Pr{U=u_{i-1},X=x_{j-1}}. In both cases, the number of elements to be computed is 8.
Note also that P_{ UX } and (of cardinality M) determine the labeling of the input signal constellation for a fixed labeling for ${\mathcal{X}}_{1}$ and ${\mathcal{X}}_{2}$[25, 26]. Thus, the information can be distinguished using the labeling. Consider for example a label ${l}_{k}^{u}$ of ${\mathit{\text{log}}}_{2}\left(\right|{\mathcal{X}}_{2}\left|\right)$ binary labels for u_{ k } and ${l}_{j}^{v}$ of ${\mathit{\text{log}}}_{2}\left(\right|{\mathcal{X}}_{1}\left|\right)$ binary labels for v_{ j } with $k\in \{0,\mathrm{..},|{\mathcal{X}}_{2}|-1\}$ and $j\in \{0,\mathrm{..},|{\mathcal{X}}_{1}|-1\}$. Obviously, the M symbols ${x}_{i},\phantom{\rule{1em}{0ex}}i\in \{0,\mathrm{..},|\mathcal{X}|-1\}$ carry log_{2}(M) binary labels which are the concatenations of the labels of u_{ k } and v_{ j } such as x_{ i }=u_{ k }+v_{ j }.
Part of this work on superposition modulation was presented in [25–27], where the achievable rate regions for ${\text{SM}}_{\mathcal{X},\overline{{P}_{\mathit{\text{UX}}}},\overline{{P}_{X}}}$ and ${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$ strategies are analyzed using a 4-PAM constellation in [25, 26] and for {4,8,16}-PAM constellations in [27]. In this work, the achievable rates are also derived for ${\text{SM}}_{\overline{\mathcal{X}},{P}_{\mathit{\text{UX}}},{P}_{X}}$ using {4,8,16}-PAM constellations.
3.4 Superposition coding
Superposition coding (SC) is one of the basics of coding schemes in network information theory. This idea was first introduced by Cover in an information theoretic study of broadcast channels [1]. In superposition coding, the joint distribution of probability P_{ UX } can take a more general form than in the case of superposition modulation. In this case, the labeling cannot distinguish between the common information and the private information for user 1, a fact which increases the decoder complexity. Indeed, since the auxiliary random variable U has cardinality bounded by $\left|\mathcal{U}\right|\le min\left\{\right|\mathcal{X}|,|{\mathcal{Y}}_{1}|,|{\mathcal{Y}}_{2}\left|\right\}$, we use the name general superposition coding or superposition coding simply to describe the case, where $\left|\mathcal{U}\right|=min\left\{\right|\mathcal{X}|,|{\mathcal{Y}}_{1}|,|{\mathcal{Y}}_{2}\left|\right\}$. For superposition coding and with M-PAM modulation, P_{ UX } is an M×M matrix with elements p_{i,j}.
The basics of superposition coding are briefly recalled below; a detailed description is given in [28]. In this scheme, ${2}^{{\mathit{\text{nR}}}_{2}}$ sequences ${u}^{n}\left({w}_{2}\right),{w}_{2}\in \phantom{\rule{0.3em}{0ex}}[\phantom{\rule{0.3em}{0ex}}1,{2}^{{\mathit{\text{nR}}}_{2}}]$ each i.i.d., are generated randomly and independently to represent the coarse message, each according to $\prod _{i=1}^{n}{p}_{U}\left({u}_{i}\right)$. For each auxiliary sequence, u^{ n }(w_{2}) randomly, conditionally, and independently generates ${2}^{{\mathit{\text{nR}}}_{1}}$ sequences x^{ n }(w_{1},w_{2}) and ${w}_{1}\in \phantom{\rule{0.3em}{0ex}}[\phantom{\rule{0.3em}{0ex}}1,{2}^{{\mathit{\text{nR}}}_{1}}]$, each according to $\prod _{i=1}^{n}{p}_{X|U}\left({x}_{i}\right|{u}_{i}\left({w}_{2}\right))$ to represent the fine message w_{1}. Thus, in superposition coding, the auxiliary random variable U serves as a cloud center for the information, distinguishable by both receivers. In this case, the decoding of information by users is based on large block joint typicality. This comes in contrast with the simpler cases where the message for user 2 was carried by the center of modulation clouds which imply a possible scalar detection.
Strategies under consideration
Transmission | Variables | Constraints | Designation |
---|---|---|---|
SM | Uniform distribution for P_{ UX } | ${\text{SM}}_{\mathcal{X},\overline{{P}_{\mathit{\text{UX}}}},\overline{{P}_{X}}}$ | |
SM | P_{ UX } s.t. $\sum _{i,j}{p}_{i,j}=1$ | Symbol locations: M-PAM | ${\text{SM}}_{\overline{\mathcal{X}},{P}_{\mathit{\text{UX}}},{P}_{X}}$ |
SM | ${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$ | ||
P_{ UX } s.t. $\sum _{i,j}{p}_{i,j}=1$ | |||
SC | P_{ UX } s.t. $\sum _{i}{p}_{i,j}=\frac{1}{M}$ | Symbol locations: M-PAM | ${\text{SC}}_{\overline{\mathcal{X}},{P}_{\mathit{\text{UX}}},\overline{{P}_{X}}}$ |
Uniform distribution for P_{ X } | |||
SC | Uniform distribution for P_{ X } | ${\text{SC}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},\overline{{P}_{X}}}$ | |
P_{ UX } s.t. $\sum _{i}{p}_{i,j}=\frac{1}{M}$ | |||
SC | P_{ UX } s.t. $\sum _{i,j}{p}_{i,j}=1$ | Symbol locations: M-PAM | ${\text{SC}}_{\overline{\mathcal{X}},{P}_{\mathit{\text{UX}}},{P}_{X}}$ |
SC | ${\text{SC}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$ | ||
P_{ UX } s.t. $\sum _{i,j}{p}_{i,j}=1$ |
4 Achievable rate regions
For a two-user Gaussian BC, the theoretical limit of the capacity region is achieved using Gaussian input alphabet for each user. However, practical implementation constraints impose the use of finite input alphabets, and the symbols are usually chosen with equal probability. These restrictions contribute to increase the gap between the capacity region achieved with infinite Gaussian inputs and the throughput obtained in practical situations. In this section, we are interested in computing the achievable rate region of power-constrained AWGN BC when the transmitted signal is modulated using an M-PAM constellation, under the various situations described above. Since the last case (superposition coding) encompasses all previous ones as special cases, the corresponding optimization problems can be solved with the same strategy, which is detailed in this section.
4.1 Problem formulation
Consider a two-user memoryless AWGN broadcast channel (SNR_{1}>SNR_{2}) with signal power constraint P. The channel input belongs to a finite set $\mathcal{X}=\{{x}_{0},\dots ,{x}_{M-1}\}\subset \mathbb{R}$ represented by an M-PAM constellation. Assume a symmetric input signal constellation with respect to the origin. Since has cardinality bounded by $\left|\mathcal{U}\right|\le min\left\{\right|\mathcal{X}|,|{\mathcal{Y}}_{1}|,|{\mathcal{Y}}_{2}\left|\right\}$, and the output alphabet cardinality for an AWGN channel is infinite, we have $\left|\mathcal{U}\right|\le \left|\mathcal{X}\right|$. Thus, $\left|\mathcal{U}\right|\le M$.
where $\overline{{R}_{1}}$ and $\overline{{R}_{2}}$ are achievable rates for PtP channel using standard M-PAM constellation at SNR_{1} and SNR_{2}, respectively. Varying α from 0 to 1 yields achievable rate region.
Problem (9) is not convex; therefore, direct numerical optimization is inefficient. Clearly, an exhaustive search is not feasible as the complexity would be exponential in the total number of variables. An iterative method for solving (9) is proposed in the next section.
4.2 Numerical solution
where ℓ is the iteration index, and denotes the set of constraints on P_{ UX } and can be defined either as $\mathcal{C}=\{{P}_{\mathit{\text{UX}}}\phantom{\rule{0.3em}{0ex}}:\phantom{\rule{0.3em}{0ex}}{p}_{\mathit{\text{ij}}}\ge 0,\sum _{i,j}{p}_{i,j}\phantom{\rule{0.3em}{0ex}}=\phantom{\rule{0.3em}{0ex}}1\}$ or as $\mathcal{C}=\{{P}_{\mathit{\text{UX}}}\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}:\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}{p}_{\mathit{\text{ij}}}\ge 0,\sum _{i}{p}_{i,j}=\frac{1}{M}\}$ (equiprobable symbols). The optimization problem in (17) with constraint set $\mathcal{C}=\{{P}_{\mathit{\text{UX}}}\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}:\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}{p}_{\mathit{\text{ij}}}\ge 0,\sum _{i,j}{p}_{i,j}=1\}$ can be handled by a modified 'Blahut-Arimoto’-type algorithm [29]. Indeed, in order to take into account the regularization, we can show that the Blahut-Arimoto-type algorithm proposed in [30] for broadcast channels should be modified by replacing Equation (19) of Lemma 3 in [30] by ${q}^{\ast}(u,x)=\frac{\beta [Q,\stackrel{~}{Q},\stackrel{\u0304}{Q}](u,\phantom{\rule{0.3em}{0ex}}x)\xb7{e}^{-s\frac{{x}^{2}}{1-\theta}}}{\sum _{{u}^{\prime},{x}^{\prime}}\beta [Q,\stackrel{~}{Q},\stackrel{\u0304}{Q}]({u}^{\prime}\phantom{\rule{0.3em}{0ex}},\phantom{\rule{0.3em}{0ex}}{x}^{\prime})\xb7{e}^{-s\frac{{x}^{\prime 2}}{1-\theta}}}$ instead of ${q}^{\ast}(u,x)=\frac{\beta [Q,\stackrel{~}{Q},\stackrel{\u0304}{Q}](u,\phantom{\rule{0.3em}{0ex}}x)}{\sum _{{u}^{\prime},{x}^{\prime}}\beta [Q,\stackrel{~}{Q},\stackrel{\u0304}{Q}]({u}^{\prime}\phantom{\rule{0.3em}{0ex}},\phantom{\rule{0.3em}{0ex}}{x}^{\prime})}$, where $\beta [\phantom{\rule{0.3em}{0ex}}Q,\stackrel{~}{Q},\stackrel{\u0304}{Q}](u,x)$ is defined in Equation (19) of [30]. When there is an additional constraint on constellation symbols to be equiprobable, i.e., $\mathcal{C}=\{{P}_{\mathit{\text{UX}}}:{p}_{\mathit{\text{ij}}}\ge 0,\sum _{i,j}{p}_{i,j}=1\phantom{\rule{2.77626pt}{0ex}}\text{and}\phantom{\rule{2.77626pt}{0ex}}\sum _{i}{p}_{i,j}=\frac{1}{M}\}$, the Blahut-Arimoto-type algorithm in [30] should also be modified to take into account the additional constraint. In this case, Equation (19) of Lemma 3 in reference [30] should be replaced by ${q}^{\ast}(u,x)=\frac{1}{\left|\mathcal{X}\right|}\xb7\frac{\beta [Q,\stackrel{~}{Q},\stackrel{\u0304}{Q}](u,\phantom{\rule{0.3em}{0ex}}x)}{\sum _{u}\beta [Q,\stackrel{~}{Q},\stackrel{\u0304}{Q}](u,\phantom{\rule{0.3em}{0ex}}x)}$, which does not depend on s, where $\beta [\phantom{\rule{0.3em}{0ex}}Q,\stackrel{~}{Q},\stackrel{\u0304}{Q}](u,x)$ is defined in Equation (19) in this reference.
Now consider (18). The function $L({P}_{\mathit{\text{UX}}}^{\left(\ell \right)},{x}_{0},\mathrm{..},{x}_{M-1},s)$ is not a concave function for all $\mathcal{X}\in {\mathbb{R}}^{M}$. However, we observed in our experiments that $L({P}_{\mathit{\text{UX}}}^{\left(\ell \right)},{x}_{0},\mathrm{..},{x}_{M-1},s)$ is a concave function if $\mathcal{X}\in \mathcal{D}$, where $\mathcal{D}=\{\mathcal{X}\in {\mathbb{R}}^{M}:|{x}_{i}-{x}_{j}|>d\phantom{\rule{2.77626pt}{0ex}}\phantom{\rule{2.77626pt}{0ex}}\forall i,j\in \{0,\mathrm{..},M-1\}\phantom{\rule{2.77626pt}{0ex}}\text{and}\phantom{\rule{2.77626pt}{0ex}}i\ne j\}$, and d depends on the size of the constellation and on the SNR. Since we are interested in finding non-degenerated constellation, we restrict the optimization process to . Then, a simplex method is used to perform the optimization with initial value in .
Numerical solution for solving (9)
Step | Solution | |
---|---|---|
Step 0 | s←s^{(0)} | |
Step k | Step 0 | $\mathcal{X}\leftarrow {\mathcal{X}}^{\left(0\right)}$ where $\mathcal{X}=({x}_{0},{x}_{1},\mathrm{..},{x}_{M-1})$ |
Step ℓ | $\phantom{\rule{-10.0pt}{0ex}}\begin{array}{cc}{P}_{\mathit{\text{UX}}}^{\left(\ell \right)}& =arg\underset{{P}_{\mathit{\text{UX}}}\in \mathcal{C}}{max}L({P}_{\mathit{\text{UX}}},{\mathcal{X}}^{(\ell -1)},{s}^{(k-1)})\phantom{\rule{1em}{0ex}}\left(P1\right)\\ {\mathcal{X}}^{\left(\ell \right)}& =arg\underset{\mathcal{X}}{max}L(\underset{\mathit{\text{UX}}}{\overset{\left(\ell \right)}{P}},\mathcal{X},{s}^{(k-1)})\phantom{\rule{2em}{0ex}}\phantom{\rule{2em}{0ex}}\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\left(P2\right)\end{array}$ | |
Stopping | $\left|L\right({P}_{\mathit{\text{UX}}}^{\left(\ell \right)},{\mathcal{X}}^{\left(\ell \right)},{s}^{\left(k\right)})-L({P}_{\mathit{\text{UX}}}^{(\ell -1)},{\mathcal{X}}^{(\ell -1)},{s}^{(k-1)}\left)\right|\le {\epsilon}_{L}$ | |
criterion | ||
${s}^{\left(k\right)}\phantom{\rule{0.3em}{0ex}}=\phantom{\rule{0.3em}{0ex}}{[\phantom{\rule{0.3em}{0ex}}{s}^{(k-1)}\phantom{\rule{0.3em}{0ex}}-\phantom{\rule{0.3em}{0ex}}\beta (P\phantom{\rule{0.3em}{0ex}}-\phantom{\rule{0.3em}{0ex}}\sum _{i,j}{p}_{\mathit{\text{ij}}}^{\ast}\left({s}^{(k-1)}\right)\xb7{\left({x}_{j}^{\ast}\right({s}^{(k-1)}\left)\right)}^{2}\left)\right]}^{+}$ | ||
where [.]^{+}= max(.,0) | ||
Stopping | ||
criterion | |s^{(k)}-s^{(k-1)}|≤ε_{ s } |
The dual optimization problem mins.t. s≥0f(s) is solved in (19) with a gradient-type algorithm. Since f(s) is convex [31], a gradient search method is guaranteed to converge to a global optimum.
5 Result analysis
5.1 Point to point channel
5.2 Broadcast channel
Current broadcast systems are using two practical transmission schemes for sending information to users: orthogonal schemes in which the time and/or frequency is split between the users, and superposition modulation schemes where the constellation for each user is fixed. In this section, a comparison is provided between these standard schemes and various (more complex) transmission strategies such as superposition coding. The effect of constellation shaping is evaluated by analyzing the achievable rate region curves obtained for an M-PAM constellation (M=4,8,16) and for several pairs (SNR_{1},SNR_{2}). The following schemes are considered:
In the following, we denote by the 'case 1’ of superposition modulation when M_{1}=2,M_{2}=4 and when M_{1}=2,M_{2}=8. 'Case 2’ is when M_{1}=4,M_{2}=2 and when M_{1}=4,M_{2}=4. 'Case 3’ refers to the case when M_{1}=8, M_{2}=2.
Definition 1
Definition 2
5.2.1 Superposition modulation
In this section, the three possible configurations of superposition modulation are compared. We can see from Figures 6, 7, 8, 9, 10, and 11 that${\text{SM}}_{\mathcal{X},\overline{{P}_{\mathit{\text{UX}}}},\overline{{P}_{X}}}$ (optimization of only) outperforms${\text{SM}}_{\overline{\mathcal{X}},{P}_{\mathit{\text{UX}}},{P}_{X}}$ (optimization of P_{ UX } only) in terms of maximal achievable rates per user when M=4. For M=8 and 16,${\text{SM}}_{\overline{\mathcal{X}},{P}_{\mathit{\text{UX}}},{P}_{X}}$ can achieve slightly higher rates than${\text{SM}}_{\mathcal{X},\overline{{P}_{\mathit{\text{UX}}}},\overline{{P}_{X}}}$. The implementation of a system with constellation symbols with non-standard positions and generated with the same probability is less complex than the implementation of a system which generates symbols with non-uniform joint distribution of probability. Thus,${\text{SM}}_{\overline{\mathcal{X}},{P}_{\mathit{\text{UX}}},{P}_{X}}$ does not seem to be of interest since it is not very efficient in terms of achievable rates and is more complex to implement.
Comparison of${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}\left(\text{A}\right)$ and${\text{SM}}_{\mathcal{X},\overline{{P}_{\mathit{\text{UX}}}},\overline{{P}_{X}}}\left(\text{B}\right)$ with respect to${\text{MG}}_{{\text{SNR}}_{\mathit{\text{dB}}}}$ and${\text{MG}}_{{R}_{1}}$
M | SNR_{1} | SNR_{2} | ${\mathbf{\text{MG}}}_{{\mathbf{\text{SNR}}}_{\mathit{\text{dB}}}}\mathbf{\left(}\mathbf{A}\mathbf{\right|}\mathbf{B}\mathbf{)}$ | ${\mathbf{\text{MG}}}_{{\mathbf{R}}_{\mathbf{1}}}\mathbf{\left(}\mathbf{A}\mathbf{\right|}\mathbf{B}\mathbf{)}$ |
---|---|---|---|---|
8 | 0.39 | 7.46% | ||
4 | 10 | 6 | 0.17 | 3.51% |
4 | 0.05 | 1.77% | ||
2 | 0.01 | 0.38% | ||
14 | $0.7{1}^{({M}_{1}=4,{M}_{2}=2)}$ | $20.17{\%}^{({M}_{1}=4,{M}_{2}=2)}$ | ||
8 | 16 | 12 | $0.5{7}^{({M}_{1}=4,{M}_{2}=2)}$ | $13.21{\%}^{({M}_{1}=4,{M}_{2}=2)}$ |
10 | $0.4{1}^{({M}_{1}=4,{M}_{2}=2)}$ | $13.07{\%}^{({M}_{1}=2,{M}_{2}=4)}$ | ||
8 | $0.3{3}^{({M}_{1}=2,{M}_{2}=4)}$ | $18.93{\%}^{({M}_{1}=2,{M}_{2}=4)}$ | ||
16 | $1.0{5}^{({M}_{1}=8,{M}_{2}=2)}$ | $10.67{\%}^{({M}_{1}=8,{M}_{2}=2)}$ | ||
16 | 18 | 14 | $0.8{7}^{({M}_{1}=8,{M}_{2}=2)}$ | $11.54{\%}^{({M}_{1}=8,{M}_{2}=2)}$ |
12 | $0.6{4}^{({M}_{1}=8,{M}_{2}=2)}$ | $12.08{\%}^{({M}_{1}=4,{M}_{2}=4)}$ | ||
10 | $0.4{9}^{({M}_{1}=8,{M}_{2}=2)}$ | $19.53{\%}^{({M}_{1}=4,{M}_{2}=4)}$ |
5.2.2 Time sharing or superposition modulation?
Comparison of ${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}\left(\text{A}\right)$ vs. TS (B) and comparison of ${\text{SC}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}\left(\text{A}\right)$ vs. $\text{TS}\bigcup {\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}\left(\text{C}\right)$
M | SNR_{1} | SNR_{2} | ${\mathbf{\text{MG}}}_{{\mathbf{R}}_{\mathbf{1}}}\mathbf{\left(}\mathbf{A}\mathbf{\right|}\mathbf{B}\mathbf{)}$ | ${\mathbf{\text{MG}}}_{{\mathbf{R}}_{\mathbf{1}}}\mathbf{\left(}\mathbf{A}\mathbf{\right|}\mathbf{C}\mathbf{)}$ |
---|---|---|---|---|
8 | 6.13% | 6.72% | ||
4 | 6 | 11.14% | 11.65% | |
10 | 4 | 18.50% | 16.69% | |
2 | 28.43% | 18.9% | ||
0 | 40.70% | 23.54% | ||
14 | $7.80{\%}^{({M}_{1}=2,{M}_{2}=4)}$ | 7.89% | ||
8 | 16 | 12 | $13.60{\%}^{({M}_{1}=2,{M}_{2}=4)}$ | 11.43% |
10 | $21.15{\%}^{({M}_{1}=2,{M}_{2}=4)}$ | 14.96% | ||
8 | $30.21{\%}^{({M}_{1}=2,{M}_{2}=4)}$ | 14.71% | ||
16 | $10.36{\%}^{({M}_{1}=2,{M}_{2}=8)}$ | 2.96% | ||
16 | 18 | 14 | $16.42{\%}^{({M}_{1}=4,{M}_{2}=4)}$ | 2.94% |
12 | $24.68{\%}^{({M}_{1}=4,{M}_{2}=4)}$ | 5.29% | ||
10 | $35.08{\%}^{({M}_{1}=4,{M}_{2}=4)}$ | 4.80% |
5.2.3 Is superposition coding necessary?
For the three constellations under consideration (M=4,8,16), the maximal achievable rate region obtained by the optimal general case of superposition coding when we consider the general form of P_{ UX } (SC) can achieve, depending on M and user SNRs, a large region of rate pairs (R_{1}+R_{2},R_{2}) that cannot be achieved neither by TS nor by SM. Even when we fully optimize SM (${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$), we are far from maximal achievable rate region. Sometimes, the maximal achievable rate region curve is very close or even coincides with the${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$ achievable rate region in a pair of rates (${R}_{1}^{\ast}+{R}_{2}^{\ast},{R}_{2}^{\ast}$). This is the case when${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$ is the optimal superposition coding in terms of achievable rates. We can see for example in Figure 6 that the pair of rates (${R}_{1}^{\ast}+{R}_{2}^{\ast}=1.096,{R}_{2}^{\ast}=0.531$ which corresponds to the optimal rate pair when we optimize the general case of SC for θ=0.23) is an intersection point with${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$ achievable rate region.
We are interested now in the numerical evaluation of the gain in rate of user 1 (R_{1}+R_{2}) when we use${\text{SC}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$ (full optimization) compared to the best strategy between TS and SM. This gain (${\text{MG}}_{{R}_{1}}\left({\text{SC}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}\right|\mathit{\text{TS}}\bigcup {\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$) calculated in % is the distance between the limit of the maximal achievable rate region and the limit of the union of achievable rate regions of TS and${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$.
The results are reported in Table 4. We observe that the part of the maximal achievable rate region which is unachievable by TS and SM is bigger when M is small because we observe that for the case of 4-PAM, we have one configuration for SM. However, we have two configurations of SM for 8-PAM constellation and three configurations for 16-PAM constellation. Thus, when M increases, the union of achievable rates for all SM cases tends to the sets of achievable rates by the general superposition coding. Asymptotically, we know that when$M\to \infty ,{\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$ is the optimal superposition coding scheme because it allows the capacity region for two-user AWGN BC using Gaussian alphabet for each user to be achieved. Thus, the maximum gain in user 1 rate decreases when the constellation order M increases. We observe also that the gain in achievable rates is high for high values of δ_{SNR}. On the other hand, the experiments show that by using the general superposition coding strategy with the constraint that symbols should be equiprobable (${\text{SC}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},\overline{{P}_{X}}}$), the loss is limited compared to the full optimization (${\text{SC}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$), 4.84%, 7.66%, and 3.94% for the simulated pairs of (SNR_{1},SNR_{2}) when M=4, 8, and 16, respectively. This means that we can use equiprobable symbols with, in general, a small loss in achievable rates. However,${\text{SC}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},\overline{{P}_{X}}}$ is not an interesting case when${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$ can achieve better rates since SM is less complex to implement than SC.
Moreover, with standard M-PAM symbols, the two possible configurations (${\text{SC}}_{\overline{\mathcal{X}},{P}_{\mathit{\text{UX}}},{P}_{X}}$ (optimization of P_{ UX } and P_{ X }) and${\text{SC}}_{\overline{\mathcal{X}},{P}_{\mathit{\text{UX}}},\overline{{P}_{X}}}$ (optimization of P_{ UX } only)) give very similar results in most considered pairs of SNR. We also observe that the loss in maximum achievable rate experienced by user 1 with${\text{SC}}_{\overline{\mathcal{X}},{P}_{\mathit{\text{UX}}},{P}_{X}}$ is less than 10% under the rate experienced with${\text{SC}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$. Thus, we can use standard values of symbol positions without losing much on achievable rates.
In general, one can conclude that fixing constellations of users (i.e., assigning labels to the constellation so that we distinguish between the bits intended for each user) is not optimal for coding and may result in important loss in terms of rates for systems using finite-size constellations especially for low-order constellations. A better solution is to determine the optimal alphabet of the auxiliary alphabet U which is not necessarily a constellation and then to generate the codewords x^{ n } which are not necessarily the sum of two codewords (see Section 3.4).
6 Application: coverage extension
We first consider a transmission over a broadcast channel with finite size input alphabet. For simplicity of the illustration and without loss of generality, let us assume that the existing user alphabet belongs initially to a standard constellation whose symbols are used with equal probability. We assume that the existing user is at distance d_{0} from the sender achieving a rate R_{0}. Some information is also to be transmitted to an upgraded layer of users. The sender can use up to 16 symbols, then several transmission schemes can be used. We are interested in comparing the transmission schemes to serve the new user under two scenarios: either the new user is closer to the transmitter than the existing user or the new user is farther than the existing one. For a target rate R_{0} that is fixed for the existing user and achievable using a standard M-PAM and equiprobable symbols, we are interested in determining the variation of the coverage’s diameter ratio between the two layer of users as a function of the achievable rate by the upgraded user for various broadcast transmission strategies. We assume that$\text{SNR}\propto \frac{1}{{d}^{2}}$.
6.1 The sender can use up to 16 symbols
6.1.1 Scenario 1
In this scenario, the system consists initially of one layer of users. Now, assume that the data information is also to be transmitted to a second layer of users with higher SNR. In the following, we keep the notation from the preceding section, where the user with greater SNR is denoted by user 1. Thus, in this scenario, the legacy receivers are denoted by user 2 which is at a distance d_{2} from the transmitter and achieving a rate R_{0} when the data is modulated using standard 4-PAM constellation and equiprobable symbols. The upgraded receivers are denoted by user 1 (SNR_{1}>SNR_{2}). We intend that the good user receives more throughput than user 2 via the use of 16-PAM.
In this example SNR_{2} is fixed to 10 dB. Initially, user 2’s alphabet belongs to a 4-PAM standard constellation (see section 3.1), and the rate transmitted to user 2 is R_{0}=1.582 bits/ch. use.
Now, a new layer of users called user 1 is introduced in the system with SNR_{1}>SNR_{2}. Our target is to provide the maximum bit rate to the new user without changing R_{0} or d_{0} and using a 16-PAM. By enlarging the constellation and optimizing the symbol positions and probability distribution, we ensure that the rate of the initial user will not decrease after introducing a new user.
Let us assume for example that the new user is midway between the transmitter and user 2 (d_{1}/d_{2}=0.5). Figure 12 shows that the most simple case of superposition modulation (${\text{SM}}_{\mathcal{X},\overline{{P}_{\mathit{\text{UX}}}},\overline{{P}_{X}}}{M}_{2}=8/{M}_{1}=2$) provides 16.3% more bit rate than time sharing for the new user. If we move immediately to a more complex case and optimize P_{ UX } (${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}{M}_{2}=8/{M}_{1}=2$), a gain of 21% is obtained on the bit rate of user 1 compared to time sharing. This gain on achievable rate for the new user is equivalent to a gain of 1 dB on SNR_{1} compared to superposition modulation with uniform P_{UX x}. However, if we move to the most general case of superposition coding, it does not provide significant gain compared to superposition modulation.
Now, we assume that the new user is close to the transmitter such that d_{1}/d_{2}=0.2. We observe that the gain on the bit rate of user 1 using the simple case of superposition modulation increases to 45.7% compared to time sharing. By moving to a more complex case (${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}{M}_{2}=8/{M}_{1}=2$), a gain of 47.8% is obtained on the bit rate of user 1 compared to time sharing. We observe also that it is relevant in this case to move to the most general case of superposition coding since it provides a gain of 61.8% on the bit rate of user 1 compared to time sharing.
Consequently, using superposition modulation provides always noticeable gain compared to time sharing. The general case of superposition coding${\text{SC}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$ is useful when user 1 is close to the transmitter, but not when it is close to user 2.
6.1.2 Scenario 2
Initially, consider a system of one layer of users, denoted by user 1, at a distance d_{1} from the transmitter and achieving a rate R_{0}. Moreover, the alphabet of user 1 belongs to a standard 8-PAM constellation. In this example, SNR_{1} is fixed to 18 dB. Thus, user 1 can achieve a rate R_{0}=2.73 bits/ch. use in the initial situation. In this scenario, we want to serve a second layer of users denoted by user 2 which is farther to the transmitter than the existing user, i.e., SNR_{2}x<SNR_{1}.
Comparison of ${\text{SC}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$ and ${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}{M}_{2}-\text{PAM}/{M}_{1}-\text{PAM w.r.t}{\text{MG}}_{{R}_{2}}$ (%)
d_{2}/d_{1} | SNR_{2} | ${\mathbf{\text{MG}}}_{{\mathbf{R}}_{\mathbf{2}}}$ | M_{2}/M_{1} |
---|---|---|---|
1.2589 | 16 | 4.9416 | 8/2 |
1.4125 | 15 | 20.1521 | 4/4 |
1.5849 | 14 | 12.7522 | 4/4 |
1.7783 | 13 | 8.2192 | 4/4 |
1.9953 | 12 | 7.4536 | 4/4 |
2.2387 | 11 | 41.4993 | 2/8 |
2.5119 | 10 | 30.8293 | 2/8 |
2.8184 | 9 | 22.9121 | 2/8 |
3.1623 | 8 | 16.7443 | 2/8 |
3.5481 | 7 | 12.6033 | 2/8 |
3.9811 | 6 | 10.5427 | 2/8 |
4.4668 | 5 | 10.3343 | 2/8 |
5.0119 | 4 | 11.7414 | 2/8 |
5.6234 | 3 | 16.0961 | 2/8 |
6.3096 | 2 | 22.8535 | 2/8 |
7.0795 | 1 | 32.6194 | 2/8 |
Consequently, the general case of superposition coding can bring significant gains compared to superposition modulation, depending on the diameter of the coverage area for the new layer of users. For superposition modulation, optimizing the joint distribution of probability P_{ UX } provides often significant shaping gains.
6.2 The cardinality of the existing user alphabet is kept fixed
We observe in Figures 14 and 15 that the gain of superposition modulation strategies over time sharing becomes more important when d_{2}/d_{0} (d_{1}/d_{0}) is small. These figures show that using superposition modulation when both symbol positions and P_{ UX } are optimized, we gain around 5% from the initial coverage compared to the case of superposition modulation where symbols are used with equal probability. We can observe also that a reduction of only 10% and 20% in coverage area for the existing user can serve the upgraded user with a rate up to 20% and 35% (9% and 15%) from the rate achieved by the legacy users, using ${\text{SM}}_{\mathcal{X},\overline{{P}_{\mathit{\text{UX}}}},\overline{{P}_{X}}}$. Consequently, by using ${\text{SM}}_{\mathcal{X},\overline{{P}_{\mathit{\text{UX}}}},\overline{{P}_{X}}}$, the legacy receivers still use 4-PAM (8-PAM in scenario 2), and we can serve a new layer of users with an acceptable rate, a small reduction in coverage area, and with less complexity compared to ${\text{SM}}_{\mathcal{X},{P}_{\mathit{\text{UX}}},{P}_{X}}$.
7 Conclusion
In this work we considered the problem of maximizing the achievable rate region for power-constrained AWGN broadcast channel of two users using M-PAM constellations. The achievable rate region is given for various transmission strategies. Maximal achievable rate region for superposition coding and superposition modulation is obtained using constellation shaping. An iterative algorithm was proposed to solve this optimization problem. Then, the efficiency of several strategies are compared. For superposition modulation, the results showed that constellation shaping seems more useful for high values of M. Moreover, the gain in using a complex case of superposition modulation increases when the SNR gap between users decreases. We observed also that superposition modulation outperforms time sharing in a large part of the achievable rate region. On the other hand, it is shown that using the general case of superposition coding can bring important gains compared to classical schemes. We observed also that in the case of finite input alphabet, superposition modulation is not the optimal strategy as in the case of Gaussian input alphabets. Finally, in order to make clear that this paper provides useful tools for the system designer, we considered two scenarios of coverage areas and user alphabets where the systems served initially one layer of users. Then, we propose to serve a second layer of users, and we evaluate the achievable rate of the new layer depending on the broadcast strategy. To improve the system performance compared to time sharing, we can optimize the joint probability distribution and symbol positions of the superimposed modulations or consider the general case of superposition coding. In this work, we showed that the optimization of probabilities was often useful, but not always. However, superposition coding brings sometimes significant gains compared to superposition modulation, depending on the diameter of coverage area for the new layer of users.
This work can also be extended to two-dimensional constellations like M-QAM and other channel models. The maximization achievable rates using various transmission strategies can be performed also using the proposed algorithm based on alternative maximization with respect to symbol positions and the joint distribution of probability.
Declarations
Authors’ Affiliations
References
- Cover TM: Broadcast channels. IEEE Trans. Inform. Theory 1972, 18: 2-14. 10.1109/TIT.1972.1054727MathSciNetView ArticleMATHGoogle Scholar
- Bergmans PP: Random coding theorem for broadcast channels with degraded components. IEEE Trans. Inform. Theory 1973, 19(2):197-207. 10.1109/TIT.1973.1054980MathSciNetView ArticleGoogle Scholar
- Bergmans PP: A simple converse for broadcast channels with additive white Gaussian noise. IEEE Trans. Inform. Theory 1974, 20: 279-280. 10.1109/TIT.1974.1055184MathSciNetView ArticleMATHGoogle Scholar
- Gallager RG: Capacity and coding for degraded broadcast channels. Probl. Infor. Transm 1974, 10(3):185-193.MathSciNetMATHGoogle Scholar
- Imai G, Hirakawa S: A new multilevel coding method using error correcting codes. IEEE Trans. Inform. Theory 1977, 23: 371-377. 10.1109/TIT.1977.1055718View ArticleMATHGoogle Scholar
- Ungerboeck G: Channel coding with multilevel/phase signals. IEEE Trans. Inform. Theory 1982, 28: 55-67. 10.1109/TIT.1982.1056454View ArticleMATHGoogle Scholar
- Bergmans PP, Cover TM: Cooperative broadcasting. IEEE Trans. Inform. Theory 1974, 20: 317-324. 10.1109/TIT.1974.1055232MathSciNetView ArticleMATHGoogle Scholar
- European Telecommunications Standards Institute: EN 300 744: Digital Video Broadcasting (DVB)—framing structure, channel coding and modulation for digital terrestrial television. France,: European Telecommunications Standards Institute; 2004–2006)Google Scholar
- European Telecommunications Standards Institute: ETSI TS 102: Digital Video Broadcasting (DVB)—system specifications for satellite services to handheld devices (SH) below 3 GHz. France: (European Telecommunications Standards Institute; 2008.Google Scholar
- Meric H, Lacan J, Amiot-Bazile C, Arnal F, Boucheret ML: Generic approach for hierarchical modulation performance analysis: application to DVB-SH. In Wireless Telecommunications Symposium. New York: ; 13–15 April 2011.Google Scholar
- Calderbank AR, Ozarow LH: Nonequiprobable signaling on the Gaussian channel. IEEE Trans. Inform. Theory 1990, 36(4):726-740. 10.1109/18.53734MathSciNetView ArticleGoogle Scholar
- Sommer D, Fettweis G: Shaping by non-uniform QAM for AWGN channels and applications using turbo coding. In ITG Conference Source and Channel Coding. Munich, Germany: ; 17–19 Jan 2000.Google Scholar
- Fragouli C, Wesel RD, Sommer D, Fettweis GP: Turbo codes with non-uniform constellations. Proc. IEEE Int. Conf. Commun 2001, 1: 70-73.Google Scholar
- Varnica N, Ma X, Kavcic A: Capacity of power constrained memoryless AWGN channels with fixed input constellations. GLOBECOM 2002, 2: 1339-1343.Google Scholar
- Raphaeli D, Gurevitz A: Constellation shaping for pragmatic turbo-coded modulation with high spectral efficiency. IEEE Trans. Commun 2004, 52(3):341-345. 10.1109/TCOMM.2004.823564View ArticleGoogle Scholar
- LeGoff SY, Khoo BK, Tsimenidis CC, Sharif BS: Constellation shaping for bandwidth-efficient turbo-coded modulation with iterative receiver. IEEE Trans. Wireless Commun 2007, 6(6):2223-2233.View ArticleGoogle Scholar
- Ngo NH, Barbulescu SA, Pietrobon SS: Performance of nonuniform M-ary QAM constellation on nonlinear channels. In Australian Communications Theory Workshop. Australia: ; 2–4 Feb 2005.Google Scholar
- Zhang J, Chen D, Wang Y: A new constellation shaping method and its performance evaluation in BICM-ID. In Vehicular Technology Conference Fall (VTC 2009-Fall). Anchorage, AK: ; 20–23 Sept 2009.Google Scholar
- Valenti M, Xiang X: Constellation shaping for bit-interleaved LDPC coded APSK. IEEE Trans. Commun 2012, 60(10):2960-2970.View ArticleGoogle Scholar
- Huppert C, Bossert M: On achievable rates in the two user AWGN broadcast channel with finite input alphabets. In ISIT. Nice: ; 24–29 June 2007.Google Scholar
- Cover TM, Thomas JA: Elements of Information Theory. Hoboken: Wiley; 2006.MATHGoogle Scholar
- Gledhill J, Macavock P, Miles R: DVB-T: Hierarchical Modulation. Geneva: DVB; 2000.Google Scholar
- Schertz A, Weck C: Technical Review: Hierarchical Modulation-the Transmission of Two Independent DVB-T Multiplexes on a Single Frequency. Switzerland: EBU; 2003.Google Scholar
- Singh VOn superposition coding for wireless broadcast channels. Master’s thesis, Royal Institute of Technology, Sweden (2005). www.ee.kth.se/php/modules/publications/reports/2005/IR-SB-EX-0507.pdf On superposition coding for wireless broadcast channels. Master’s thesis, Royal Institute of Technology, Sweden (2005).
- Mheich Z, Duhamel P, Szczecinski L, Alberi-Morel ML: Constellation shaping for broadcast channels in practical situations. In 19th European Signal Processing Conference. Barcelona: ; 29 Aug–2 Sept 2011.Google Scholar
- Mheich Z, Alberi-Morel ML, Duhamel P: Optimization of unicast services transmission for broadcast channels in practical situations. Bell Labs Techn. J 2012., 17(5–24):Google Scholar
- Mheich Z, Alberge F, Duhamel P: On the efficiency of transmission strategies for broadcast channels using finite size constellations. In 21st European Signal Processing Conference. Marrakech: ; 9–13 Sept 2013.Google Scholar
- Cover TM: Comments on broadcast channels. IEEE Trans. Inform. Theory 1998, 44(6):2524-2530.MathSciNetView ArticleMATHGoogle Scholar
- Blahut RE: Computation of channel capacity and rate-distortion functions. IEEE Trans. Inform. Theory 1972, 18(4):460-473. 10.1109/TIT.1972.1054855MathSciNetView ArticleMATHGoogle Scholar
- Yasui K, Matsushima T: Toward computing the capacity region of degraded broadcast channel. In ISIT. Austin, TX: ; 13–18 June 2010.Google Scholar
- Bertsekas DP: Nonlinear Programming. Nashua: Athena Scientific; 1999.MATHGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.