Non Orthogonal Multiple Access for 5G and beyond

Transcription

1 Non Orthogonal Multiple Access for 5G and beyond DIET- Sapienza University of Rome November 23, 2018

2 Outline 1 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density spreading CDM-NOMA Novelties and Contributions 2 3 Optimum decoding Linear decoding 4 Channel model: Rayleigh block-fading assumptions Capacity lower bound Pilot-based channel model assumptions Pilot-based system model Optimization for pilot-based low-dense NOMA 5 The impact of number of coherence symbols n b The impact of number of users K The impact of system load β 6

3 5G era 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density spreading CDM-NOMA Novelties and Contributions Figure: Evolution from 1G to 5G 1 1 Sources:

4 5G era 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density spreading CDM-NOMA Novelties and Contributions Two key-requirements of 5G are: High spectral efficiency Massive connectivity Some potential candidates have been proposed for 5G such as 2 Massive MIMO Millimeter wave communications Ultra dense network Non-orthogonal multiple access (NOMA): (3GPP-LTE-A) standard, the next general digital TV standard (ATSC 3.0), and the 5G New Radio (NR) standard 2 F. Boccardi, R. W. Heath, A. Lozano, T. L. Marzetta, and P. Popovski, Five disruptive technology directions for 5G, IEEE Commun. Mag., vol. 52, no. 2, pp , Feb

5 Concept visualization of NOMA 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density spreading CDM-NOMA Novelties and Contributions

6 Concept visualization of NOMA 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density spreading CDM-NOMA Novelties and Contributions

7 Concept visualization of NOMA 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density spreading CDM-NOMA Novelties and Contributions

8 Overview of NOMA 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density spreading CDM-NOMA Novelties and Contributions To control collisions in NOMA, it is feasible to share the same signal dimension among users and exploit either power (PDM-NOMA) or code (CDM-NOMA), or space (SDMA) domains 3 CDM-NOMA can be inferred from conventional CDMA via spreading matrix, which can be classified as: single-carrier vs. multi-carrier NOMA (based on adopted waveform) dense vs. low-dense NOMA (based on sparsity of spreading matrix) 3 L. Dai et. al, Non-orthogonal multiple access for 5G: solutions, challenges, opportunities, and future research trends, IEEE Commun. Mag., vol. 53, no. 9, pp , Sept

9 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density spreading CDM-NOMA Novelties and Contributions CDM-NOMA in 5G-New Radio (5G-NR) Figure: Timeline for 5G-NR 4 4 Sources: Rohde& Swarchz MNT May 2018

10 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density spreading CDM-NOMA Novelties and Contributions CDM-NOMA in 5G-New Radio (5G-NR) Figure: Timeline for 5G-NR 5 5 Sources: Rohde& Swarchz MNT May 2018

11 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density spreading CDM-NOMA Novelties and Contributions Low-dense spreading CDM-NOMA (LDS-NOMA) LDS-NOMA: The idea is to replace dense-spreading sequences of DS-CDMA by sparse counterparts, such that only a part of REs is filled with nonzero entries, while others are zero.

12 Novelties and Contributions 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density spreading CDM-NOMA Novelties and Contributions The major contributions and novelties of this work are as follows: A unified mathematical framework for code-domain NOMA. The spectral efficiency for Low-density NOMA in the fading channel with linear detection is derived in closed-form, showing that sparse signaling outperforms dense signaling when the network is overloaded (K > N). The spectral efficiency with optimum detection is derived in closed-form, by finding the limiting spectral distribution of a matrix ensemble that jointly describes spreading and fading: this is a mathematical result of independent interest. The results provide an insight into the design of signaling in dense networks, as envisioned in the uplink IoT scenario, sparse signaling can achieve a rate several times larger than that achievable via dense signaling.

13 The mathematical model for Code-domain NOMA is: y = SAb + n, where: y C N is the received signal with N signal dimensions (chips) b = [b 1...b K ] T C K is the vector of symbols transmitted by K-users with the power constraint E[s K ] ε S = [s 1...s K ] R N K is the spreading matrix, where its k th column is the spreading sequence s K of the k th user and s K = 1 A = diag[a 1...A K ] C K K represents the channel n is a circularly symmetric Gaussian vector with zero mean and covariance N 0 I

14 Optimum decoding Linear decoding Theoretical analysis for Low-density NOMA with perfect CSI Assumptions: Given N s the number of nonzero elements in each spreading sequence.. N s = N: dense NOMA (DS-CDMA). N s < N: low-dense NOMA (LDS-CDMA). In massive communications, the behavior of the system should be considered in the asymptotic limit region, where N and K, while the ratio K/N = β (system load) remains finite [VS99].. β < 1: underloaded system. β > 1: overloaded system Optimum and linear decoding are considered in all cases.

