Skip to main content
Erschienen in: EURASIP Journal on Wireless Communications and Networking 1/2019

Open Access 01.12.2019 | Research

On the performance of receiver strategies for cooperative relaying cellular networks with NOMA

verfasst von: Jinjuan Ju, Guoan Zhang, Qiang Sun, Li Jin, Wei Duan

Erschienen in: EURASIP Journal on Wireless Communications and Networking | Ausgabe 1/2019

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, a receiver scheme for a cooperative multi-relay system with non-orthogonal multiple access (CMRS-NOMA) in cellular networks is proposed. In our proposed system, the base station (BS) would like to communicate with multiple users via multiple relays, and direct links between the BS and users are not considered. Specifically, we assume that the relays in the approaching range are allowed to assist the transmission since other relays are out of the cooperation range. In this way, each user and the corresponding relays can be implemented as one group. In addition, the source simultaneously transmits the superposition coded signals to all relay nodes. After receiving the signals, all the relay nodes decode the symbols by applying successive interference cancellation (SIC) and then reconstruct them into new NOMA signals, which will be forwarded to the users and decoded in a linear combination way. Note that the proposed reconstructions at the relay nodes are practical and simple, which leads to an advantageous decoding for the receivers. Moreover, the closed-form expressions in terms of the sum rate (SR) and the outage performance of the system are derived. Qualitative numerical results corroborating our theoretical analysis show that the proposed scheme significantly improves the performance in terms of the SR and outage probability compared with the existing works.
Abkürzungen
AWGN
Additive white Gaussian noise
BS
Base station
CCDF
Complementary cumulative distribution function
CDF
Cumulative distribution function
CMRS-NOMA
Cooperative multi-relay system with non-orthogonal multiple access
CRS-NOMA
Cooperative relaying system with NOMA
CSI
Channel state information
CU Corresponding user; IoT
Internet of Things, MIMO: Multiple-input multiple-output, mmWave: Millimeter-wave, MTC: Machine-type communications
NPL
Node pair list
OMA
Orthogonal multiple access
QoS
Quality of services
SC
Superposition coding
SIC
Successive interference cancellation
SINR
Signal-to-interference-plus-noise ratio
SM
Spatial modulation
SR
Sum rate
SWIPT
Simultaneous wireless information and power transfer
TDMA
Time-division multiple access
V2V
Vehicle-to-vehicle

1 Introduction

Recently, non-orthogonal multiple access (NOMA) has received considerable attention as a promising candidate for 5G systems, to realize an aggregate goal, such as superior spectral efficiency, balanced user fairness, intense connections, and low access latency [1, 2]. In contrast to the traditional orthogonal multiple access (OMA) scheme and recent studies [36], the NOMA technique allows multiple users to share time/frequency radio resources and allows distinguishing users by the different power levels [79]. In addition, a cooperative relaying system with the NOMA technique (i.e., CRS-NOMA) is proposed in [2], which not only improves spectral efficiency but also reduces the system complexity based on some special approaches. To further improve the system performance in CRS-NOMA, the authors in [10] investigated a novel receiver design, where the performance in terms of the SR and outage probability are significantly improved. Since the distributions have an important impact, a new CRS-NOMA protocol is proposed in [11], in which the applications of simultaneous wireless information and power transfer (SWIPT) to NOMA networks are considered. Moreover, the works focusing on the power allocation schemes and different channel models, such as Rician fading channels and Nakagami-m fading channels in the NOMA technology, have also been studied in [1214].
Due to the various advantages promised by NOMA technology in existing and future wireless communications systems, NOMA technology has been shown to be compatible with many other potential 5G techniques, such as massive multiple-input multiple-output (MIMO) and millimeter-wave (mmWave), as well as some applications in Internet of Things (IoT), such as vehicle-to-vehicle (V2V) communication scenarios and machine-type communications (MTC). As an effective means to improve spectral efficiency, MIMO has been widely studied [1518]. In [1922], various algorithmic frameworks and performance optimization problems in MIMO-NOMA scenarios were also studied. However, most of the existing NOMA schemes rely on a key assumption that the channel conditions for the users are heterogeneous. To ensure that the potential of NOMA technology can be realized even if the users’ channel conditions are similar, a MIMO-NOMA downlink transmission scenario has been considered, with one transmitter sending data to two users, e.g., an access point is serving two IoT devices [23]. Particularly, the authors considered that one user needs to be served quickly for small packet transmission, i.e., with a low targeted data rate, and the other user is to be served with the best effort. However, due to the scarcity of traditional wireless communication frequency resources, mmWave is slowly becoming popular because it has more bandwidth resources in the high-frequency band [24]. The authors in [25] investigated spatial and frequency wideband effects, called dual-wideband effects in massive MIMO systems, from the array signal processing perspective. By taking millimeter-wave-band communications into account, they described the transmission process to address the dual-wideband effects. In [26], to avoid the requirement that the base station (BS) should know all the channel state information (CSI) of the users, the applications of random beamforming to mmWave-NOMA systems were considered. In the application scenarios of IoT, such as V2V communications, since multiple antennas can be accommodated, large-scale MIMO becomes quite attractive [27, 28]. Inspired by the robustness of spatial modulation (SM) against channel correlation and the benefits of NOMA technology, the authors in [29] combined them into NOMA-SM to handle the effects of wireless V2V environments and to support the improvement in bandwidth efficiency.
The studies of NOMA technology and its compatibility with other technologies used in certain scenarios have clearly received considerable attention. For a scenario with multiple receiving nodes, both the transmission strategies and performance analysis are more practical and challenging for wireless communication systems. In addition, to the best of our knowledge, there are no relevant studies that focus on cellular networks with a multi-relay node transmission model with NOMA technology. Although the NOMA systems over Rician fading channels and/or Nakagami-m fading channels are more interesting and challenging, they are beyond the scope of this paper. Based on the above considerations, in this paper, a new transmission model named cooperative multi-relay system using NOMA (CMRS-NOMA) technology over Rayleigh fading channels is studied. To jointly decode the desired signals for each user, the new superposition coded signals are reconstructed and broadcast by the multiple relay nodes. For assisting the multiple relay nodes in completing the transmission of the new superposition signals, a simple and practical decoding scheme with high efficiency and low complexity is investigated.
The implementations and main contributions of our proposed work are summarized as follows:
  • A new CMRS-NOMA transmission scenario is proposed, in which the relays within the cooperation range are allowed to assist the transmissions from the BS to the users. Meanwhile, the direct transmission channels are not considered. After receiving signals, the relay nodes reconstruct the received signals into a new superposition code in a practical way, and the coded signal will be simply decoded with linear combinations at the receiver. Moreover, we also introduce a two-stage NOMA power allocation scheme at the BS and relay nodes, which is interesting and challenging.
  • We investigate a new decoding method that can be described as a simple algorithm at each user after the relay nodes forward the reconstructed signals from the BS. Thanks to the reconstructions at the relay, each user can decode the desired signals with linear combinations, where the signals are forwarded from the corresponding relays. In addition, we qualitatively analyze a low-complexity, multi-stage power allocation strategy.
  • The performance of the cooperative multi-relay NOMA technology in cellular networks is analyzed in terms of the ergodic SR and outage probability. Considering independent Rayleigh fading channels, we first derive the closed-form expressions of the ergodic SR and outage probability for a single-relay case. By extending the single-relay case into the remaining multi-relay node pair cases, a generalized reconstruction strategy is investigated, where all relay nodes follow the same regularity feature. For the remaining multi-relay node pair cases, in this manner, the power allocation factors of the proposed CMRS-NOMA should be changed in a circular manner, which is completely different from the traditional single-relay cooperative networks.
  • Compared to the TDMA and CRS-NOMA schemes, the proposed CMRS-NOMA has better performances in terms of outage probability and spectral efficiency in both the analytical and numerical results. It is also observed that NOMA technology offers better fairness when multiple users’ quality of services (QoS) are satisfied.
The remainder of this paper is organized as follows. In Section 2, the proposed new system model, power allocation strategies, and decoding scheme of multi-relay cooperative NOMA for cellular networks are described. In Section 3, we analyze the performance in terms of the ergodic SR, outage probability, and some auxiliary indicators. In addition, closed-form expressions for the ergodic SR and outage performance are derived. In Section 4, we present and discuss the simulation results for our proposed works. This paper is concluded in Section 5.

2 System model and the proposed scheme

