A hybrid TIM-NOMA scheme for the Broadcast Channel
EEAI Endorsed Transactions on Wireless Spectrum MM -MM YYYY | Volume __ | Issue __ | e_
EAI Endorsed Transactions on Wireless Spectrum
Editorial A hybrid TIM-NOMA scheme for the Broadcast Channel
V. Kalokidou *, O. Johnson and R. Piechocki Communication Systems and Networks Research Group, School of Engineering, University of Bristol, Bristol, UK. School of Mathematics, University of Bristol, Bristol, UK. Communication Systems and Networks Research Group, School of Engineering, University of Bristol, Bristol, UK.
Abstract
Future mobile communication networks will require enhanced network efficiency and reduced system overhead. Research on Blind Interference Alignment and Topological Interference Management (TIM) has shown that optimal Degrees of Freedom can be achieved, in the absence of Channel State Information at the transmitters. Moreover, the recently emerged Non-Orthogonal Multiple Access (NOMA) scheme suggests a different multiple access approach, compared to the orthogonal methods employed in 4G, resulting in high capacity gains. Our contribution is a hybrid TIM-NOMA scheme in K -user cells, where users are divided into T groups. By superimposing users in the power domain, we introduce a two-stage decoding process, managing “inter-group” interference based on the TIM principles, and “intra-group” interference based on Successful Interference Cancellation, as proposed by NOMA. We show that the hybrid scheme can improve the sum rate by at least 100% compared to Time Division Multiple Access, for high SNR values. Keywords:
Topological Interference Management, Non-Orthogonal Multiple Access. Received on DD MM YYYY, accepted on DD MM YYYY, published on DD MM YYYY Copyright © YYYY Author et al. , licensed to ICST. This is an open access article distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited. doi: 10.4108/_______________ * Corresponding author. Email: [email protected].
1. Introduction
Future increase in the number of mobile devices, using data-hungry applications, will lead to highly dense cellular networks, demanding high capacity performance with the least possible system overhead. As mentioned in [1], in the 2020s, the volume of mobile traffic is expected to increase by a factor of 500, and future radio access should aim at a spectrum efficiency enhancement, which will be at least 3 times larger than that of Long-Term Evolution (LTE). The traditional case of Time Division Multiple Access (TDMA), since it has bounded total Degrees of Freedom (DoF), cannot constitute an optimal interference management technique for future mobile networks. Novel interference management schemes, categorised into a) interference shaping (e.g. Interference Alignment (IA), Interference Neutralization), and b) interference exploitation (e.g. Network Coding), reviewed in [2], can provide more DoF and improve the performance of communication networks. Interference Alignment, introduced by Maddah-Ali, Motahari and Khandani in [3] and Cadambe and Jafar in [4], allows in the 𝐾 -user interference channel 𝐾 / Degrees of Freedom (DoF) to be achieved, assuming global perfect CSI. IA differs from other interference management schemes, as it attempts to align interference, rather than avoid, reduce or cancel it. However, IA requirement of full CSI is infeasible and costly. The scheme of Blind IA (BIA), presented by Wang, Gou and Jafar in [5] and Jafar in [6], for certain network scenarios, can achieve full DoF in the absence of CSI at the transmitters (CSIT), reducing considerably the system overhead. Additionally, in [7] Jafar introduces how the BIA scheme can be employed in certain cellular networks, including heterogeneous networks, by seeing frequency reuse as a simple form of IA. Usually, when interference is strong, when compared to the desired signal, it is decoded, whereas when the interference signal is weaker than the desired link, then interference is treated as noise. In [8], Jafar introduces the Topological Interference Management (TIM) scheme, which can be considered as a form of BIA in which the position of every user in the cell(s), and therefore the strength of their channels, is taken into account. Requiring only knowledge of the network's topology at the
V. Kalokidou, O. Johnson and R. Piechocki transmitters, / DoF can be achieved for every user in the SISO Broadcast Channel (BC), by treating weak interference links as noise. Moreover, in [9] Sun and Jafar discuss the implications of increasing the number of receive antennas resulting in an increase on the network's DoF. In [1], Saito et al. propose the Non-Orthogonal Multiple Access (NOMA) scheme for future radio access, in contrast to the Orthogonal Frequency Division Multiple Access (OFDMA) and Single Carrier-Frequency Division Multiple Access (SC-FDMA) orthogonal schemes currently adopted by 4G mobile systems. According to the NOMA scheme, multiple users are superimposed in the power domain and Successful Interference Cancellation (SIC) reception is performed at the decoding stage, ultimately improving the capacity and throughput performance. Furthermore, Benjebbour et al. in [10] present the benefits of NOMA and discuss its performance considering adaptive modulation and coding, and frequency-domain scheduling. Moreover, Ding and co-authors in [11]-[12] discuss the superior performance of NOMA in terms of ergodic sum rates and the importance of power allocation, and a cooperative NOMA scheme where users with higher channel gains have prior information about other users' messages, respectively. In addition, Ding, Fan and Poor in [13] study user pairing on two NOMA schemes and how it affects the sum rate. The first scheme, F-NOMA, with fixed power allocation, pairs users with very distinctive channel conditions, whereas the second one, CR-NOMA, inspired by cognitive radio, pairs users with similar channel conditions. Lastly, user pairing and the performance of NOMA has been also studied from an information theory perspective, as discussed in [15], researching the relationship between the rate region achieved by NOMA and the capacity region of the BC, and showing that NOMA can outperform TDMA not only in terms of the sum rate, but for every user's rate as well, and observing, for the 2-user case, that different power allocation to users simply determines different points on the rate region graph. In this paper, which constitutes a revised and updated version of [16], based on [1] and [8], we introduce a hybrid TIM-NOMA scheme in general 𝐾 -user cells, extending the special case of SISO, presented in [16], to MIMO systems. Our contribution is the combination of the TIM and NOMA schemes, in a two-stage decoding way, dividing users in 𝑇 groups. In the first-stage, we apply the TIM scheme to manage “inter-group” interference, with no need to ignore weak interference links. In the second-stage, we employ NOMA, at every group of users separately, to manage “intra-group” interference through SIC. Finally, we discuss how the sum rate performance of the system is significantly improved with the employment of the hybrid scheme when compared to Time Division Multiple Access (TDMA). The rest of the paper is organized as follows. Section 2 presents the general description of the hybrid scheme, with the aid of example models, including the determination of the transmit power, and the two-stage decoding process. Section 3 presents the achievable rate formula for every user in the network. Finally, Section 4 gives an overview of our results, illustrated with graphs, discussing how the users' distance from the basestation, and the amount of interference affects their performance. Section 5 summarizes the main findings of our work and discusses further developments of the hybrid scheme.
2. System Model
Consider the Broadcast Channel (BC) network, as shown in Figures 1 and 2, for the SISO and MIMO case respectively. At the centre of the cell, there is one transmitter 𝑇 ! with 𝑁 ! antennas, and 𝐾 users equipped with 𝑁 ! antennas each, with 𝑁 ! ≥ 𝑁 ! . Transmitter 𝑇 ! has 𝐿 = 𝑁 ! messages to send to every user, and moreover, when it transmits to user 𝑘 , where 𝑘 ∈ , , … , 𝐾 , it causes interference to all the other 𝐾 − users in the macrocell. We describe an example of our scheme, where the radius of the cell is considered as 𝑅 = km and the distance of every user from the basestation is given by 𝑑 ! . Furthermore, users are divided into 𝑇 groups 𝐺 ! , 𝐺 ! , … , 𝐺 ! , in such a way so that, on ordering receivers by distance, there are always 𝑇 − users from the remaining 𝑇 − groups separating 2 users from the same group. This ensures we place users with considerable difference in their channel strengths in the same group. The operation is performed over 𝑇 time slots, over which we assume that channel coefficients remain the same. The transmitter has only knowledge of the topology of the network. According to the NOMA scheme, described fully in [1] and [10], users are multiplexed, in the power domain, at the transmitters, and then at the receivers, signal separation is performed based on SIC. Decoding is performed based on an optimal order (in the order of decreasing channel gains divided by the power of noise and interference), resulting in every user being able to decode the signals of users coming before them in the decoding order. The general concept of the hybrid TIM-NOMA scheme, is that every user, in order to recover its desired signal, uses the principles of TIM to manage interference coming from transmissions to users NOT belonging to their own group (i.e. their channel strengths are quite similar), and the principles of NOMA to manage interference due to transmissions to users belonging in their own group (i.e. their channel strengths are quite different). According to our research, NOMA seems to work better when applied to users with considerable difference in their channel gains. Therefore, introducing TIM in the NOMA scheme, and splitting users into groups, provides a solution for the cases where users' gains do not differ much. The aforementioned reason, combined with fact that both schemes do not require CSIT, as discussed in [1] hybrid TIM-NOMA scheme for the Broadcast Channel and [8], results in a very smooth and successful combination of them. In Section 2.1, we will consider an example model, depicted in Figure 1, with 𝐾 = users, 𝑇 = time slots and groups 𝐺 ! , 𝐺 ! . Users 1 and 3 are in group 𝐺 ! , and users 2 and 4 are in group 𝐺 ! . Finally, the users' distances from the transmitter are given by: 𝑑 ! = km, 𝑑 ! = km, 𝑑 ! = km, 𝑑 ! = km. Figure 1.
MIMO case: users divided into groups ( 𝑁 ! = 𝑁 ! = ). Users , in 𝐺 ! , users , in 𝐺 ! . Transmitted Power
The 𝑇 𝑁 ! × signal at receiver 𝑘 , considering slow fading (i.e. channels is fixed through transmission time), is given by: 𝒚 ! = 𝑯 ! 𝒙 + 𝒛 ! , (1) where 𝑯 ! ∈ ℂ !" ! × ! ! ! is the channel transfer matrix from 𝑇 ! to receiver 𝑘 and is given by 𝑯 ! = 𝛾 ! 𝐼 ! ⊗ 𝒉 ! , (here and throughout ⊗ denotes the Kronecker (Tensor) product), with 𝒉 ! denoting the channel coefficients from 𝑇 ! to 𝑘 for one time slot. Due to the users' different locations, channel coefficients are statistically independent, and follow an i.i.d. Gaussian distribution 𝒞𝒩 ( , ) . Moreover, 𝛾 ! = ! ! ! ! denotes the path loss, and 𝑛 is the path loss exponent considered for an urban environment, i.e. 𝑛 = . Finally, 𝒛 ! ∽ 𝒞𝒩 ( , 𝜎 ! ! 𝐼 ! ! ! ) denotes the independent Additive White Gaussian Noise (AWGN) at the input of receiver 𝑘 . Taking into consideration the position of each user 𝑘 in the cell, and therefore their distance 𝑑 ! from the basestation, ordering users increasingly, in increasing order of path loss 𝛾 ! , the following relationship (assuming all users have the same received noise power 𝜎 ! ! ) follows: 𝛾 ! > 𝛾 ! ! ! > ⋯ > 𝛾 ! > 𝛾 ! , (2) with user 1 being very close to the basestation and user 𝐾 at the edge of the cell. Therefore, weaker channels, of users' being far from the basestation, need to be boosted, such that the following holds for the transmit power 𝑃 ! of every user: 𝑃 ! > 𝑃 ! ! ! > ⋯ > 𝑃 ! > 𝑃 ! . (3) For the case of the MIMO BC, based on our research, for the hybrid scheme, we propose two ways of allocating transmit power to each user 𝑘 : a) Considering the rate for every user (see Section 3) and examining the amount by which the rate deteriorates when 𝜎 ! ! → , we determine transmit power in groups and users, for the example model, as follows: 𝑃 ! ! = 𝑎 ! 𝑁 ! 𝛾 ! + 𝛾 ! 𝛾 ! ! ! ! ! = 𝑎 ! 𝑁 ! 𝛿 ! , (4) 𝑃 ! ! = 𝑎 ! 𝑁 ! 𝛾 ! + 𝛾 ! 𝛾 ! ! ! ! ! = 𝑎 ! 𝑁 ! 𝛿 ! , (5) 𝑃 ! = 𝑎 ! 𝑃 ! ! , (6) 𝑃 ! = 𝑎 ! 𝑃 ! ! , (7) 𝑃 ! = ( − 𝑎 ! ) 𝑃 ! ! , (8) 𝑃 ! = − 𝑎 ! 𝑃 ! ! , (9) where 𝑎 ∈ ℝ is a constant determined by power considerations. Then, we can vary 𝑎 ! , 𝑎 ! to find values that optimize the network’s performance. b) Considering the SINR for every user separately, and taking 𝜎 ! ! → and then 𝜎 ! ! → ∞ , aiming at making SINR for all users equal, we determine transmit power in groups and users, for the example model, as follows: 𝑃 ! = 𝑎 ! 𝑁 ! 𝑘 ! 𝛾 ! , (10) 𝑃 ! = 𝑎 ! 𝑁 ! 𝑘 ! 𝛾 ! , (11) 𝑃 ! = 𝑎 ! 𝑁 ! 𝑘 ! 𝛾 ! , (12) 𝑃 ! = 𝑎 ! 𝑁 ! 𝑘 ! 𝛾 ! , (13) V. Kalokidou, O. Johnson and R. Piechocki where 𝑘 ! + 𝑘 ! = 𝛾 ! + 𝛾 ! , (14) so that 𝑃 ! = 𝑎 ! . (15) This can be considered as a special case of a), for which: 𝑎 ! = 𝑎 ! = 𝑘 ! 𝑘 ! + 𝑘 ! , (16) where for matters of simplicity we define 𝑐 = ! ! ! ! ! ! ! . Again, we can vary 𝑘 ! , 𝑘 ! to find values that optimize the network’s performance. Stage 1: “Inter-group” interference management (TIM)
In the network, there will be 𝑇 precoding vectors 𝒗 ! , where 𝑡 ∈ , , … , 𝑇 , which are 𝑇 × unit vectors. The choice of precoding vectors, carrying messages to users in the cell, is not unique, and we choose them in such a way so that every precoding vector 𝒗 ! is orthogonal to all the remaining 𝑇 − precoding vectors. The 𝑇 × transmitted vector 𝒙 is given by: 𝒙 = 𝑃 ! ! ! ! ! 𝒗 ! ( ! ) ⊗ 𝑼 𝒙 ! , (17) with 𝑡 ( 𝑘 ) ∈ , , … , 𝑇 denoting the number of the group 𝐺 ! each user 𝑘 belongs to and 𝑼 an 𝑁 ! × 𝐿 matrix (determining which messages will be transmitted by which antenna), with: (i) for 𝑁 ! = 𝑁 ! = 𝐿 , 𝑼 is equal to the identity matrix, i.e. 𝑼 = 𝑰 ! , (ii) and for 𝑁 ! > 𝑁 ! , 𝐿 , 𝑼 is equal to a matrix with entries 1 or 0, with the sum of the entries of its columns equal to 𝐿 . Example 1.
For the example model, we choose the precoding vectors 𝒗 ! and 𝒗 ! , for groups 𝐺 ! and 𝐺 ! respectively, as: 𝒗 ! = / / , (18) 𝒗 ! = − / / , (19) where for 𝐺 ! = , and 𝐺 ! = , , and the × matrix 𝑼 is: 𝑼 = 𝑰 ! , (20) Theorem 1.
Multiplying the received signal 𝒚 ! with 𝒗 ! ! ⊗ 𝑺 , where 𝑺 is an 𝐿 × 𝑁 ! matrix that (i) for 𝑁 ! = 𝑁 ! = 𝐿 , 𝑺 is equal to 𝑼 , i.e. 𝑼 = 𝑺 , (ii) and for 𝑁 ! > 𝑁 ! , 𝐿 , 𝑺 is equal to a matrix with entries 1 or 0, with the sum of the entries of its columns equal to 𝑁 ! , the resulting signal at every receiver 𝑘 , is given by: 𝒚 ! = 𝑃 ! ! ∈ ! ! 𝛾 ! 𝑺 𝒉 ! 𝑼 𝒙 ! + 𝒛 ! , (21) where 𝑘 ∈ 𝐺 ! , and 𝒛 ! = 𝒗 ! ! ⊗ 𝑺 𝒛 ! remains white noise with the same variance. Proof: We show that 𝒗 ! ! ⊗ 𝑺 removes “inter-group” interference, i.e. interference resulting from transmissions to users in groups 𝐺 ! for 𝑗 = , … , 𝑇 and 𝑗 ≠ 𝑖 , at the 𝑘 th receiver: 𝒗 ! ! ⊗ 𝑺 𝒚 ! = 𝑃 ! ! ! ! ! 𝛾 ! 𝒗 ! ! 𝒗 ! ( ! ) 𝑺 𝒉 ! 𝑼 𝒙 ! + 𝒛 ! = 𝑃 ! ! ∈ ! ! 𝛾 ! 𝒗 ! ! 𝒗 ! 𝑺 𝒉 ! 𝑼 𝒙 ! + 𝒛 ! , (22) where by definition, for 𝑗 = , … , 𝑇 and 𝑗 ≠ 𝑖 , 𝒗 ! ! 𝒗 ! = . ∎ Example 2.
For the example model, for groups 𝐺 ! and 𝐺 ! respectively: 𝒗 ! 𝑻 = / / , (23) 𝒗 ! 𝑻 = − / / , (24) The × post-processed signals at receivers are: For 𝑖 = , : 𝒚 ! = 𝑃 ! ! ! ! , ! 𝛾 ! 𝑺 𝒉 ! 𝑼 𝒙 ! + 𝒛 ! , (25) and for 𝑖 = , : 𝒚 ! = 𝑃 ! ! ! ! , ! 𝛾 ! 𝑺 𝒉 ! 𝑼 𝒙 ! + 𝒛 ! (26) Stage 2: “Intra-group” interference management (NOMA)
The concept of NOMA will be applied in each group 𝐺 ! separately. Based on [1, Section 3], for every group 𝐺 ! , the SIC process is applied at every receiver. All users are ordered in increasing order of their path loss 𝛾 ! . Each user hybrid TIM-NOMA scheme for the Broadcast Channel 𝑘 can correctly decode the signals of users, in their own group, whose path loss is larger than theirs, i.e. come before them in (2), by considering their own signal as noise. In the case where user 𝑘 receives interference from transmissions to users in their own group that have a smaller path loss than they do, then user 𝑘 simply decodes its own signal considering “intra-group” interference from users, in their own group, who come after them in (2), as noise. Maximum-Likelihood (ML) reception is performed every time a user decodes its own or another user's signal. Example 3.
For the example model, the decoding order for the users is: 𝛾 ! > 𝛾 ! > 𝛾 ! > 𝛾 ! , (27) In group 𝐺 ! : Receiver 3 decodes its own signal, considering interference from transmissions to user 1 as noise. Receiver 1 decodes first signal 𝑥 ! (finding 𝑥 ! ), considering its own signal as noise, and subtracts the estimate 𝑥 ! from its post-processed signal 𝒚 ! . Then, it decodes its own signal: 𝒚 ! = 𝒚 ! − 𝒗 ! ! ⊗ 𝑺 𝛾 ! 𝐼 ! ⊗ 𝒉 ! 𝒗 ! ⊗ 𝑼 𝑥 ! . (28) If 𝑥 ! = 𝑥 ! , then (28) reduces to the interference-free channel. In group 𝐺 ! : Receiver 4 decodes its own signal, considering interference from transmissions to user 2 as noise. Finally, receiver 2 decodes signal 𝑥 ! (finding 𝑥 ! ), considering its own signal as noise, and substracts the estimate 𝑥 ! from its post-processed signal 𝒚 ! . Then, it decodes its own signal: 𝒚 ! = 𝒚 ! − 𝒗 ! ! 𝛾 ! 𝐼 ! ⊗ 𝒉 ! 𝒗 ! 𝑥 ! . (29) The special case of the SISO BC was introduced in [16], considering the example model, depicted in Figure 2, with 𝐾 = users, 𝑇 = time slots and groups 𝐺 ! , 𝐺 ! . Users 1, 3 and 5 are in group 𝐺 ! , and users 2 and 4 are in group 𝐺 ! . Finally, the users' distances from the transmitter are given by: 𝑑 ! = . km, 𝑑 ! = . km, 𝑑 ! = . km, 𝑑 ! = . km, 𝑑 ! = . km. Transmitted Power
Taking into consideration the position of each user 𝑘 in the cell, and therefore its distance 𝑑 ! from the basestation, and assuming that all users have the same received noise power 𝜎 ! ! (2) holds, and therefore, as (3) shows, weaker channels, of users' being far from the basestation, need to be boosted. Figure 2.
SISO case: users divided into groups. Users , , in 𝐺 ! and users , in 𝐺 ! . The energy of the input symbol vector 𝑥 ! ∈ ℂ , of each user 𝑘 , is defined as: 𝔼 𝑥 ! ! = . (30) For every user 𝑘 in the cell, we choose to take its transmitted power given by: 𝑃 ! = 𝑎 ! 𝑑 ! ! 𝑑 ! ! ! ! ! ! , (31) where 𝑎 ∈ ℝ is a constant determined by power considerations. The total transmit power is given by the power constraint: 𝑃 ! = 𝑃 ! ! ! ! ! 𝑛𝑜𝑟𝑚 𝑥 ! = 𝑎 ! . (32) Stage 1: “Inter-group” interference management (TIM)
For the SISO case, the 𝑇 × transmitted vector 𝒙 is given by: 𝒙 = 𝑃 ! ! ! ! ! 𝒗 ! ( ! ) 𝑥 ! , (33) with 𝑡 ( 𝑘 ) ∈ , , … , 𝑇 denoting the number of the group 𝐺 ! each user 𝑘 belongs to, and 𝒗 ! ( ! ) determined as described in Section 2.1. Example 4.
For the example model, the precoding vectors 𝒗 ! and 𝒗 ! , for groups 𝐺 ! and 𝐺 ! respectively, are given by (18) and (19), and the × transmitted vector is: 𝒙 = 𝑃 ! ! ! ! ! 𝒗 ! ( ! ) 𝑥 ! , V. Kalokidou, O. Johnson and R. Piechocki (34) where for 𝐺 ! = , , and 𝐺 ! = , . Theorem 2.
Multiplying the received signal 𝒚 ! with the transpose of the precoding vector 𝒗 ! , the resulting signal at every receiver 𝑘 , is given by: 𝒚 ! = 𝒗 ! ! 𝑯 ! 𝑃 ! ! ∈ ! ! 𝒗 ! 𝑥 ! + 𝒛 ! = 𝛾 ! ℎ ! 𝑃 ! ! ∈ ! ! 𝑥 ! + 𝒛 ! , (35) where 𝑘 ∈ 𝐺 ! , and 𝒛 ! = 𝒗 ! ! 𝒛 ! remains white noise with the same variance. Proof: We show that 𝒗 ! ! removes “inter-group” interference, i.e. interference resulting from transmissions to users in groups 𝐺 ! for 𝑗 = , … , 𝑇 and 𝑗 ≠ 𝑖 , at the 𝑘 th receiver: 𝒗 ! ! 𝒚 ! = 𝒗 ! ! 𝛾 ! 𝐼 ! ⊗ ℎ ! 𝑃 ! ! ! ! ! 𝒗 ! ( ! ) 𝑥 ! + 𝒛 ! = 𝒗 ! ! 𝛾 ! 𝐼 ! ⊗ ℎ ! 𝑃 ! ! ∈ ! ! 𝒗 ! 𝑥 ! + 𝒗 ! ! 𝒛 ! , (36) where by definition, for 𝑗 = , … , 𝑇 and 𝑗 ≠ 𝑖 , 𝒗 ! ! 𝒗 ! = . ∎ Example 5.
For the example model, the × post-processed signals at receivers are: For 𝑖 = , , : 𝒚 ! = 𝒗 ! ! 𝑯 ! 𝑃 ! ! ! ! , ! , ! 𝒗 ! 𝑥 ! + 𝒗 ! ! 𝒛 ! , (37) and for 𝑖 = , : 𝒚 ! = 𝒗 ! ! 𝑯 ! 𝑃 ! ! ! ! , ! 𝒗 ! 𝑥 ! + 𝒗 ! ! 𝒛 ! (38) Stage 2: “Intra-group” interference management (NOMA)
The concept of NOMA is applied in each group 𝐺 ! separately, following the same procedure as described in Section 2.1. Example 6.
For the example model, the decoding order for the users is: 𝛾 ! > 𝛾 ! > 𝛾 ! > 𝛾 ! > 𝛾 ! , (39) In group 𝐺 ! : Receiver 5 decodes its own signal, considering interference from transmissions to users 1 and 3 as noise. Receiver 3 decodes first signal 𝑥 ! (finding 𝑥 ! ), considering its own signal as noise, and subtracts the estimate 𝑥 ! from its post-processed signal 𝒚 ! . Then, it decodes its own signal: 𝒚 ! = 𝒚 ! − 𝒗 ! ! 𝛾 ! 𝐼 ! ⊗ ℎ ! 𝒗 ! 𝑥 ! . (40) Receiver 1 decodes first signal 𝑥 ! (finding 𝑥 ! ) and then 𝑥 ! (finding 𝑥 ! ), subtracting every time the estimate of the interfering signal from its post-processed one, considering its own signal as noise, eventually decoding its own, interference-free, signal: 𝒚 ! = 𝒚 ! − 𝒗 ! ! 𝛾 ! 𝐼 ! ⊗ ℎ ! 𝒗 ! 𝑥 ! − 𝒗 ! ! 𝛾 ! 𝐼 ! ⊗ ℎ ! 𝒗 ! 𝑥 ! . (41) In group 𝐺 ! : Receiver 4 decodes its own signal, considering interference from transmissions to user 2 as noise. Finally, receiver 2 decodes first signal 𝑥 ! (finding 𝑥 ! ), considering its own signal as noise, and substracts the estimate 𝑥 ! from its post-processed signal 𝒚 ! . Then, it decodes its own signal: 𝒚 ! = 𝒚 ! − 𝒗 ! ! 𝛾 ! 𝐼 ! ⊗ ℎ ! 𝒗 ! 𝑥 ! . (42)
3. Achievable Rate
For the MIMO BC, since there is no CSIT, the total rate for each user 𝑘 , in group 𝐺 ! , per time slot, setting 𝑴 ! = 𝑺 𝒉 ! 𝑼 , and 𝜌 ! ( ! ) = 𝛾 ! 𝒉 ! 𝒗 ! ! ! ∈ ! ! ! ! ! 𝑃 ! , is given by: 𝑅 ! = 𝑇 𝔼 log det 𝑰 ! ! + 𝑃 ! 𝑁 ! 𝜌 ! ( ! ) + 𝜎 ! ! 𝛾 ! 𝑴 ! 𝑴 ! ! , (43) where 𝑘 ∈ 𝐺 ! . If only one user is active (TDMA), with all other users shut down, the achievable rate, per time slot, is given by: 𝑅 ! = 𝑇 𝔼 log det 𝑰 ! ! + 𝑃 ! 𝑁 ! 𝜎 ! ! 𝛾 ! 𝒉 ! 𝒉 ! ! . (44) For the special case of the SISO BC, since there is no CSIT, the total rate for each user 𝑘 , in group 𝐺 ! , per time slot, setting 𝐷 = 𝑑 ! ! ! ! ! ! , is given by: 𝑅 ! = 𝑇 log + 𝑃 ! 𝑯 ! 𝒗 ! ! 𝑃 ! + 𝜎 ! ! ! ∈ ! ! ! ! ! 𝑑 ! ! 𝐷 𝒗 ! ! 𝑯 ! 𝒗 ! ! , (45) hybrid TIM-NOMA scheme for the Broadcast Channel where 𝑘 ∈ 𝐺 ! . If only one user is active (TDMA), with all other users shut down, the achievable rate, per time slot, is given by: 𝑅 ! = 𝑇 log + 𝑃 ! 𝜎 ! ! 𝑯 ! 𝒗 ! ! , (46) Example 7.
For the example MIMO model the achievable rate, for every user, since 𝑴 ! = 𝒉 ! , is given by: 𝑅 ! = log det 𝑰 ! + 𝑃 ! 𝑁 ! 𝜎 ! ! 𝑎 ! 𝛿 ! 𝛾 ! 𝒉 ! 𝒉 ! ! , (47) 𝑅 ! = log det 𝑰 ! + 𝑃 ! 𝑁 ! 𝜎 ! ! 𝑎 ! 𝛿 ! 𝛾 ! 𝒉 ! 𝒉 ! ! , (48) 𝑅 ! = log det 𝑰 ! + 𝑃 ! 𝑁 ! 𝜌 ! + 𝜎 ! ! ( − 𝑎 ! ) 𝛿 ! 𝛾 ! 𝒉 ! 𝒉 ! ! , (49) 𝑅 ! = log det 𝑰 ! + 𝑃 ! 𝑁 ! 𝜌 ! + 𝜎 ! ! ( − 𝑎 ! ) 𝛿 ! 𝛾 ! 𝒉 ! 𝒉 ! ! , (50) where 𝜌 ! = 𝛾 ! 𝒉 ! 𝒗 ! ! 𝑃 ! and 𝜌 ! = 𝛾 ! 𝒉 ! 𝒗 ! ! 𝑃 ! . Similar expressions hold in the SISO case, and are given by (23)-(27) in [16].
4. Overview of Results
Our simulations were based on the example models already described and were performed in Matlab. The statistical model chosen was i.i.d. Rayleigh and our input symbols were Quadrature Phase Shift Keying (QPSK) modulated. Maximum-Likelihood (ML) detection was performed in the end of the decoding stage. The total transmit power was considered as 𝑊 (a typical value for transmit power in macrocells for 4G systems), and therefore 𝑎 , a constant determined by power considerations in (15) and (32), is given by 𝑎 = . Moreover, simulations were performed for 100-750 frames, with each frame consisting of bits. For the SISO case, in [9], with the TIM scheme, the DoF that can be achieved for every user are 0.5 DoF, i.e. one message sent over two time slots. In [1], with the NOMA scheme, 1 DoF can be achieved for every user. Introducing the hybrid scheme, the total DoF in the network are given by:
𝐷𝑜𝐹 !"! = 𝐾 𝑁 ! 𝑇 , (51) where ! ! is the average number of users per group, showing that the less the number of groups is, the more DoF are provided. Figure 3.
BER Performance of every user in the network (MIMO BC) for 𝑐 = . , . . For 𝑐 = . BER of each users tends to be the same for high SNR values.
Figure 4.
BER Performance of every user compared to TDMA (MIMO BC) for 𝑐 = . . BER performance is better for the case that only one user is active (TDMA). First of all, the BER performance of our example model was investigated. Based on our findings, the distance of every user 𝑘 from the transmitter is a key feature that determines the BER performance of every user. Furthermore, the amount of transmit power allocated to each user has also a considerable impact on the BER performance. − − − − sigma n2 (dB) M ea n B E R a = a = c user 1(c=0.01) user 2(c=0.01) user 3(c=0.01) user 4(c=0.01)user 4(c=0.03)user 2(c=0.03)user 1(c=0.03) user 3(a=0.03) − − − − − − sigma n2 (dB) M ea n B E R user 1 − TDMAuser 2 − TDMA user 1 user 2user 3 user 4user 4 − TDMAuser 3 − TDMA
V. Kalokidou, O. Johnson and R. Piechocki Figure 5.
BER Performance of the total network and every user separately (SISO BC). The closer a user is to the basestaion, the better their BER performance.
Figure 6.
BER Performance of users compared to TDMA (SISO BC). BER performance is better for the case that only one user is active (TDMA).
For the MIMO channel, the special case of 𝑎 ! = 𝑎 ! = ! ! ! ! ! ! ! = 𝑐 was considered. In Figure 3, it can be observed that for different values of 𝑐 , the BER performance of the network changes, proving its dependence on the way power is allocated. For 𝑐 = . , the performance of each user is very similar. Moreover, Figure 4 shows a comparison between the BER performance in the case of the hybrid scheme and the TDMA one. Generally, BER performances are better in the case of TDMA, however the hybrid schemes, for 𝑐 = . , provides a fairer performance to network users, as their BER tends to be similar for high SNR values. For the SISO channel, where we can consider a fixed power allocation scheme, as depicted in Figure 5, users who are closer to the basestation, like users 1 and 2, have a better performance than users who are far from the basestation, like users 4 and 5. Furthermore, in Figure 6, in which for matters of simplicity only users 1 and 5 are studied, as the performances of the remaining users lie in between, it can be observed that BER performances are better when only one user is active (TDMA). Furthermore, the closer a user is to the transmitter, the less improvement we observe in their performance, in the case where all other users are inactive. The rate of the network will be a function of the user's distance from the basestation and the amount of interference considered as noise, if any, as shown in (43) and (45). In Figures 7 and 8, for 𝑐 = . , it can be observed that the rate decreases with the distance of the user from the transmitter and the amount of interference considered as noise. In particular, user 1, who is the closest to the basestation and manages all interference during the decoding stage, achieves the best rate performance. On the contrary, user 4 (MIMO case) and user 5 (SISO case), who are the furthest from the basestation and consider all “intra-group” interference as noise, achieve the worst performance overall for high SNR values. Figure 7.
Rate Performance of the network and every user separately (MIMO BC) for 𝑐 = . . For high SNR values, the closer a user is to the basestation, the better their rate performance is. The rate performance of the hybrid scheme was compared to the rate users would achieve if only one was active (TDMA), as given by (44) and (46) for the MIMO and SISO cases respectively. In general, as it can be observed in Figures 9 and 10, rate performances are better − − − − sigma n2 (dB) M ea n B E R total network user 2 user 1 user 5user 4user 3 − − − − − − sigma n2 (dB) M ea n B E R user 1 − with all otherusers shut down user 5 − with all otherusers shut downuser 1 user 5 sigma n2 (dB) R a t e ( b i t s / s ) total network user 1user 2user 3user 4 hybrid TIM-NOMA scheme for the Broadcast Channel when only one user is active. However, it can be observed that for high SNR values the sum rate of the hybrid scheme outperforms the TDMA average rate. Figure 8.
Rate Performance of the network and every user separately (SISO BC). The closer a user is to the basestation, the better their rate performance is.
Figure 9.
Rate Performance compared to TDMA (MIMO BC) for 𝑐 = . . For SNR values >5dB, the hybrid schemes outperforms TDMA. Finally, in order to emphasize the gain, in terms of sum rate, the hybrid scheme provides, this gain is depicted in Figures 11 and 12 for the cases of MIMO and SISO respectively, where the value of the ratio 𝑅 = 𝑅 ! !" 𝑅 !" , (52) where 𝑅 ! !" is the sum rate of the hybrid scheme and 𝑅 !" the sum rate of TDMA, is studied for a range of SNR values. In the MIMO case, it can be observed that the hybrid scheme outperforms TDMA by more than 100% for values of SNR greater than 26dB. In the SISO case, for values greater than 11dB the hybrid scheme achieves at least double the rate than would be achieved by TDMA. Figure 10.
Rate Performance compared to TDMA (SISO BC).
For SNR values >0dB, the hybrid schemes outperforms TDMA.
Figure 11.
Ratio of sum rate of hybrid scheme over sum rate of TDMA (MIMO BC). For SNR values >26dB, the employment of the hybrid scheme provides 100% gain over TDMA.
5. Summary
Overall, this paper introduces a novel hybrid scheme that can be employed in the MIMO BC of a cell, with 𝐾 users divided into 𝑇 groups. The hybrid scheme combines basic principles of the TIM and NOMA schemes, by treating “inter-group” interference and “intra-group” interference separately and by a different method. Moreover, the sigma n2 (dB) R a t e ( b i t s / s ) total networkuser 5 user 4 user 3 user 2user 1 sigma n2 (dB) R a t e ( b i t s / s ) Sum Rate − Hybrid SchemeAverage Rate − TDMAuser 1 − TDMA user 4 − TDMAuser 1 − Hybrid Scheme user 4 − Hybrid Scheme sigma n2 (dB) R a t e ( b i t s / s ) Average Rate − TDMA user 5 − all other users shut downSum Rate − Hybrid schemeuser 1 − all other users shut downuser 5 − Hybridschemeuser 1 − Hybridscheme sigma n2 (dB) R V. Kalokidou, O. Johnson and R. Piechocki employment of TIM in the cases where users' gains do not differ much, solves performance issues that were faced by NOMA, which performs better when the channel gain difference among users is large. Furthermore, the system's complexity is reduced, providing flexibility, when compared to the NOMA scheme, without decreasing the rate performance that the system would have if NOMA was only applied. In general, the employment of the proposed scheme results in high data rates, very good BER performance, and reduced system overhead (due to the absence of CSIT requirement). Most interestingly, for SNR values greater than 26dB for the MIMO case and 11dB for the SISO case, the total sum rate of the hybrid scheme is 100% better than the sum rate of TDMA, proving the gain in terms of sum rate the hybrid scheme results in. Figure 12.
Ratio of sum rate of hybrid scheme over sum rate of TDMA (SISO BC). For SNR values >11dB, the employment of the hybrid scheme provides 100% gain over TDMA.
The simple concept of the hybrid TIM-NOMA scheme introduced in this paper, as an extension of our work presented in [16], suggests that it could be employed in dense networks, and potentially in heterogeneous networks once certain adjustments in the algorithm are made. Finally, apart from the special case of the SISO channel where a fixed power allocation scheme can be employed, the determination of a fair power allocation method, as mentioned in [14], constitutes a complex procedure in NOMA schemes and requires exhaustive simulations that will maximize the system's performance. However, as stated in [15] and based on our simulations different power allocation gives different points on the rate region and therefore the power allocation scheme can vary according to the performance requirements of every system the hybrid scheme is employed in.
Acknowledgements.
This work was supported by NEC; the Engineering and Physical Sciences Research Council [EP/I028153/1]; and the University of Bristol. The authors thank Simon Fletcher & Patricia Wells for useful discussions.
References [1]
Y. Saito, Y. Kishiyama, A. Benjebbour, T. Nakamura, A. Li, K. Higuchi, “Non-Orthogonal Multiple Access (NOMA) for Cellular Future Radio Access”,
IEEE VTC
Spring , Dresden, June 2013. [2]
N. Lee, R.W. Heath, “Advanced Interference Management Technique: Potential and Limitations”, ArXiv: 1501.00080v1, Dec. 2014. [Online] Available: http://arxiv.org/abs/1501.00080. [3]
M. Maddah-Ali, A. Motahari, A. Khandani, “Communications over X channel: Signalling and performance analysis”, in
Tech. Report , UW-ECE-2006-12 , University of Waterloo, July 2006. [4]
V.R. Cadambe, S.A. Jafar, “Interference Alignment and Degrees of Freedom of the K-User Interference Channel”,
IEEE Trans. Inf. Theory , vol. 54, no. 8, pp. 3425-3441, Aug. 2008. [5]
T. Goum, C. Wang, S.A. Jafar, “Aiming Perfectly in the Dark-Blind Interference Alignment Through Staggered Antenna Switching”,
IEEE Trans. Signal Process., vol. 59, no. 6, pp. 2734-2744, June 2011. [6]
S.A. Jafar, “Blind Interference Alignment”,
IEEE J. Sel . Topics Signal Proces., vol. 6, no. 3, pp. 216-227, June 2012. [7]
S.A. Jafar, “Elements of Cellular Blind Interference Alignment-Aligned Frequency Reuse, Wireless Index Coding and Interference Diversity”, ArXiv: 1203.2384v1, Mar. 2012. [Online] Available: http://arxiv.org/abs/1203.2384. [8]
S.A. Jafar, “Topological Interference Management through Index Coding”,
IEEE Trans. Inf. Theory , vol. 60, no. 1, pp. 529-568, Jan. 2014. [9]
H. Sun, S.A. Jafar, “Topological Interference Management with Multiple Antennas”,
IEEE ISIT , Honolulu, June-July 2014. [10]
A. Benjebbour, Y. Saito, Y. Kishiyama, A. Li, A. Harada, T. Nakamura, “Concept and Practical Considerations of Non-Orthogonal Multiple Access (NOMA) for Future Radio Access”,
IEEE ISPACS , Naha, Nov. 2013. [11]
Z. Ding, Z. Yang, P. Fan, H.V. Poor, “On the Performance of Non-Orthogonal Multiple Access in 5G Systems with randomly Deployed Users”,
IEEE Signal Process. Lett. , vol. 21, no. 12, pp. 1501-1505, July 2014. [12]
Z. Ding, M. Peng, H.V. Poor, “Cooperative Non-Orthogonal Multiple Access in 5G Systems”, ArXiv: 1410.5846v1, Oct. 2014. [Online] Available: http://arxiv.org/abs/1410.5846. [13]
Z. Ding, P. Fan, H.V. Poor, “Impact of user pairing on 5G Non-Orthogonal Multiple Access”, ArXiv: 1412.2799v1, Dec. 2014. [Online] Available: http://arxiv.org/abs/1412.2799. [14]
Y. Lan, A. Benjebbour, X. Chen, An. Li, H. Jiang, “Considerations on Downlink Non-Orthogonal Multiple Access (NOMA) Combined with Closed loop SU-MIMO”,
IEEE ICSPCS , Gold Coast, Dec. 2014. [15]
P. Xu, Z. Ding, X. Dai, H.V. Poor, “NOMA: An Information Theoretic Perspective”, ArXiv: 1504.07751v2, sigma n2 (dB) R hybrid TIM-NOMA scheme for the Broadcast Channel May 2015. [Online] Available: http://arxiv.org/abs/1504.07751. [16]
V. Kalokidou, O. Johnson, R. Piechocki, “A hybrid TIM-NOMA scheme for the SISO Broadcast Channel”,