15 Optimum decoding Linear decoding Achievable rates of low-dense NOMA with optimum decoding for N s = 1 For AWGN channels [FdB15]: C opt N (γ) = 1 N log 2 det[i + γss H ] p C opt (β, γ) = β k e β log k! 2 (1 + kγ). k 0 (1) For flat-fading channels (major results): C opt N (γ) = 1 N N n=1 p C opt (β, γ) = e β ) log 2 (1 + γλ n (SHH H S H ), 0 k=0 β k x k 1 e x log k! Γ(k) 2 (1 + γx)dx. (2) where {λ n (SHH H S H )} is the set of eigenvalues of the matrix.

16 Optimum decoding Linear decoding Achievable rates of low-dense NOMA with optimum decoding for N s = C opt (b/s/hz) DS - CDMA No fading LDS - CDMA (N s =1) No fading LDS - CDMA(N s =1) Rayleigh fading DS - CDMA Rayleigh fading β Figure: Optimum capacity C opt (bits/s/hz) vs. load factor β = K/N

17 Optimum decoding Linear decoding Achievable rates of low-dense NOMA with linear decoding for N s = 1 As demonstrated in [FdB15], the distinguished difference of LDS-CDMA to DS-CDMA is that all linear receiver (ZF, SUMF, MMSE) result in the same mutual information. Achievable rates of low-dense NOMA for AWGN channels [FdB15]: RTH ZF = RSUMF TH = R MMSE TH = β k 0 β k e β k! log 2 ( 1 + γ kγ + 1 For flat-fading channels, the closed-form expression is as followed (major results): 1 RLDS SUMF (β, γ) = β log 2 e 0 ( ) e t β+ 1 (1 t)γ 1 t ) (3) dt. (4)

18 Capacity (bits/s/hz) Optimum decoding Linear decoding Achievable rates of Low-dense NOMA with linear decoding for N s = 1 without fading OMA area NOMA area 6 4 Dense NOMA Low-dense NOMA β = K/N

19 Optimum decoding Linear decoding Achievable rates of low-dense NOMA with linear decoding for N s = 1 with fading 3 MMSE C DS without fading 2.5 MMSE C DS with fading SUMF R LDS without fading Achievable rates (b/s/hz) SUMF R LDS with fading β=k/n

20 Channel model: Rayleigh block-fading assumptions Capacity lower bound Channel model: Rayleigh block-fading assumptions Continuous vs. block-fading model is linked via the duality property 6 n b = 1 2f m T s, n b is the number of coherent symbols within a block in which the channel is considered stationary (T s is the symbol period for continuous-fading model, respectively). For 3GPP LTE and IEEE WiMAX: nb may range from unity to several hundreds 6. For 5G-NR: n b may range from unity to thousands. f m = vf c /c is the maximum Doppler frequency: f c being the carrier frequency, v is the velocity of interest and c is the speed of light. 6 F. Rusek, A. Lozano, and N.Jindal, Mutual information of IID complex gaussian signals on block rayleigh-faded channels, IEEE Trans. Inf. Theory, vol. 58, no. 1, pp , Jan

21 n b in 5G-NR scenario Channel model: Rayleigh block-fading assumptions Capacity lower bound The calibration of n b for New Radio (5G-NR) is based on: f c = [GHz], with the deployment of macro sites at lower frequencies, and micro and pico sites at higher frequencies 7. Supported mobility speeds v are up to 500 km/h, while the vehicular velocities of interest are about 120 km/h 7. Numerology 8, i.e. the subcarrier spacing f, is the most distinguished feature in frame structure of 5G-NR compared to LTE. In LTE: f = 15 [khz], In 5G-NR: f = 2 µ 15 [khz] with µ = 0 4, corresponding to the symbol period T s = 4µs to 66.7µs. The range of n b in the 5G-NR context is from one to thousands! 7 K. Haneda et al., Indoor 5G 3GPP-like channel models for office and shopping mall environments, in Proc. IEEE Int. Conf. Commun. (ICC), May 2016, pp rd Generation Partnership Project (3GPP), TS NR; Physical channels and modulation, 2017

22 Channel model: Rayleigh block-fading assumptions Capacity lower bound Capacity lower bound: Pilot-based channel model A pilot-based scheme includes a pilot phase and a data transmission phase, being implemented after a MMSE channel estimation obtained by the pilot phase. Among the total n b symbols of a fading block: np symbols, called pilot symbols, are allocated for learning the channel, remaining (n b n p ) symbols are dedicated for data transmission. Three assumptions rule the pilot-based scheme in this work: nb > 2K since n b is much greater than both {K, N}, perfect channel estimation (via pilot phase) is assumed, each transmission is assumed to be self-contained, that is, both pilot and data phases are done within a block of n b symbols.

23 Pilot-based system model Channel model: Rayleigh block-fading assumptions Capacity lower bound Pilot phase: Y p = SAP + N p, where P C K np is the matrix of known pilot symbols replacing the transmitted signal X with the constraint PP = n p I, Y p and N p are matrices of size N n p. Data phase: a similar equation to the perfect CSI model can be applied as such: Y d = SAX d + N d, with new dimensions of output and input being Y d C N (n b n p) and X d C K (n b n p), respectively.

24 Channel model: Rayleigh block-fading assumptions Capacity lower bound Optimization for pilot-based low-dense NOMA The effect of of pilot power allocation: No constraint on pilot power allocation: ( C LB (β, γ eff ) = 1 K ) e β β k n b k! k 1 0 where γ eff = n bsnr n b 2K ( α α 1) 2. With constraint on pilot power allocation: ( max 1 n ) ( p C 1 n p n b n b e λ λ k 1 (k 1)! log 2(1+γ eff λ) λ, SNR 2 n p /K 1 + SNR(1 + n p /K) Optimizing the number of pilot symbols yields np opt = K, given if np is too small, the time dedicated to channel sounding may be insufficient to provide good estimates, if np is too large, the data transmission rates will reduce. ).

25 Results Channel model: Rayleigh block-fading assumptions Capacity lower bound In this section, capacity bounds of low-dense NOMA are analyzed as a function of: number of coherence symbols n b number of users K system load β = K/N The analysis of lower bound focuses on the case of no pilot power constraint. An example with pilot power constraint is shown for reference in the last section.

26 Channel model: Rayleigh block-fading assumptions Capacity lower bound The impact of number of coherence symbols n b 6 5 Perfect CSI Capacity (bits/s/hz) E b /N 0 nb = 500 nb = 100 nb = 50 nb = 25 Figure: Capacity bounds (bits/s/hz) of low-dense NOMA as a function of E b /N 0 for fixed β = 1, with upper bound defined by coherent capacity (solid line) and lower bounds by a pilot-based scheme with fixed n p = K = 10 for different values n b.

27 The impact of number of users K Channel model: Rayleigh block-fading assumptions Capacity lower bound Capacity (bits/s/hz) Perfect CSI K = 10 K = 50 K = Number of symbols n b Figure: Capacity lower bounds (bits/s/hz) of low-dense NOMA pilot-based scheme with fixed β = 1 and E b /N 0 = 10 [db] as a function of n b with different values K = {10, 50, 100}.

28 The impact of system load β Channel model: Rayleigh block-fading assumptions Capacity lower bound Perfect CSI Capacity (bits/s/hz) n b = 500, K = 10 n b = 100, K = 10 n b = 500, K = 100 n b = 25, K = 10 with pilot power constraint n b = 25, K = β = K/N Figure: Capacity bounds of low-dense NOMA scheme with upper bound being the coherent capacity and lower bound obtained with a pilot-based scheme as a function of β = K/N and fixed E b /N 0 = 10 [db].

29 s The impact of number of coherence symbols n b The impact of number of users K The impact of system load β For perfect CSI, results of CDM-NOMA can be drawn as follows: For optimum decoding, achievable rates of dense systems are always higher than low-dense counterparts, despite fading, β and N s. For linear decoding, achievable rates in the low-dense regime are equal for all linear decoders, and are shown higher than those of dense systems for β [1.2, 5]), and increase with fading. For no CSI, lower capacity bounds reach the upper bound in 5G-NR context under some conditions (n b high, K low). In conclusion, by changing the spreading strategy from dense to low-dense, specific theoretical limits hold, showing that, to obtain higher achievable rates for linear decoders while still enjoying the lower receiver complexity, it is advisable to adopt sparse communications.

30 Main References The impact of number of coherence symbols n b The impact of number of users K The impact of system load β S. Shamai and S. Verdu, The impact of frequency-flat fading on the spectral efficiency of CDMA, in IEEE Trans. on Inf. Theory, vol. 47, no. 4, pp , May G.C. Ferrante and M.G. Di Benedetto, Spectral Efficiency of Random Time-Hopping CDMA, IEEE Trans. on Inf. Theory, vol. 61, no. 12, pp , Dec Mai T. P. Le, Ferrante, G.C., Caso, G., Quek, Tony. and Di Benedetto, M.G., Fundamental Limits of Low-Density Spreading NOMA with Fading. IEEE Transactions on Wireless Communications, 17 (7), pp , Mai T.P. Le, Ferrante, G.C., Caso, G., De Nardis, L. and Di Benedetto, M.G., On information-theoretic limits of code-domain NOMA for 5G. IET Communications, 12(15), pp , Mai T. P. Le, Giuseppe Caso, Luca De Nardis, et. al.,capacity bounds of Low-Dense NOMA over Rayleigh fading channels without CSI, IEEE 25th International Conference on Telecommunications (ICT), pp , 2018.