Consider a cooperative relaying communication system that consists of one source S; multiple relay nodes, i.e., R1RM; and multiple users, D1DN, as shown in Fig. 1. We further consider that the BS wants to communicate with the users via the relay nodes since there are no direct links between them. In addition, the relays in the approaching range are allowed to assist the transmission, while the other relays are beyond the transmission range. It is assumed that all nodes are operating in a half-duplex mode and that each one is equipped with a single antenna. The channels between S- Ri and Ri- Dj are denoted as \(h_{SR_{i}}\) and \(h_{R_{i}D_{j}}\), respectively, which are assumed to be Rayleigh fading channels with variances \(\beta _{SR_{i}}\) and \(\beta _{R_{i}D_{j}}\). Furthermore, the CSI is assumed to be perfectly known to each receiving node.
There are two phases involved in our proposed scheme. In the first phase, the source broadcasts N symbols (s1,s2,⋯,sN) simultaneously to the relays. By adopting the superposition code, the transmitted signal from the source is given as \(\sum _{k=1}^{N} \sqrt {{a}_{k}{P}_{t}} s_{k}\), where sk is the symbol for the kth (1≤kN) user, ak with \(\sum _{k=1}^{N} a_{k}=1\) denotes the power allocation coefficient, and Pt is the total transmit power. Similar to the traditional NOMA technology, the power coefficients are determined by the qualities of the S- Ri channels. The observation at the ith (1≤iM,M=N) relay in multiple relay nodes is given by
$$ {y}_{R_{i}} = {h}_{SR_{i}} {\sum\limits_{k=1}^{N} \sqrt{{a}_{k}{P}_{t}} s_{k}} + {n}_{R_{i}}, $$
(1)
where \({n}_{R_{i}}\sim {\mathcal {CN}(0,\sigma ^{2}_{R_{i}})}\) are the additive white Gaussian noises (AWGNs). Without loss of generality, following the NOMA decoding principle, sj(1≤jN−1) is decoded first and allocated with more transmit power, and then sj+1 is subsequently decoded. Successive detection will be performed at the ith relay at the end of this phase. Because of the cellular distribution, all the S- Ri channels are spatially disparate and have distinct transmission qualities at this stage, i.e.,
$$ {h}_{SR_{1}} \neq {h}_{SR_{2}} \neq \cdots \neq {h}_{SR_{N}}, $$
(2)
In the second phase, with the superposition coding (SC) and successive interference cancellation (SIC), all the relay nodes are available to successively decode the symbols. In this manner, the received signal-to-interference-plus-noise ratio (SINR) at the ith relay node is given by
$$ \gamma_{R_{i}}^{(s_{k})} = \frac{\left|{h_{{S}{R_{i}}}}\right|^{2} a_{k} P_{t}}{{\left|{h_{{S}{R_{i}}}}\right|^{2} \left(\sum\limits_{\scriptstyle {m=k+1} \hfill \atop \scriptstyle \hfill}^{N} a_{m}\right) P_{t} + \sigma^{2}}}, $$
(3)
and
$$ \gamma_{R_{i}}^{(s_{N})} = \frac{\left|{h_{{S}{R_{N}}}}\right|^{2} a_{N} P_{t}}{\sigma^{2}}. $$
(4)
To provide a simple and practical decoding, the relays will reconstruct and forward new superposition coded signals, and the user jointly decodes the information symbols from the received signals by employing the linear combination. In fact, only the signals that come from the approaching relays need to be provided for decoding the desired signal. Indeed, when transmitting the reconstructed signals, the power allocation strategy at the relay needs to be designed, which means that a power allocation is still required at each node. As shown in Fig. 1, there are N relay nodes, and the corresponding power allocation coefficients \(b_{R_{i}}\) with \(\sum \nolimits _{i=1}^{N} b_{R_{i}}=1\) are considered in the system. At this time, considering the power reallocation at each relay node for transmission, third stage power allocation will occur with coefficients ck with \(\sum \nolimits _{k=1}^{N} c_{k}=1\), which will make the system analysis complex and not suitable for research. For simplicity, the information transmitted at each relay node will no longer be allocated in the relay layer but rather sent out with full power.

2.1 Single-relay scenario

To successfully analyze the multi-relay case, we first consider a single-relay case, which is a simple CRS consisting of only one source, one relay, and one destination. Assume that a direct link between the source and the destination exists, the destination jointly decodes the received signals from both the source and the relay.
At the first time slot, the BS simultaneously transmits the signal \(\sqrt {{a}_{1}{P}_{t}} s_{1}+\sqrt {{a}_{2}{P}_{t}} s_{2}\) to the relay and destination, where sk denotes the broadcast symbol at the source and a1 and a2 with a1+a2=1 are the power allocation factors. At the second time slot, a new symbol sr with superposition coding \(s_{r}=\sqrt {{b}_{1}{P}_{t}} s_{1}- \sqrt {{b}_{2}{P}_{t}} s_{2}\) is forwarded from the relay node to the destination, where b1 and b2 with b1+b2=1 are new power allocation coefficients. Note that the subtraction is necessary, and it can perfectly cancel the interference signals at the destination. The received signals at the destination can be written as
$$ {y}_{D}^{(1)} = {h}_{SD} \left({\sqrt{{a}_{1}{P}_{t}} s_{1} + \sqrt{{a}_{2}{P}_{t}} s_{2}}\right) + {n}_{D}^{(1)}, $$
(5)
$$ {y}_{D}^{(2)} = {h}_{RD} \left({\sqrt{{b}_{1}{P}_{t}} s_{1} - \sqrt{{b}_{2}{P}_{t}} s_{2}}\right) + {n}_{D}^{(2)}, $$
(6)
where \(n_{D}^{(i)}\) is the AWGN at the destination during the ith time slot with zero mean and variance σ2. To jointly decode s1 and s2 at the destination, a linear combination is employed to produce interference-free signals \(y_{D}^{(1)} \sqrt {{b}_{2}} h_{RD}+y_{D}^{(2)} \sqrt {{a}_{2}} h_{SD}\) and \(y_{D}^{(1)} \sqrt {{b}_{1}} h_{RD}-y_{D}^{(2)} \sqrt {{a}_{1}} h_{SD}.\) Therefore, the target signals can be expressed as
$$ {T}_{s_{1}} = {h}_{SD} {h}_{RD} \zeta {\sqrt{{P}_{t}}} {s_{1}} + {\sqrt{{b}_{2}}} {h}_{RD}{n}_{D}^{(1)} + \sqrt{{a}_{2}} {h}_{SD}{n}_{D}^{(2)}, $$
(7)
and
$$ {T}_{s_{2}} = {h}_{SD} {h}_{RD} \zeta {\sqrt{{P}_{t}}}{s_{2}} + {\sqrt{{b}_{1}}} {h}_{RD}{n}_{D}^{(1)} - \sqrt{{a}_{1}} {h}_{SD}{n}_{D}^{(2)}, $$
(8)
where \(\zeta =\sqrt {{a}_{1}{b}_{2}}+\sqrt {{a}_{2}{b}_{1}}\). With (7) and (8), the corresponding effective SNRs for s1 and s2 are given by
$$ \gamma_{D}^{(s_{1})} = \frac{\left|{h_{{S}{D}}}\right|^{2} \left|{h_{{R}{D}}}\right|^{2} \zeta^{2} \rho}{{b_{2} \left|{h_{{R}{D}}}\right|^{2} + a_{2} \left|{h_{{S}{R}}}\right|^{2}}}, $$
(9)
and
$$ \gamma_{D}^{(s_{2})} = \frac{\left|{h_{{S}{D}}}\right|^{2} \left|{h_{{R}{D}}}\right|^{2} \zeta^{2} \rho}{{b_{1} \left|{h_{{R}{D}}}\right|^{2} + a_{1} \left|{h_{{S}{R}}}\right|^{2}}}, $$
(10)
respectively, where \(\rho =\frac {P_{t}}{{\sigma ^{2}}}\) denotes the transmit SNR.

2.2 Proposed multi-relay scheme

In this subsection, we extend the single-relay case into the case with multiple users and relays, i.e., CMRS-NOMA. Note that direct links between the BS and the users are not considered since such consideration will lead to extreme complexity for the power allocation. Moreover, in this study, our aim is to demonstrate that our proposed reconstruction at the relay node has advantages compared with the directly forwarding one.
In this scheme, in the first phase, the source broadcasts N symbols \(\sum \nolimits _{k=1}^{N} \sqrt {{a}_{k}{P}_{t}} s_{k}\) only to the relay nodes and the received signal at the ith relay in multiple relay nodes, as shown in Eq. (1). By employing SIC, all the relay nodes can decode the symbols successively. In the second phase, the relay nodes reconstruct new superposition coded signals by using linear operations. In contrast to the single-relay case, there are multiple relay nodes, where different relay nodes will reconstruct in a different way by using different linear operations and forward them to the user in a short-range circular communication area. In this process, a two-stage NOMA power allocation scheme at the BS and the relay nodes is introduced. The choice of decoding method at each user after the relay nodes forward new NOMA signals directly affects whether the interference signals are perfectly cancelled. Because the relays in the approaching range are allowed to assist the transmission, each user and the corresponding relay nodes can be implemented as one group. By using simple addition and division, all the other signals except the desired one will be removed.
Our proposed linear operations at the relay nodes can be described as a simple algorithm. The detailed steps of the linear algorithm are as follows:
  • Step 1: We first choose a relay in the direction of 90° of the coordinate axis and mark it as the number 1 relay; then, along the clockwise direction, we mark the remaining relays as 2,3…until the last relay is marked as N. Assume that multiple relay nodes are distributed in a cellular around the BS with equal distances from the relays to the BS and that the last relay node is connected with the first one.
  • Step 2: To handle the operational demands in the distributed relay nodes, we place all the adjacent relay node pairs into a node pair list (NPL) and identify the corresponding users within the overlapping area of the relay node pairs at the destinations that are outside of the BS service area. The NPL and CU of step 2 are given in Table 1.
  • Step 3: For the node pairs that have been served, we obtain each new symbol \(s_{R_{i}}(1\leq {i}\leq {N})\) from a simple linear combination in sequence and forward them to the area with the full power of a single antenna. The reconstructed signal combinations for each relay are shown in the following group.
    $$ {\left\{\begin{array}{lr} s_{R_{1}}=\sqrt{{b}_{R_{1}}{a}_{1}{P}_{t}} s_{1}+\sqrt{{b}_{R_{1}}{a}_{2}{P}_{t}} s_{2}+\sqrt{{b}_{R_{1}}{a}_{3}{P}_{t}} s_{3}+\cdots+\sqrt{{b}_{R_{1}}{a}_{N}{P}_{t}} s_{N}&(a) \\ s_{R_{2}}=\sqrt{{b}_{R_{2}}{a}_{1}{P}_{t}} s_{1}-\sqrt{{b}_{R_{2}}{a}_{2}{P}_{t}} s_{2}-\sqrt{{b}_{R_{2}}{a}_{3}{P}_{t}} s_{3}-\cdots-\sqrt{{b}_{R_{2}}{a}_{N}{P}_{t}} s_{N}&(b) \\ s_{R_{3}}=\sqrt{{b}_{R_{3}}{a}_{1}{P}_{t}} s_{1}+\sqrt{{b}_{R_{3}}{a}_{2}{P}_{t}} s_{2}-\sqrt{{b}_{R_{3}}{a}_{3}{P}_{t}} s_{3}-\cdots-\sqrt{{b}_{R_{3}}{a}_{N}{P}_{t}} s_{N}&(c) \\ s_{R_{4}}=\sqrt{{b}_{R_{4}}{a}_{1}{P}_{t}} s_{1}+\sqrt{{b}_{R_{4}}{a}_{2}{P}_{t}} s_{2}+\sqrt{{b}_{R_{4}}{a}_{3}{P}_{t}} s_{3}-\cdots-\sqrt{{b}_{R_{4}}{a}_{N}{P}_{t}} s_{N}&(d) \\ \vdots \\ s_{R_{N}}=\sqrt{{b}_{R_{N}}{a}_{1}{P}_{t}} s_{1}+\sqrt{{b}_{R_{N}}{a}_{2}{P}_{t}} s_{2}+\sqrt{{b}_{R_{N}}{a}_{3}{P}_{t}} s_{3}+\cdots-\sqrt{{b}_{R_{N}}{a}_{N}{P}_{t}} s_{N}&(\cdot)\\ \end{array} \right.} $$
    (11)
  • Step 4: After we finish reconstructing the new signals for each relay and send them out, we can jointly decode the received signals from two adjacent relays by employing a simple linear combination method at the users. As shown in the above expressions, for example, signal 1 is obtained by adding \(\left (s_{R_{1}}\cdot \sqrt {b_{R_{2}}}\right)\) to \(\left (s_{R_{2}}\cdot \sqrt {b_{R_{1}}}\right)\) and then dividing by \(\left (2\cdot \sqrt {b_{R_{1}} b_{R_{2}} a_{1} P_{t}}\right)\). Signal 2 is achieved by subtracting \(\left (s_{R_{2}}\cdot \sqrt {b_{R_{3}}}\right)\) from \(\left (s_{R_{3}}\cdot \sqrt {b_{R_{2}}}\right)\) and then dividing by \(\left (2\cdot \sqrt {b_{R_{2}} b_{R_{3}} a_{2} P_{t}}\right)\). The remainder can be achieved in the same manner, and the last signal N will be acquired by also deducting the end equation, i.e., \(\left (s_{R_{N}}\cdot \sqrt {b_{R_{1}}}\right)\), from the first, i.e., \(\left (s_{R_{1}}\cdot \sqrt {b_{R_{N}}}\right)\), and then dividing by \(\left (2\cdot \sqrt {b_{R_{N}} b_{R_{1}} a_{N} P_{t}}\right)\). Afterwords, all the signals will have been successfully decoded.
Table 1
RNP and corresponding user
Relay node pair
Corresponding user
(R1,R2)
(D1,user1)
(R2,R3)
(D2,user2)
(RN−1,RN)
(DN−1,userN−1)
(RN,R1)
(DN,userN)
Taking signal 1 as an example, we analyze the received signal of user1 that is cooperated by the number 1 and number 2 relays. Because ak and \(b_{R_{i}}\) in group (11) are power allocation factors that meet their respective conditions, i.e., \(\sum \nolimits _{k=1}^{N} a_{k}=1\) and \(\sum \nolimits _{i=1}^{N} b_{R_{i}}=1\), group (11) can be simplified by allowing \(\phantom {\dot {i}\!}c_{ik}={b_{R_{i}}}\times {a_{k}}\), and formulae (11-a) and (11-b) can be described as
$$ {\begin{aligned} {s}_{R_{1}}=\sqrt{{c}_{11}{P}_{t}} s_{1}+\sqrt{{c}_{12}{P}_{t}} s_{2}+\cdots+\sqrt{{c}_{1(N-1)}{P}_{t}} s_{N-1}+\sqrt{{c}_{1N}{P}_{t}} s_{N}, \end{aligned}} $$
(12)
and
$$ {\begin{aligned} {s}_{R_{2}}=\sqrt{{c}_{21}{P}_{t}} s_{1}-\sqrt{{c}_{22}{P}_{t}} s_{2}-\cdots-\sqrt{{c}_{{2(N-1)}}{P}_{t}} s_{N-1}-\sqrt{{c}_{2N}{P}_{t}} s_{N}. \end{aligned}} $$
(13)
In our proposed system, the relay nodes forward new reconstructed symbols \(s_{R_{i}}\) with superposition signals to users as shown in the above formulae. Note that signals from two adjacent relay nodes only need to be processed simply to obtain the desired signal. With (12) and (13), the received signal at user1 can be written as
$$\begin{array}{@{}rcl@{}} {y}_{D_{1}}^{(R_{1})} &=& {h}_{{R_{1}}{D_{1}}} \times{s}_{R_{1}} + {n}_{D_{1}}^{(R_{1})}\\ &=&{h}_{{R_{1}}{D_{1}}} \times\left({\sqrt{{c}_{11}{P}_{t}} s_{1} + \sum\limits_{k=2}^{N} \sqrt{{c}_{1k}{P}_{t}} s_{k}}\right) + {n}_{D_{1}}^{(R_{1})}, \end{array} $$
(14)
$$\begin{array}{@{}rcl@{}} {y}_{D_{1}}^{(R_{2})} &=& {h}_{{R_{2}}{D_{1}}} \times{s}_{R_{2}} + {n}_{D_{1}}^{(R_{2})}\\ &=&{h}_{{R_{2}}{D_{1}}} \times\left({\sqrt{{c}_{21}{P}_{t}} s_{1} - \sum\limits_{k=2}^{N} \sqrt{{c}_{2k}{P}_{t}} s_{k}}\right) + {n}_{D_{1}}^{(R_{2})}, \end{array} $$
(15)
where \({n}_{D_{1}}^{(R_{i})}\) is the AWGN at user1 from the ith relay node during the second time slot with zero mean and variance σ2. From the above, we find that there are two signals received at user1, which are \({y}_{D_{1}}^{(R_{1})}\) and \({y}_{D_{1}}^{(R_{2})}\). As the single-relay model scheme, user1 jointly decodes s1. With a simple linear combination, we could produce interference-free signal \(y_{D_{1}}^{(R_{1})} \sqrt {b_{R_{2}}} h_{{R_{2}}{D_{1}}}+y_{D_{1}}^{(R_{2})} \sqrt {b_{R_{1}}} h_{{R_{1}}{D_{1}}}\) for s1 at user1, with the target signal \(T_{s_{1}}\) as
$$ {T}_{s_{1}} \,=\, {h}_{{R_{1}}{D_{1}}} {h}_{{R_{2}}{D_{1}}} \!\varsigma {\sqrt{{P}_{t}}} {s_{1}} + \sqrt{b_{R_{2}}} h_{{R_{2}}{D_{1}}}{n}_{D_{1}}^{(R_{1})} \,+\, \sqrt{b_{R_{1}}} h_{{R_{1}}{D_{1}}}\!{n}_{D_{1}}^{(R_{2})}, $$
(16)
where \(\varsigma =\sqrt {c_{11} b_{R_{2}}}+\sqrt {c_{21} b_{R_{1}}}=2\sqrt {b_{R_{1}} b_{R_{2}} a_{1}}\). If we perform symbol-by-symbol detection based on the output signals (16), the corresponding effective SNR for s1 is given by
$$ \gamma_{D_{1}}^{(s_{1})} = \frac{\left|{h_{{R_{1}}{D_{1}}}}\right|^{2} \left|{h_{{R_{2}}{D_{1}}}}\right|^{2} \varsigma^{2} \rho}{{b_{R_{2}} \left|{h_{{R_{2}}{D_{1}}}}\right|^{2}}+ {b_{R_{1}} \left|{h_{{R_{1}}{D_{1}}}}\right|^{2}}}, $$
(17)
where \(\rho =\frac {P_{t}}{{\sigma ^{2}}}\) denotes the transmit SNR.
Clearly, signal 2 to signal N−1 can be obtained in a similar manner, i.e., for sk(2≤kN−1) at user i, the interference-free signals \(y_{D_{i}}^{(R_{i+1})} \sqrt {b_{R_{i}}} h_{{R_{i}}{D_{i}}}-y_{D_{i}}^{(R_{i})} \sqrt {b_{R_{i+1}}} h_{{R_{i+1}}{D_{i}}}\) could also be generated by employing the same method. As described in step 4 above, the interference-free signal for sN at user N (the last signal N) will be generated by \(y_{D_{N}}^{(R_{1})} \sqrt {b_{R_{N}}} h_{{R_{N}}{D_{N}}}-y_{D_{N}}^{(R_{N})} \sqrt {b_{R_{1}}} h_{{R_{1}}{D_{N}}}\). Similar to the previous descriptions, the target signal \(T_{s_{i}} (2\leq {i}\leq {N-1})\) can be expressed as
$$ {\begin{aligned} {T}_{s_{i}} = {h}_{{R_{i}}{D_{i}}} {h}_{{R_{i+1}}{D_{i}}} \varsigma {\sqrt{{P}_{t}}} {s_{i}} +\sqrt{b_{R_{i+1}}} h_{{R_{i+1}}{D_{i}}}{n}_{D_{i}}^{(R_{i})} + \sqrt{b_{R_{i}}} h_{{R_{i}}{D_{i}}}{n}_{D_{i}}^{(R_{i+1})}, \end{aligned}} $$
(18)
where \(\varsigma =2\sqrt {b_{R_{i}} b_{R_{i+1}} a_{i}}\); hence, the expressions of interference-free signal for \(T_{s_{i}} (1\leq {i}\leq {N-1})\) are the same. However, the last one is slightly different from the ones in front; it is
$$ {\begin{aligned}{T}_{s_{N}} = {h}_{{R_{1}}{D_{N}}} {h}_{{R_{N}}{D_{N}}} \varsigma {\sqrt{{P}_{t}}} {s_{N}} + \sqrt{b_{R_{N}}} h_{{R_{N}}{D_{1}}}{n}_{D_{N}}^{(R_{1})} + \sqrt{b_{R_{1}}} h_{{R_{1}}{D_{N}}}{n}_{D_{N}}^{(R_{N})}, \end{aligned}} $$
(19)
where \(\varsigma =2\sqrt {b_{R_{N}} b_{R_{1}} a_{N}}\). Therefore, the corresponding effective SNRs for si(1≤iN−1) and sN are given as
$$ \gamma_{D_{i}}^{(s_{i})} = \frac{4\left|{h_{{R_{i+1}}{D_{i}}}}\right|^{2} \left|{h_{{R_{i}}{D_{i}}}}\right|^{2} {(b_{R_{i}} b_{R_{i+1}} a_{i})} \rho}{{b_{R_{i+1}} \left|{h_{{R_{i+1}}{D_{i}}}}\right|^{2} + b_{R_{i}} \left|{h_{{R_{i}}{D_{i}}}}\right|^{2}}}, $$
(20)
and
$$ \gamma_{D_{N}}^{(s_{N})} = \frac{4\left|{h_{{R_{1}}{D_{N}}}}\right|^{2} \left|{h_{{R_{N}}{D_{N}}}}\right|^{2} {(b_{R_{N}} b_{R_{1}} a_{N})} \rho}{{b_{R_{N}} \left|{h_{{R_{N}}{D_{1}}}}\right|^{2} + b_{R_{1}} \left|{h_{{R_{1}}{D_{N}}}}\right|^{2}}}, $$
(21)
where \(\rho =\frac {P_{t}}{{\sigma ^{2}}}\) denotes the transmit SNR.

3 Performance analysis

In this section, we will analyze the performance of the achievable ergodic SR and the outage probability to characterize the superiority of our proposed scheme.

3.1 Ergodic SR analysis

According to Shannon’s theorem, the achievable rate for symbol s1 can be obtained from \(\gamma _{R_{1}}^{(s_{1})}, \gamma _{R_{2}}^{(s_{1})}\), and \(\gamma _{D}^{(s_{1})}\) as
$$ {C}_{s_{1}} = {\frac{1}{2}} \log_{2}{\Big(1+\min{\left\{\gamma_{R_{1}}^{(s_{1})},\gamma_{R_{2}}^{(s_{1})},\gamma_{D_{1}}^{(s_{1})}\right\}}\Big)}, $$
(22)
where \(\frac {1}{2}\) results from the two-hop transmission. Without loss of generality, the received signals corresponding to the relay node pairs can be described as
$$ {C}_{s_{i}} = {\frac{1}{2}} \log_{2}{\Big(1+\min{\left\{\gamma_{R_{i}}^{(s_{i})},\gamma_{R_{i+1}}^{(s_{i})},\gamma_{D_{i}}^{(s_{i})}\right\}}\Big)}. $$
(23)
Therefore, the achievable SR can be expressed as
$$ {C}_{sum} = \sum\limits_{i=1}^{N} {C}_{s_{i}}. $$
(24)
Denoting \(\left |{h_{SR_{i}}}\right |^{2} = \nu _{SR_{i}}, \left |{h_{{R_{i}}{D_{j}}}}\right |^{2} = \nu _{{R_{i}}{D_{j}}}, d_{i}=b_{R_{i}} b_{R_{i+1}} a_{i}\), and \(\tau ={\sum \limits _{\scriptstyle {m=i+1} \hfill \atop \scriptstyle \hfill }^{N} a_{m}}\), we have
$$ \begin{array}{lr} \min{\left\{\gamma_{R_{i}}^{(s_{i})},\gamma_{R_{i+1}}^{(s_{i})},\gamma_{D_{i}}^{(s_{i})}\right\}} &\\\\ =\! \min\!{\Big\{{\frac{\left|{h_{{S}{R_{i}}}}\right|^{2} a_{i} \rho}{{\left|{h_{{S}{R_{i}}}}\right|^{2} \tau \rho + 1}}},\!\!\!\quad {\frac{\left|{h_{{S}{R_{i+1}}}}\right|^{2} a_{i} \rho}{{\left|{h_{{S}{R_{i+1}}}}\right|^{2} \tau \rho + 1}}},\!\!\!\quad {\frac{4\left|{h_{{R_{i}}{D_{i}}}}\right|^{2} \left|{h_{{R_{i+1}}{D_{i}}}}\right|^{2} d_{i} \rho}{{b_{R_{i+1}} \left|{h_{{R_{i+1}}{D_{i}}}}\right|^{2} + b_{R_{i}} \left|{h_{{R_{i}}{D_{i}}}}\right|^{2}}}}\!\Big\}} &\\\\ =\!\min\!{\Big\{{\frac{\nu_{SR_{i}} a_{i} \rho}{{\nu_{SR_{i}} \tau \rho + 1}}},\quad {\frac{\nu_{SR_{i+1}} a_{i} \rho}{{\nu_{SR_{i+1}} \tau \rho + 1}}},\quad {\frac{4\nu_{{R_{i}}{D_{i}}} \nu_{{R_{i+1}}{D_{i}}} d_{i} \rho}{{b_{R_{i+1}} \nu_{{R_{i+1}{D_{i}}}}+ b_{R_{i}} \nu_{{R_{i}}{D_{i}}}}}}\Big\}}, &\\ \end{array} $$
(25)
where i∈[1,N−1] and im. For the case of i=N, the achievable rate \(C_{s_{N}}\) can be written as
$$ {C}_{s_{N}} = {\frac{1}{2}} \log_{2}{\left(1+\min{\left\{\gamma_{R_{N}}^{(s_{N})},\gamma_{R_{1}}^{(s_{N})},\gamma_{D_{N}}^{(s_{N})}\right\}}\right)}. $$
(26)
According to (21), \(\phantom {\dot {i}\!}d_{N}=b_{R_{N}} b_{R_{1}} a_{N}\), for i=N, we have
$$ \begin{array}{ lr } \min{\Big\{\gamma_{R_{N}}^{(s_{N})},\gamma_{R_{1}}^{(s_{N})},\gamma_{D_{N}}^{(s_{N})}\Big\}} &\\\\ =\! \min\!{\Big\{{\left|{h_{{S}{R_{N}}}}\!\right|^{2} \!a_{N} \rho},\!\!\!\!\quad {\left|{h_{{S}{R_{1}}}}\right|^{2} a_{N} \rho},\!\!\!\quad {\frac{4\left|{h_{{R_{N}}{D_{N}}}}\right|^{2} \left|{h_{{R_{1}}{D_{N}}}}\right|^{2} d_{N} \rho}{{b_{R_{1}} \left|{h_{{R_{1}}{D_{N}}}}\right|^{2} + b_{R_{N}} \left|{h_{{R_{N}}{D_{N}}}}\right|^{2}}}}\!\Big\}} &\\\\ =\!\min\!{\Big\{{\nu_{SR_{N}} a_{N} \rho}, \quad {\nu_{SR_{1}} a_{N} \rho},\quad {\frac{4\nu_{{R_{N}}{D_{N}}} \nu_{{R_{1}}{D_{N}}} d_{N} \rho}{{b_{R_{1}} \nu_{{R_{1}{D_{N}}}}+ b_{R_{N}} \nu_{{R_{N}}{D_{N}}}}}}\Big\}}. &\\ \end{array} $$
(27)
Letting \(X=\min {\{\gamma _{R_{i}}^{(s_{i})},\gamma _{R_{i+1}}^{(s_{i})},\gamma _{D_{i}}^{(s_{i})}\}}\), from (25) in which iN, the complementary cumulative distribution function(CCDF) of X can be formulated as
$$\begin{array}{@{}rcl@{}} \small {\begin{array}{ lr } \overline{F}_{X} {(x)}\,=\,{Pr} {\Big\{{\frac{\nu_{SR_{i}} a_{i} \rho}{{\nu_{SR_{i}} \tau \rho + 1}}\!>\!x}, {\frac{\nu_{SR_{i+1}} a_{i} \rho}{{\nu_{SR_{i+1}} \tau \rho + 1}}\!>\!x}, {\frac{4\nu_{{R_{i}}{D_{i}}} \nu_{{R_{i+1}}{D_{i}}} d_{i} \rho}{{b_{R_{i+1}} \nu_{{R_{i+1}{D_{i}}}}+ b_{R_{i}} \nu_{{R_{i}}{D_{i}}}}}>x}\Big\}}. \end{array}} \end{array} $$
(28)
Note that the CCDF of \(\overline {F}_{\nu (\delta)}=e^{-\frac {x}{\beta _{\delta }}}\), for δ∈{SRi,RiDj}, Eq. (28) is equivalent to (29), as shown at the top of the next page, where Pr{A|B} denotes the conditional probability of event A on event B, and E[·] stands for statistical expectation.
$$ {\begin{aligned} \overline{F}_{X}{(x)}&=\overline{F}_{SR_{i}} {\left(\frac{x}{{a_{i}}\rho-{\tau}\rho x}\right)} \overline{F}_{SR_{i+1}} {\left(\frac{x}{{a_{i}}\rho-{\tau}\rho x}\right)} \\ & \Big(E_{\nu_{R_{i+1}D_{i}}}\left[{Pr}{\left\{\nu_{R_{i}D_{i}}>\frac{b_{R_{i+1}} \nu_{R_{i+1}D_{i}} x}{4\nu_{R_{i+1}D_{i}} d_{i} \rho- b_{R_{i}} x}|\nu_{R_{i+1}D_{i}}>\frac{b_{R_{i}} x}{4 d_{i} \rho}\right\}}\right] \\ & \!\!+E_{\nu_{R_{i+1}D_{i}}}\left[{Pr}{\left\{\nu_{R_{i}D_{i}}\!<\!\frac{b_{R_{i+1}} \nu_{R_{i+1}D_{i}} x}{4\nu_{R_{i+1}D_{i}} d_{i} \rho-b_{R_{i}} x}|\nu_{R_{i+1}D_{i}}\!<\!\frac{b_{R_{i}} x}{4 d_{i} \rho}\right\}}\right]\Big) \\ &\ \,\, =\Bigg\{\frac{1}{\beta_{R_{i+1}{D_{i}}}}e^{-\frac{x}{{[{a_{i}}\rho-{\tau}\rho x]\beta_{SR_{i}}}}-\frac{x}{{[{a_{i}}\rho-{\tau}\rho x]\beta_{SR_{i+1}}}}-\frac{b_{R_{i}} x}{4 d_{i} \rho \beta_{R_{i+1}D_{i}}}} \\ &\int_{\frac{b_{R_{i}} x}{4 d_{i} \rho}}^{\infty}e^{-\frac{b_{R_{i+1}}ux}{{(4 d_{i} \rho u-b_{R_{i}} x)}\beta_{R_{i}D_{i}}}-\frac{u}{\beta_{R_{i+1}D_{i}}}}du\Bigg\}\\&+\Bigg\{e^{-\frac{x}{{[{a_{i}}\rho-{\tau}\rho x]\beta_{SR_{i}}}}-\frac{x}{{[{a_{i}}\rho-{\tau}\rho x]\beta_{SR_{i+1}}}}} \left(1-e^{-\frac{b_{R_{i}} x}{4 d_{i} \rho \beta_{R_{i+1}D_{i}}}}\right)\\ & \int_{0}^{\frac{b_{R_{i}} x}{4 d_{i} \rho}}1-\frac{1}{\beta_{R_{i+1}D_{i}}} e^{-\frac{b_{R_{i+1}}ux}{{(4 d_{i} \rho u-b_{R_{i}} x)}\beta_{R_{i}D_{i}}}-\frac{u}{\beta_{R_{i+1}D_{i}}}}du\Bigg\}, \end{aligned}} $$
(29)
Since Eq. (29) is too complex to calculate, the high transmit SNR case is considered to simplify the calculation, i.e., ρ>>1, and we have the following approximations
$$ \frac{\nu_{SR_{i}} a_{i} \rho}{{\nu_{SR_{i}} \tau \rho + 1}}\sim\frac{a_{i}}{\tau}, $$
(30)
and
$$ \frac{\nu_{SR_{i+1}} a_{i} \rho}{{\nu_{SR_{i+1}} \tau \rho + 1}}\sim\frac{a_{i}}{\tau}. $$
(31)
Letting \(\phantom {\dot {i}\!}t=4 d_{i} \rho u - b_{R_{i}} x\) and using \(\int _{0}^{\infty }e^{-\frac {A}{x}-Bx}dx=2\sqrt {\frac {A}{B}}K_{1}(2\sqrt {AB})\) [30]—Eq. (3.324.1), when \(x<\frac {a_{i}}{\tau } \left (\tau ={\sum \limits _{\scriptstyle {m=i+1} \hfill \atop \scriptstyle \hfill }^{N} a_{m}}\right)\), (29) can be equivalently written as
$$ \begin{aligned} \overline{F}_{X}{(x)}&\,=\,\frac{e^{-\frac{x}{4 d_{i} \rho }\left(\frac{b_{R_{i+1}}}{\beta_{R_{i}D_{i}}}+\frac{b_{R_{i}}}{\beta_{R_{i+1}D_{i}}} \right)}}{4\beta_{R_{i+1}D_{i}} d_{i} \rho} \int_{0}^{\infty}e^{\!-\frac{b_{R_{i}} b_{R_{i+1}} x^{2}}{4 d_{i} \rho t\beta_{R_{i}D_{i}}}\,-\,\frac{t}{4 d_{i} \rho \beta_{R_{i+1}D_{i}}}}dt \\ &\!=\frac{x}{\xi} e^{-x \phi} K_{1} \left(\frac{x}{\xi}\right), \end{aligned} $$
(32)
where \(\xi =2 d_{i} \rho \sqrt {\frac {\beta _{R_{i}D_{i}} \cdot \beta _{R_{i+1}D_{i}}}{b_{R_{i}} \cdot b_{R_{i+1}}}}, \phi =\frac {1}{4 d_{i} \rho }\left (\frac {b_{R_{i+1}}}{\beta _{R_{i}D_{i}}}+\frac {b_{R_{i}}}{\beta _{R_{i+1}D_{i}}} \right)\), and K1(·) denotes the first-order modified Bessel function of the second kind [31]. For the case \(x>\frac {a_{i}}{\tau } \left (\tau ={\sum \limits _{\scriptstyle {m=i+1} \hfill \atop \scriptstyle \hfill }^{N} a_{m}}\right), \overline {F}_{X}{(x)}=0\) always holds due to Eqs. (30) and (31). With (32), the achievable ergodic rate can be calculated as (33).
$$ {\begin{aligned} \widetilde{C}_{s_{i}}\,=\,& \int_{0}^{\frac{a_{i}}{\tau}} \frac{1}{2} \log_{2} (1+x) dF_{X}(x) \,+\, \frac{1}{2} \log_{2} \left(1\,+\,\frac{a_{i}}{\tau}\right) \left(1\,-\,F_{X}\left(\frac{a_{i}}{\tau}\right)\right) \\ \,=\,&\frac{1}{2} \log_{2} \left(1\,+\,\frac{a_{i}}{\tau}\right)\,-\,\frac{1}{2\ln2}\int_{0}^{\frac{a_{i}}{\tau}}\frac{1}{1\,+\,x} \Big(1\,-\,\frac{x}{\xi} e^{-x \phi} K_{1} \left(\frac{x}{\xi}\right)\Big)dx \\ =&\int_{0}^{\frac{a_{i}}{\tau}} \frac{1}{2\ln2 (1+x)} \frac{x}{\xi} e^{-x \phi} K_{1} \left(\frac{x}{\xi}\right) dx. \end{aligned}} $$
(33)
Using the equality of \(\int _{0}^{\infty }\frac {1}{2}\log _{2} (1+x) f_{X}(x)dx=\frac {1}{2\ln 2}\int _{0}^{\infty }\frac {1-F_{X}(x)}{1+x}dx\) and \(F_{X}(x)=1-\overline {F}_{X}(x)\) and the approximation \(K_{v}(x)\approx \frac {\Gamma (v)}{2}\left (\frac {2}{x}\right)^{v}\) [32]—Eq. (9.69) in the case of small x, where Γ(·) denotes the gamma function, (33) can be approximately rewritten as
$$\begin{array}{@{}rcl@{}} \widetilde{C}_{s_{i}}&\sim & \frac{1}{2\ln2}\int_{0}^{\frac{a_{i}}{\tau}} \frac{1}{1+x} e^{-x \phi }dx \\ &=&\frac{e^{\phi}}{2\ln2} \Bigg[ Ei\Big(- \phi \frac{a_{i}}{\tau} -\phi \Big) - Ei\Big(- \phi\Big)\Bigg], \end{array} $$
(34)
where \(\int _{0}^{u}\frac {e^{-\mu x} dx}{x+\psi }=e^{\mu \psi }[Ei(\mu u-\mu \psi)-Ei(-\mu \psi)]\) [31]—Eq. (3.352.1) is used, and Ei(·) denotes the exponential integral function. The approximate closed expression obtained from the above analysis only satisfies the case where i∈[1,N−1].
By using a similar analysis method, letting \(Y=\min {\left \{\gamma _{R_{N}}^{(s_{N})},\gamma _{R_{1}}^{(s_{N})},\gamma _{D_{N}}^{(s_{N})}\right \}}\), from (27) in which i=N, the CCDF of Y can be formulated as
$$ \begin{aligned} \overline{F}_{Y}{(y)}&={Pr} {\Big\{{\nu_{SR_{N}} a_{N} \rho}\! > y, \ {\nu_{SR_{1}} a_{N} \rho} >\! y, \ {\frac{4\nu_{{R_{N}}{D_{N}}} \nu_{{R_{1}}{D_{N}}} d_{N} \rho}{{b_{R_{1}} \nu_{{R_{1}{D_{N}}}}+ b_{R_{N}} \nu_{{R_{N}}{D_{N}}}}}}> y \Big\}} \\ &=\overline{F}^{(1)}_{Y}{(y)} \times \overline{F}^{(2)}_{Y}{(y)} \times \overline{F}^{(3)}_{Y}{(y)} \\ &= e^{-\frac{y}{a_{N} \beta_{SR_{N}} \rho }} \times e^{-\frac{y}{a_{N} \beta_{SR_{1}} \rho }} \times \overline{F}^{(3)}_{Y}{(y)}, \end{aligned} $$
(35)
where \(\tiny \overline {F}^{(1)}_{Y}{(y)}\!\! =\!\! {Pr}{\{{\nu _{SR_{N}} a_{N} \rho }\!\! >\! y\}}, \tiny \overline {F}^{(2)}_{Y}{(y)}\,=\,{Pr}{\{{\nu _{SR_{1}} a_{N} \rho }\!\! >\! y\}}\) and \(\tiny \overline {F}^{(3)}_{Y}{\!(y)}\!\! =\!\! {Pr}{\{{\frac {4\nu _{{R_{\!N}}{D_{\!N}}}\nu _{{R_{\!1}}{D_{\!N}}}d_{\!N}\rho }{{b_{R_{\!1}} \nu _{{R_{\!1}{D_{\!N}}}}+ b_{R_{\!N}} \nu _{{R_{\!N}}{D_{\!N}}}}}}\!\! >\!\! y\}}\). Letting \(\lambda _{\!1}\!\!\! = \!\!\! \frac {2 b_{R_{\!N}}}{4 d_{\!N} \rho \beta _{R_{\!1} D_{\!N}}}\!\) and \(\lambda _{2}=\frac {2 b_{R_{1}}}{4 d_{N} \rho \beta _{R_{N} D_{N}}}\), since \(\overline {F}^{(3)}_{Y}{(y)}\) could be written as \(\overline {F}^{(3)}_{Y}{(y)}={Pr}{\left \{\frac {2 d_{N} \rho } {b_{R_{N}} b_{R_{1}}} \times \frac {2 (b_{R_{N}} \nu _{{R_{N}}{D_{N}}}) (b_{R_{1}} \nu _{{R_{1}}{D_{N}}})}{b_{R_{N}} \nu _{{R_{N}}{D_{N}}}+b_{R_{1}} \nu _{{R_{1}}{D_{N}}}}>y\right \}}\), with the help of the cumulative distribution function(CDF) of the harmonic mean of two exponential variables, i.e., assuming that Z1 and Z2 are two independent exponential variables with parameters λ1 and λ2 respectively, the CDF of \(Z=\frac {2 Z_{1} Z_{2}}{Z_{1} + Z_{2}}, P_{Z}(z)\), is given by
$$ P_{Z}(z)=1-z\sqrt{\lambda_{1} \lambda_{2}} e^{-\frac{z}{2}(\lambda_{1}+\lambda_{2})} K_{1}(z\sqrt{\lambda_{1} \lambda_{2}}). $$
(36)
Thus, the CCDF of Z can be written as
$$ 1-P_{Z}(z)=z\sqrt{\lambda_{1} \lambda_{2}} e^{-\frac{z}{2}(\lambda_{1}+\lambda_{2})} K_{1}(z\sqrt{\lambda_{1} \lambda_{2}}). $$
(37)
Hence, we have
$$ \overline{F}^{(3)}_{Y}{(y)}=\frac{y}{\xi^{\prime}} e^{-y \phi'} K_{1}\left(\frac{y}{\xi^{\prime}}\right), $$
(38)
where \(\xi ^{\prime }=2 d_{N} \rho \sqrt {\frac {\beta _{R_{N}D_{N}} \cdot \beta _{R_{1}D_{N}}}{b_{R_{N}} \cdot b_{R_{1}}}}\) and \(\phi '=\frac {1}{4 d_{N} \rho }\left (\frac {b_{R_{1}}}{\beta _{R_{N}D_{N}}}+\frac {b_{R_{N}}}{\beta _{R_{1}D_{N}}} \right)\). Note that the analysis result of the method is consistent with the extended form of (32), which verifies the correctness of our analysis idea. Therefore, by substituting (38) into (35), the CCDF of Y can finally be expressed as
$$ \overline{F}_{Y}{(y)}=\frac{y}{\xi^{\prime}} e^{-y \phi^{\prime}-\frac{y}{a_{N} \rho}\left(\frac {1}{\beta_{SR_{N}}}+\frac {1}{\beta_{SR_{1}}}\right)} K_{1}\left(\frac{y}{\xi^{\prime}}\right). $$
(39)
Letting \(\psi =\phi '+\frac {1}{a_{N} \rho }\left (\frac {1}{\beta _{SR_{N}}}+\frac {1}{\beta _{SR_{1}}}\right)\) and employing [31]—Eq. (3.352.2), the result (the achievable ergodic rate) of the case i=N (\(\widetilde {C}_{s_{N}}\)) can be obtained as (40).
$$\begin{array}{@{}rcl@{}} \widetilde{C}_{s_{N}}&=&\frac{1}{2 \xi^{\prime} ln{2}} {\int}_{0}^{\infty}\frac{y e^{-\psi y} K_{1}{\left(\frac{y}{\xi^{\prime}}\right)}}{1+y} dy \\ &\sim &-\frac {e^{\psi}}{2 ln{2}} Ei(-\psi). \end{array} $$
(40)
Finally, considering all the cases of i where i∈[1,N] together, we can describe the ergodic SR of our proposed system in a closed form as (41).
$$ \widetilde{C}_{sum}\sim \frac{e^{\phi}}{2\ln2} \Bigg[ Ei\Big(- \phi \frac{a_{i}}{\tau} -\phi \Big) - Ei\Big(- \phi\Big)\Bigg] -\frac {e^{\psi}}{2 ln{2}} Ei(-\psi). $$
(41)

3.2 Outage probability analysis

According to the QoS rates required by users, each user has a predetermined target data rate. When the link capacity cannot meet the required user data rate, communication interruption will occur. Thus, the analysis of outage probability is one of the important performance metrics in our proposed system. In this section, we will analyze the closed-form solutions of the outage probability with its asymptotic expressions. Assume that for si the user’s target rate is Rsi and the predefined target rate threshold is \(R_{\mathcal {T}_{si}}\), the outage probability can be described as
$$ \selectfont{\begin{aligned} P_{out}&= 1-{Pr}\Big\{{R_{s_{1}}>2^{2R_{\mathcal{T}_{s1}}}-1,\cdots,R_{s_{i}} > 2^{2R_{\mathcal{T}_{si}}}-1,\cdots,R_{s_{N}}>2^{2R_{\mathcal{T}_{sN}}}}-1\Big\}\\ &= 1-{Pr}\Big\{{\big(R_{s_{1}}>2^{2R_{\mathcal{T}_{s1}}}-1\big)\cap\cdots\cdots\cap\big(R_{s_{N}}>2^{2R_{\mathcal{T}_{sN}}}-1\big)}\Big\}\\ &= 1-\prod_{i=1}^{N} \underbrace{{Pr}\big(R_{s_{i}}>2^{2R_{\mathcal{T}_{si}}}-1\big)}_{u_{i}}. \end{aligned}} $$
(42)
Assume that \(\mathcal {\omega }_{i}=2^{2 R_{\mathcal {T}_{si}}}-1\) for the sake of simplicity and convenience of analysis, and refer to the above analysis of ergodic SR; therefore, the exact expressions of ui where i∈[1,N−1] can be described as
$$\begin{array}{@{}rcl@{}} {u}_{i}&=& {Pr}\Big\{\text{min}\big(\gamma_{R_{i}}^{(s_{i})},\gamma_{R_{i+1}}^{(s_{i})},\gamma_{D_{i}}^{(s_{i}) }\big)>\mathcal{\omega}_{i}\Big\} \\ &=&{Pr}\Big\{{\gamma_{R_{i}}^{(s_{i})}>\mathcal{\omega}_{i} }\Big\} {Pr} \Big\{{\gamma_{R_{i+1}}^{(s_{i})}>\mathcal{\omega}_{i} }\Big\} {Pr} \Big\{{\gamma_{D_{i}}^{(s_{i}) }>\mathcal{\omega}_{i} }\Big\}. \end{array} $$
(43)
i.e.,
$$ {u}_{i}=\left\{ \begin{array}{lr} e^{-\frac{\mathcal{\omega}_{i} }{4 d_{i} \rho }\left(\frac{b_{R_{i+1}}}{\beta_{R_{i}D_{i}}}+\frac{b_{R_{i}}}{\beta_{R_{i+1}D_{i}}} \right)} \quad & {for} \quad \mathcal{\omega}_{i} < \frac{a_{i}}{\tau} \\ 0 \quad & {for} \quad \mathcal{\omega}_{i} > \frac{a_{i}}{\tau} \\ \end{array} \right.. $$
(44)
For the case uN, it can be written as
$$ \begin{aligned}{u}_{N}&= {Pr}\Big\{\text{min}\big(\gamma_{R_{N}}^{(s_{N})},\gamma_{R_{1}}^{(s_{N})},\gamma_{D_{N}}^{(s_{N}) }\big)>\mathcal{\omega}_{N}\Big\} \\ &={Pr}\Big\{{\gamma_{R_{N}}^{(s_{N})}>\mathcal{\omega}_{N} }\Big\} {Pr} \Big\{{\gamma_{R_{1}}^{(s_{N})}>\mathcal{\omega}_{N} }\Big\} {Pr} \Big\{{\gamma_{D_{N}}^{(s_{N}) }>\mathcal{\omega}_{N} }\Big\}. \end{aligned} $$
(45)
similarly,
$$ {u}_{N}\,=\,\left\{\!\! {\begin{array}{lr} e^{-\frac{\mathcal{\omega}_{N} }{4 d_{N} \rho }\left(\frac{b_{R_{1}}}{\beta_{R_{N}D_{N}}}+\frac{b_{R_{N}}}{\beta_{R_{1}D_{N}}} \right)\,-\,\frac{\mathcal{\omega}_{N} }{a_{N} \rho }\left(\frac{1}{\beta_{SR_{N}}}+\frac{1}{\beta_{SR_{1}}} \right)} \quad & {for} \quad \mathcal{\omega}_{N} \!<\! \frac{a_{N}}{\tau} \\ 0 \quad &{for} \quad \mathcal{\omega}_{N} > \frac{a_{N}}{\tau} \\ \end{array}} \right.\!. $$
(46)
By substituting (44) and (46) back into (35), with the condition \(\mathcal {\omega }_{i} < \frac {a_{i}}{\tau }\) where i∈[1,N], the outage probability can be obtained in the closed-form expression as
$$\begin{array}{@{}rcl@{}} P_{\text{out}}&=& 1-\prod_{i=1}^{N} \underbrace{{Pr}\big(R_{s_{i}}>2^{2R_{\mathcal{T}_{si}}}-1\big)}_{u_{i}} \\ &=& 1-e^{-\left[\sum\nolimits_{i=1}^{N-1} \frac{\mathcal{\omega}_{i} }{4 d_{i} \rho }\left(\frac{b_{R_{i+1}}}{\beta_{R_{i}D_{i}}}+\frac{b_{R_{i}}}{\beta_{R_{i+1}D_{i}}} \right)\right]} \\ & &e^{-\left[\frac{\mathcal{\omega}_{N} }{4 d_{N} \rho }\left(\frac{b_{R_{1}}}{\beta_{R_{N}D_{N}}}\,+\,\frac{b_{R_{N}}}{\beta_{R_{1}D_{N}}} \right)-\frac{\mathcal{\omega}_{N} }{a_{N} \rho }\left(\frac{1}{\beta_{SR_{N}}}\,+\,\frac{1}{\beta_{SR_{1}}} \right)\right]}. \end{array} $$
(47)

4 Numerical results

In this section, we examine the performance of our proposed CMRS-NOMA scheme in terms of ergodic SR and outage probability. Taking the number of signals N as 3 as an example, we study the ergodic rates of three signals (s1,s2, and s3) and the corresponding sum rate through a Monte Carlo simulation, and we compare the obtained analytical results with the simulated ones. Eight rates of both types match better with the increase in transmit SNR, as shown in Figs. 2 and 3. We also investigate the ergodic SR performance with respect to power allocation factors ai and bi for our proposed scheme with different transmit SNRs ρ, as seen in Figs. 4, 5, 6, 7, 8, and 9. In addition, we investigate the outage performance of our proposed scheme, as demonstrated in Fig. 10, and also compare the simulations with the analysis results in three cases.

4.1 Ergodic SR

Figure 2 presents the average rates of the proposed algorithm with fixed \(\nu _{SR_{i}}, \nu _{{R_{i}}{D_{j}}}\) and corresponding \(\beta _{SR_{i}}, \beta _{{R_{i}}{D_{j}}}\) for the transmission when a1=0.9,a2=0.07,a3=1−a1a2, and \(b_{i}=\frac {1}{3}\) (i∈[1,3]). Clearly, due to the approximation of the analytical formula, at low transmit SNR, the theoretical analysis of the exact average rate is not in perfect agreement with the simulation results. However, in the high SNR region, the asymptotic results match the simulation results well, which is consistent with the practical situation. In Fig. 3, the power allocation factors are modified, i.e., a1=0.88,a2=0.09, and a3=1−a1a2, and the graphic shows the same trend: the simulated results and analytical results are almost identical. Thus, as shown in the figures, the differences of power allocation factors and signal-to-noise ratio have an effect on the average rates. In sum, the ergodic SR of our proposed case has an advantage over the TDMA scheme in which the ergodic SR can be described as (48).
$$\begin{array}{@{}rcl@{}} \begin{array}{lr} {C}_{S_{T}} =\sum\nolimits_{i=1}^{N} {\frac{1}{2N}} \log_{2}\\ {\Big(1+ \frac{1}{2N} \min{\big\{\nu_{SR_{i}} \rho,\nu_{SR_{i+1}} \rho, \nu_{R_{i}D_{i}} \rho+\nu_{R_{i+1}D_{i}} \rho \big\}}\Big)}. \end{array} \end{array} $$
(48)
Figures 4 and 5 depict the ergodic SR performance with respect to power allocation factor a1 for our proposed scheme with different transmit SNRs as ρ={25, 30} dB. For both figures, we have set fixed \(\nu _{SR_{i}}=10\) and \(\nu _{{R_{i}}{D_{j}}}=2\), and we have a predetermined value range for different power allocation factors, i.e., a1∈[0,0.997),a2=0.6∗(1−a1), and a3=0.4∗(1−a1). Particularly, to simplify the analysis, we further assume that \(b_{i}=\frac {1}{3}\)(i∈[1,3]), and then \(d_{i}=b_{R_{i}}*b_{R_{i+1}}*a_{i}=\frac {1}{9}*a_{i}\)(i∈[1,3]) will be taken in the simulation. As shown in the figures, an optimal value of a1 exists that maximizes the ergodic SR. Meanwhile, with the increase in the power ratio a1 of NOMA symbols, the rate of data symbol s1 increases while those of data symbols s2 and s3 decrease. In addition, comparing these figures, the corresponding a1 for the optimal ergodic SR will be close to 1 with an increasing SNR.
Figures 6 and 7 show the ergodic SR performance of our proposed scheme versus the power allocation factors a1 and b1 with fixed νSR1=3,νSR2=5,νSR3=6,νR1D=10,νR2D=18,νR3D=25, and ρ ={25, 35} dB. We have a predetermined value range for power allocation factors ai, i.e., a1∈(0.801,0.999),a2=0.8∗a1, and a3=1−a1a2. The maximum results of the ergodic SR are obtained with a1 approaching to 1. In Fig. 6, the maximum result is 5.194 bps/Hz with a1 as 0.996, whereas these values are 6.114 bps/Hz and 0.996, respectively, for Fig. 7. As shown, the surfaces of ergodic SR in the above figures are relatively flat. This phenomenon can be explained by assuming that the value of bi is uniform. Figures 8 and 9 are the results of non-uniform values of bi, e.g., b1∈(0.701,0.999),b2=0.7∗b1, and b3=1−b1b2. Hence, the surface of ergodic SR presents a process of changes in values. Accordingly, the maximum value in Fig. 8 is 5.586 bps/Hz with b1 as 0.701, which is beyond the range shown in Fig. 6. By using the data cursor in Fig. 9, we can observe that the maximum SR is 6.338 bps/Hz.

4.2 Outage probability

Figure 10 demonstrates the outage performance of our proposed scheme in terms of the simulation and analytical results with three cases, where the power allocation factors are a1=0.88,a2=0.09,a3=1−a1a2, and \(b_{i}=\frac {1}{3}\) (i∈[1,3]). The following system setups are considered: (1) ω=0.6,ρ = {15, 30}dB, νSR1=10,νSR2 = 18,νSR3=25, and νR1D=νR2D=νR3D=3 for case 1; (2) ω=0.6,ρ = {15, 30}dB, νSR1=10,νSR2=18,νSR3=25, and νR1D=νR2D=νR3D=5 for case 2; and (3) ω=0.8,ρ = {15, 30}dB, νSR1=10,νSR2=18,νSR3=25, and νR1D=νR2D=νR3D=5 for case 3. The results reveal that a good match exists between the simulation and analytical results. The outage probabilities of the above three cases change with the transmission SNR (ρ). For example, the values are respectively {0.2997, 0.2118, 0.3110}, where ρ = 20 dB and {0.1065, 0.0724, 0.1111} where ρ =25 dB. It is clear that the performance of the outage probability improves as the channel gains increase and the threshold decreases. The former can be observed by comparing case 1 with case 2, while the latter can be shown by comparing case 2 with case 3. The values of the previous examples reveal this rule well.

5 Conclusions and future work

In this paper, a new transmission model, CMRS-NOMA, in cellular networks has been proposed. In the proposed scheme, SIC is employed to decode the receptions from the source to multiple relay nodes, and the exact and asymptotic expressions for the achievable SR and outage probability of the proposed system over the independent Rayleigh fading channels are presented. In addition, we qualitatively analyze the complexity of the multi-stage power allocation strategy. It is easy to observe that all the signals can be simply and practically decoded. Numerical results have been presented to corroborate the theoretical analyses, and the results have shown that the performance of the ergodic SR for the proposed CMRS-NOMA case gains a significant improvement and outperforms the TDMA. For a high SNR case, the proposed CMRS-NOMA technology can also provide a greater spectral efficiency. Even that the NOMA systems over Rician fading channels and/or Nakagami-m fading channels are more interesting and challenging, our paper considers providing the mentality to study the receiver strategies for cooperative relaying cellular networks. Therefore, investigating different channel models and efficient power allocation methods for the receiving nodes with different QoS requirements are remained as the future works.

Acknowledgements

The author would like to thank the Editor and reviewers for their valuable and insightful comments.The authors would gratefully acknowledge the grants from the National Natural Science Foundation of China (61801249, 61501264 and 61371113), Nantong University-Nantong Joint Research Center for Intelligent Information Technology (KFKT2016B01, KFKT2017B01), Basic Scientic Research of Nantong Science and Technology Project (JCZ18052), Natural Science Research Program of Nantong Vocational University (18ZK01), the open research fund of National Mobile Communications Research Laboratory, Southeast University (No.2015D02).

Availability of data and materials

The authors declare that all the data and materials in this manuscript are available.

Competing interests

The authors declare that they have no competing interests.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://​creativecommons.​org/​licenses/​by/​4.​0/​), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Literatur
1.
Zurück zum Zitat Z. Ding, M. Peng, H. V. Poor, Cooperative non-orthogonal multiple access in 5G systems. IEEE Commun. Lett.19:, 1462–1465 (2015).CrossRef Z. Ding, M. Peng, H. V. Poor, Cooperative non-orthogonal multiple access in 5G systems. IEEE Commun. Lett.19:, 1462–1465 (2015).CrossRef
2.
Zurück zum Zitat J. B. Kim, I. H. Lee, Capacity analysis of cooperative relaying systems using non-orthogonal multiple access. IEEE Commun. Lett.19:, 1949–1952 (2015).CrossRef J. B. Kim, I. H. Lee, Capacity analysis of cooperative relaying systems using non-orthogonal multiple access. IEEE Commun. Lett.19:, 1949–1952 (2015).CrossRef
3.
Zurück zum Zitat M. Wen, E. Basar, Q. Li, B. Zheng, M. Zhang, Multiple-mode orthogonal frequency division multiplexing with index modulation. IEEE Trans. Commun.65:, 3892–3906 (2017).CrossRef M. Wen, E. Basar, Q. Li, B. Zheng, M. Zhang, Multiple-mode orthogonal frequency division multiplexing with index modulation. IEEE Trans. Commun.65:, 3892–3906 (2017).CrossRef
4.
Zurück zum Zitat M. Wen, B. Ye, E. Basar, Q. Li, F. Ji, Enhanced orthogonal frequency division multiplexing with index modulation. IEEE Trans. Wirel. Commun.16:, 4786–4801 (2017).CrossRef M. Wen, B. Ye, E. Basar, Q. Li, F. Ji, Enhanced orthogonal frequency division multiplexing with index modulation. IEEE Trans. Wirel. Commun.16:, 4786–4801 (2017).CrossRef
5.
Zurück zum Zitat M. Wen, X. Cheng, M. Ma, B. Jiao, H. V. Poor, On the achievable rate of OFDM with index modulation. IEEE Trans. Signal Process.64:, 1919–1932 (2016).MathSciNetCrossRef M. Wen, X. Cheng, M. Ma, B. Jiao, H. V. Poor, On the achievable rate of OFDM with index modulation. IEEE Trans. Signal Process.64:, 1919–1932 (2016).MathSciNetCrossRef
6.
Zurück zum Zitat J. Li, M. Wen, X. Cheng, Y. Yan, S. Song, M. H. Lee, Generalized precoding-aided quadrature spatial modulation. IEEE Trans. Veh. Technol.66:, 1881–1886 (2017).CrossRef J. Li, M. Wen, X. Cheng, Y. Yan, S. Song, M. H. Lee, Generalized precoding-aided quadrature spatial modulation. IEEE Trans. Veh. Technol.66:, 1881–1886 (2017).CrossRef
7.
Zurück zum Zitat F. Cheng, H. Yan, J. Song, V. Leung, Energy-efficient resource allocation for downlink non-orthogonal multiple access network. IEEE Trans. Commun.64:, 3722–3732 (2016).CrossRef F. Cheng, H. Yan, J. Song, V. Leung, Energy-efficient resource allocation for downlink non-orthogonal multiple access network. IEEE Trans. Commun.64:, 3722–3732 (2016).CrossRef
8.
Zurück zum Zitat Y. Sun, D. Ng, Z. Ding, R. Schober, Optimal joint power and subcarrier allocation for full-duplex multicarrier non-orthogonal multiple access systems. IEEE Trans. Commun.65:, 1077–1091 (2017).CrossRef Y. Sun, D. Ng, Z. Ding, R. Schober, Optimal joint power and subcarrier allocation for full-duplex multicarrier non-orthogonal multiple access systems. IEEE Trans. Commun.65:, 1077–1091 (2017).CrossRef
9.
Zurück zum Zitat Y. Saito, A. Benjebbour, Y. Kishiyama, T. Nakamura, Generalized precoding-aided quadrature spatial modulation. Proc. IEEE Annu. Symp. PIMRC. 66:, 611–615 (2013). Y. Saito, A. Benjebbour, Y. Kishiyama, T. Nakamura, Generalized precoding-aided quadrature spatial modulation. Proc. IEEE Annu. Symp. PIMRC. 66:, 611–615 (2013).
10.
Zurück zum Zitat M. Xu, M. Wen, F. Ji, W. Duan, Novel receiver design for the cooperative relaying system with non-orthogonal multiple access. IEEE Commun. Lett.66:, 1679–1682 (2016).CrossRef M. Xu, M. Wen, F. Ji, W. Duan, Novel receiver design for the cooperative relaying system with non-orthogonal multiple access. IEEE Commun. Lett.66:, 1679–1682 (2016).CrossRef
11.
Zurück zum Zitat Y. Liu, Z. Ding, M. Elkashlan, H. V. Poor, Cooperative non-orthogonal multiple access with simultaneous wireless information and power transfer. IEEE J. Sel. Areas Commun.34:, 938–953 (2016).CrossRef Y. Liu, Z. Ding, M. Elkashlan, H. V. Poor, Cooperative non-orthogonal multiple access with simultaneous wireless information and power transfer. IEEE J. Sel. Areas Commun.34:, 938–953 (2016).CrossRef
12.
Zurück zum Zitat Z. Yang, Z. Ding, P. Fan, N. Al-Dhahir, A general power allocation scheme to guarantee quality of service in downlink and uplink noma systems. IEEE Trans. Wirel. Commun.15:, 7244–7257 (2016).CrossRef Z. Yang, Z. Ding, P. Fan, N. Al-Dhahir, A general power allocation scheme to guarantee quality of service in downlink and uplink noma systems. IEEE Trans. Wirel. Commun.15:, 7244–7257 (2016).CrossRef
13.
Zurück zum Zitat R. Jiao, L. Dai, J. Zhang, R. MacKenzie, M. Hao, On the performance of NOMA-based cooperative relaying systems over Rician fading channels. IEEE Trans. Veh. Technol.66:, 11409–11413 (2017).CrossRef R. Jiao, L. Dai, J. Zhang, R. MacKenzie, M. Hao, On the performance of NOMA-based cooperative relaying systems over Rician fading channels. IEEE Trans. Veh. Technol.66:, 11409–11413 (2017).CrossRef
14.
Zurück zum Zitat X. Yue, Y. Liu, S. Kang, A. Nallanathan, Performance analysis of NOMA with fixed gain relaying over Nakagami-m fading channels. IEEE Access. 5:, 5445–5454 (2017).CrossRef X. Yue, Y. Liu, S. Kang, A. Nallanathan, Performance analysis of NOMA with fixed gain relaying over Nakagami-m fading channels. IEEE Access. 5:, 5445–5454 (2017).CrossRef
15.
Zurück zum Zitat H. Xie, F. Gao, S. Jin, J. Fang, Y. C. Liang, Channel estimation for TDD/FDD massive MIMO systems with channel covariance computing. IEEE Trans. Wirel. Commun.17:, 4206–4218 (2018).CrossRef H. Xie, F. Gao, S. Jin, J. Fang, Y. C. Liang, Channel estimation for TDD/FDD massive MIMO systems with channel covariance computing. IEEE Trans. Wirel. Commun.17:, 4206–4218 (2018).CrossRef
16.
Zurück zum Zitat H. Xie, F. Gao, S. Zhang, S. Jin, A unified transmission strategy for TDD/FDD massive MIMO systems with spatial basis expansion model. IEEE Trans. Veh. Technol.66:, 3170–3184 (2017).CrossRef H. Xie, F. Gao, S. Zhang, S. Jin, A unified transmission strategy for TDD/FDD massive MIMO systems with spatial basis expansion model. IEEE Trans. Veh. Technol.66:, 3170–3184 (2017).CrossRef
17.
Zurück zum Zitat B. Zheng, M. Wen, E. Basar, F. Chen, Multiple-input multiple-output OFDM with index modulation: low-complexity detector design. IEEE Trans. Signal Process.65:, 2758–2772 (2017).MathSciNetCrossRef B. Zheng, M. Wen, E. Basar, F. Chen, Multiple-input multiple-output OFDM with index modulation: low-complexity detector design. IEEE Trans. Signal Process.65:, 2758–2772 (2017).MathSciNetCrossRef
18.
Zurück zum Zitat J. Zhang, L. Dai, S. Sun, Z. Wang, On the spectral efficiency of massive MIMO systems with low-resolution ADCs. IEEE Commun. Lett.20:, 842–845 (2016).CrossRef J. Zhang, L. Dai, S. Sun, Z. Wang, On the spectral efficiency of massive MIMO systems with low-resolution ADCs. IEEE Commun. Lett.20:, 842–845 (2016).CrossRef
19.
Zurück zum Zitat J. Choi, Minimum power multicast beamforming with superposition coding for multiresolution broadcast and application to NOMA systems. IEEE Trans. Commun.63:, 791–800 (2015).CrossRef J. Choi, Minimum power multicast beamforming with superposition coding for multiresolution broadcast and application to NOMA systems. IEEE Trans. Commun.63:, 791–800 (2015).CrossRef
20.
Zurück zum Zitat M. F. Hanif, Z. Ding, T. Ratnarajah, G. K. Karagiannidis, A minorization-maximization method for optimizing sum rate in the downlink of non-orthogonal multiple access systems. IEEE Trans. Signal Process.64:, 76–88 (2016).MathSciNetCrossRef M. F. Hanif, Z. Ding, T. Ratnarajah, G. K. Karagiannidis, A minorization-maximization method for optimizing sum rate in the downlink of non-orthogonal multiple access systems. IEEE Trans. Signal Process.64:, 76–88 (2016).MathSciNetCrossRef
21.
Zurück zum Zitat Q. Sun, S. Han, C. L. I, Z. Pan, On the ergodic capacity of MIMO NOMA systems. IEEE Wirel. Commun. Lett.4:, 405–408 (2015).CrossRef Q. Sun, S. Han, C. L. I, Z. Pan, On the ergodic capacity of MIMO NOMA systems. IEEE Wirel. Commun. Lett.4:, 405–408 (2015).CrossRef
22.
Zurück zum Zitat J. Choi, On the power allocation for MIMO-NOMA systems with layered transmissions. IEEE Trans. Wirel. Commun.15:, 3226–3237 (2016).CrossRef J. Choi, On the power allocation for MIMO-NOMA systems with layered transmissions. IEEE Trans. Wirel. Commun.15:, 3226–3237 (2016).CrossRef
23.
Zurück zum Zitat Z. Ding, L. Dai, H. V. Poor, Mimo-noma design for small packet transmission in the internet of things. IEEE Access. 4:, 1393–1405 (2016).CrossRef Z. Ding, L. Dai, H. V. Poor, Mimo-noma design for small packet transmission in the internet of things. IEEE Access. 4:, 1393–1405 (2016).CrossRef
24.
Zurück zum Zitat W. Feng, Y. Wang, D. Lin, N. Ge, J. Lu, S. Li, When mmWave communications meet network densification: a scalable interference coordination perspective. IEEE J. Sel. Areas Commun.35:, 1459–1471 (2017).CrossRef W. Feng, Y. Wang, D. Lin, N. Ge, J. Lu, S. Li, When mmWave communications meet network densification: a scalable interference coordination perspective. IEEE J. Sel. Areas Commun.35:, 1459–1471 (2017).CrossRef
25.
Zurück zum Zitat B. Wang, F. Gao, S. Jin, H. Lin, G. Y. Li, Spatial- and frequency-wideband effects in millimeter-wave massive MIMO systems. IEEE Trans. Signal Process.66:, 3393–3406 (2018).MathSciNetCrossRef B. Wang, F. Gao, S. Jin, H. Lin, G. Y. Li, Spatial- and frequency-wideband effects in millimeter-wave massive MIMO systems. IEEE Trans. Signal Process.66:, 3393–3406 (2018).MathSciNetCrossRef
26.
Zurück zum Zitat Z. Ding, P. Fan, H. V. Poor, Random beamforming in millimeter-wave noma networks. IEEE Access. 5:, 7667–7681 (2017).CrossRef Z. Ding, P. Fan, H. V. Poor, Random beamforming in millimeter-wave noma networks. IEEE Access. 5:, 7667–7681 (2017).CrossRef
27.
Zurück zum Zitat R. Zhang, Z. Zhong, J. Zhao, B. Li, K. Wang, Channel measurement and packet-level modeling for V2I spatial multiplexing uplinks using massive MIMO. IEEE Trans. Veh. Technol.65:, 7831–7843 (2016).CrossRef R. Zhang, Z. Zhong, J. Zhao, B. Li, K. Wang, Channel measurement and packet-level modeling for V2I spatial multiplexing uplinks using massive MIMO. IEEE Trans. Veh. Technol.65:, 7831–7843 (2016).CrossRef
28.
Zurück zum Zitat P. Harris, Performance characterization of a real-time massive MIMO system with LOS mobile channels. IEEE J. Sel. Areas Commun.35:, 1244–1253 (2017).CrossRef P. Harris, Performance characterization of a real-time massive MIMO system with LOS mobile channels. IEEE J. Sel. Areas Commun.35:, 1244–1253 (2017).CrossRef
29.
Zurück zum Zitat Y. Chen, L. Wang, Y. Ai, B. Jiao, L. Hanzo, Performance analysis of NOMA-SM in vehicle-to-vehicle massive MIMO channels. IEEE J. Sel. Areas Commun.35:, 2653–2666 (2017).CrossRef Y. Chen, L. Wang, Y. Ai, B. Jiao, L. Hanzo, Performance analysis of NOMA-SM in vehicle-to-vehicle massive MIMO channels. IEEE J. Sel. Areas Commun.35:, 2653–2666 (2017).CrossRef
30.
Zurück zum Zitat I. S. Gradshteyn, I. M. Ryzhik, Table of Integrals, Series, and Products. 7th ed (Academic, San Diego, 2007).MATH I. S. Gradshteyn, I. M. Ryzhik, Table of Integrals, Series, and Products. 7th ed (Academic, San Diego, 2007).MATH
31.
Zurück zum Zitat M. Abramowitz, I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. 9th. ed (Dover Publications, New York, 1970).MATH M. Abramowitz, I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. 9th. ed (Dover Publications, New York, 1970).MATH
32.
Zurück zum Zitat A. Milton, I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. 10th ed (US GPO, New York, 1972).MATH A. Milton, I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. 10th ed (US GPO, New York, 1972).MATH
Metadaten
Titel
On the performance of receiver strategies for cooperative relaying cellular networks with NOMA
verfasst von
Jinjuan Ju
Guoan Zhang
Qiang Sun
Li Jin
Wei Duan
Publikationsdatum
01.12.2019
Verlag
Springer International Publishing
DOI
https://doi.org/10.1186/s13638-019-1377-5

Weitere Artikel der Ausgabe 1/2019

EURASIP Journal on Wireless Communications and Networking 1/2019 Zur Ausgabe