Capacity of Cooperative Spatial Modulation (CSM) System with Optimum Relay Selection

In this work, the capacity of the cooperative spatial modulation (CSM) system is analysed. Relay-aided transmission is considered to improve the coverage and the reliability using decode and forward scheme. Due to the nonclosed form of the spatial modulation capacity function, its upper and lower bounds are derived. The lower bound of the capacity is exploited to formulate the optimal relay selection problem to maximize the channel utilization, where the optimal relay selection algorithm (ORSA) and modified maximum harmonic mean (MMHM) are proposed to select single or multiple relays. A comparison study in terms of the performance and the computational complexity is presented for the evaluation purpose. Simulation results demonstrate that the proposed algorithm significantly improves the capacity of CSM compared to other most popular relay selection strategies.


Introduction
The emergence of multiple-input multiple-output (MIMO), massive MIMO, and spatial modulation in the last decade demonstrates the importance of spatial diversity for improving system performance. However, some practical issues are related to system complexity and cost. Special attention to interchannel interference and interantenna synchronization is required due to the need for implementation of multiple radio frequency (RF) chains (one for each antenna) [1]. Spatial modulation (SM) has been proposed for MIMO communication with a single RF chain at the transmitter in which the transmitting antenna index is used as a source of information. According to the transmitted sequence, a symbol of the constellation is selected and transmitted via a selected antenna out of a set. Using a multiple-antenna system will provide diversity, multiplexing, and array gain [2,3]. The multiple antenna diversity is a type of spatial diversity, which, in contrast to time diversity, has the advantage of achieving gain without reducing the effective data transmission rate [4]. In addition, the multiplexing gain that is achieved by spatial modulation increases spectral efficiency by where the number of the transmitting antennas increased, in compari-son with the typical method of transmission with one antenna. In this method, in addition to estimating the transmitted symbols, the receiver also estimates the transmitted antenna index, which contains a portion of the transmitted information. Furthermore, the benefit of this method in comparison with other methods, such as vertical Bell Lab layered space-time (V-BLAST) and space-time coding (STC), is the higher spectral efficiency [5].
In [6], based on the proposed transmission method, namely, the information-guided channel hopping (IGCH) scheme, the capacity of multiple transmitter antennas is studied. In this scheme, the independent character of multichannel can be used as an additional information transmitting channel. The analysis results prove that the capacity behavior of this scheme is better than that of the space-time block coding for more than two transmit antennas.
In [7], to maximize the instantaneous capacity of SM for the spatial domain, an iterative algorithm is proposed, in which the optimal probability of activating each transmit antenna is obtained. There is a trade-off between design freedom and the diversity gain achieved; therefore, obtaining optimal spatial domain design is necessary. However, the computational complexity of the iterative method is very high. In [8], the authors derived lower and upper bounds of generalized spatial modulation's (GSM's) capacity, in which multiple antennas are used at both transmitter and receiver with more than one RF chain. The authors in [9] derived a closed form expression for SM capacity with only two transmit and single receiver antennas based on the hypergeometric series. An increasing number of the antenna in the transmitter dramatically increase the complexity of mathematical calculation.
In 5G mobile communication systems, millimeter-wave wireless communication is a key enabling technology where the coverage with a very high data rate is limited. A cooperative framework in the new generation of wireless communication via relaying the transmit signal is a promising approach to extend the coverage range, combat the channel fading, and leverage the channel utilization. The research community has explored the relay selection problem to achieve the goals. In [10], random relay selection (RRS) is considered with no computational overhead; however, this relay selection scheme cannot provide optimal performance. Maximum harmonic mean relay selection (MHM-RS) is a method in which the relay that corresponds to the highest harmonic mean of the source-relay link (SRL) and relaydestination link (RDL) conditions is selected [11]. Several metrics are presented in [12]. These criteria are based on the quality of the communication links, and the transmission powers of the relay and source are ignored. Partial relay selection in the orthogonal frequency division multiplexing with index modulation (OFDM-IM) system is proposed in [13] to evaluate average symbol error probability. The relay is selected based on the largest channel gain in the first hop only. However, the criteria considering both transmission phase provide better performance. In our previous published work [14], we presented efficient partner selection metrics and conclude that employing multiple relays in the cooperative process improves the error performance and the capacity even with interference impacts.
Cooperative spatial modulation (CSM) exploits the advantages of SM and cooperative communication. In the CSM network, there are multiple links between the source and each relay; thus, the criteria for relay selection must be modified based on the CSM specification. CSM based on multiple DF relays was studied in [15]. The upper bound of the pairwise error probability (PEP) is analysed to investigate the performance of the system; however, no optimum relay is selected, and all the existing relays are used in the cooperative process to improve the performance of the system at the expense of high power consumption and additional overheads. In [16], there is CSM with AF relay scheme in which the relay is selected based on link quality in the second transmission phase. The source applies space shift keying (SSK) as a special form of SM where only the active antenna index conveys the information. Thus, the throughput of cooperative SSK is limited. In [17], the system performance in terms of symbol error probability under various conditions, such as half-duplex (HD), full-duplex (FD), existence, and absence of a direct link between the source and the destination, is studied. The residual interference between relay transmit and receive antennas is considered. Only a capacity equation that is based on the signal space is obtained, and no further analysis is conducted. The authors in [18] proposed a new CSM system where all the nodes are equipped with multiple transmit and/or receive antennas. The system recorded better error performance than classical cooperative systems; however, installing multiple antennas on all the nodes might not be possible. For the CSM network in [19], a relay is selected based on the quality of the output signal from the maximum likelihood (ML) detector in the receiver. However, a predefined relay selection scheme is more realistic in terms of the network design, regardless of the output of the detector. A quadrature CSM network with DF relaying scheme is proposed in [20]. To improve spectral efficiency, a source jointly selects the active antenna, a single relay, and a constellation symbol based on the information bits. Ignoring the quality of the links in the relay selection cannot help the system to improve its performance. In addition, the computational complexity of the joint selection of the mentioned factors is quite high and causes a significant delay in the transmission process.
According to the earlier description and the gains that can be harvested, CSM networks based on the DF relaying scheme are considered in this paper in which only the source has multiple antennas. It is assumed that the direct link between the source and the destination does not exist, and a single relay at least is necessary for the communication process. The work is aimed at maximizing the channel utilization through a relay selection policy.
The main contribution of this paper includes the following aspects. First is the theoretical analysis of the SM capacity and derivation of a lower and an upper bound of the capacity to be used in the study and avoidance of the complexity of dealing with the nonclosed form of SM capacity. Next, to exploit the cooperating relays wisely and achieve a satisfying gain, new relay selection criteria based on the channel quality are proposed in addition to a modified maximum harmonic mean (MMHM) to be used in the CSM network as a lowcomplexity suboptimal relay selection scheme. As another contribution of the work, an optimal relay selection algorithm (ORSA) is presented with slightly higher computational complexity than MMHM. Numerical simulations have been presented to evaluate the performance of the CSM system using these selection policies and compare it with that using an exhaustive search algorithm to define a cooperative relay.
The remainder of this paper is organized into four sections. Section 2 presents the system model and the capacity calculation of SM. Relay selection problems in CSM are presented in Section 3. Then, the numerical results are discussed in Section 4. Finally, the conclusions of the work are presented in Section 5.

System Model
A cooperative spatial modulation CSM network based on the DF relay scheme is considered, as illustrated in Figure 1. The source has N antennas and transmits the information signal using a spatial modulation (SM) scheme in the first phase. We assume that a direct link between the source and the 2 Wireless Communications and Mobile Computing destination does not exist. Several surrounding relays, each with a single antenna, will receive the signal. The relay who decodes the original signal correctly is the candidate to forward the signal to the destination in the DF scheme.
The CSM system is a dual-hop cooperative system. In the first hop, the SM system is used, while the conventional modulation system is used in the next hop. The capacity of CSM with the jth selected relay (C j csm ) based on the DF scheme is obtained as [21] where C j sr and C j rd are the capacity of the source-to-jth relay and the capacity of the jth relay-to-destination, respectively. To facilitate the upcoming discussions, the main notations that are used in the paper are listed in Table 1. The capacity of each transmission phase is evaluated separately.

SM Capacity of the Source-Relay Links.
In the first transmission phase, SM transmits log 2 ðMNÞ bits, of which log 2 ðMÞ bits are used to select a constellation symbol and log 2 ðNÞ bits are used to set the index of the active antenna to transmit the symbol. If the ith transmission antenna is defined to transmit the qth symbol, the received signal at the jth relay (y rj ) is represented as where x is an N-dimensional symbol vector and symbol x q is the qth element of x, which represents the qth element of the M-ary constellation state: h ij sr is the fading channel coefficients of the link between the ith transmission antenna and the jth relay. P s is the source transmission power, and n rj is an additive white complex Gaussian noise with zero mean and variance of σ 2 n . At the source SM scheme, transmission is simultaneously conducted for two data streams: one data stream is mapped to the index of the selected transmit antenna ðx ant Þ, and the other data stream is conventionally encoded and transmitted by the selected antenna ðxÞ. There will be two independent input signal spaces for the symbol and antenna symbol, which are denoted as X and X ant , in addition to the output signal in the jth relay space Y j . The mutual information between the input and output of the signal space is [22] Consider a random antenna selection probability of 1/N. The capacity of the signal space C 1,j is calculated as pðxÞ is the probability density function of the random transmitted symbol vector x.
The capacity of the antenna space C 2,j is calculated as  Figure 1: Cooperative network with spatial modulation at the source.
in which σ 2 ij = jh ij sr j 2 P s + σ 2 n is the variance of the received signal through the ith antenna. i ð↑Þ denotes that the ith antenna is active and equivalent to the transmitting symbol x ant . The first term of the right-hand side of (6) can be expressed as The second term of the right-hand side of (6) can be expressed as From (8) and (9), the capacity C 2,j can be obtained as in which Now, from (4), (5), and (10), the capacity of the spatial modulation is given by The analytical solution to obtain the capacity of SM C j sr is difficult because of its nonclosed form. Since the statistical analysis is not sufficient for understanding the properties of SM, to facilitate understanding and for practical applications, such as resource allocation, we will define upper and lower bounds of C j sr .
2.1.1. Lower Bound of the SM Capacity. The term ð1/σ 2 ij Þ e −ðr/σ 2 ij Þ in (9) is an exponential distribution, and the second term in the right-hand side of (12) can be expressed as the expectation of random variablesΛðσ j Þ, in which σ j = where E ij f·g denotes the ith antenna and jth relay expectation that corresponds to the statistical distribution with pdf of f ij ðrÞ ≜ ð1/σ 2 ij Þe −ðr/σ 2 ij Þ . On the other hand, according to Jensen's inequality, the convex function in (13) can be expressed as A lower bound for Λðσ j Þ can be defined as For computing Lðσ j Þ, we obtain where β j ik = 1/ðσ 2 ij + σ 2 kj Þ. Then, Lðσ j Þ is calculated as follows: Using by part integral to solve, we obtain The upper bound of (22) is attained when e −ðr/σ 2 ij Þ is equal to 1: Therefore, according to (12), an upper bound of C j sr , which is denoted by C ðUBÞ sm , can be expressed as The lower bound and upper bound of the capacity as obtained in (19) and (24) are much easier to calculate because of their closed form. In the next section, we will show that the lower bound capacity is very close to its original capacity and can be used as a very good approximation in further analysis.

The
Capacity of Relay-Destination Links. In this paper, according to the system model, the transmissions between the relays and the destination are based on a conventional communication system. For this model system, the jth relay-destination capacity is obtained as in which ζ r,j = jh j rd j 2 P r,j /σ 2 n , where P r,j is the transmission power of the jth relay.

Relay Selection Scheme
Optimal relay selection, as it is expected, would improve the performance of relay networks at the expense of some computational complexity. The relay selection problem for the CSM system can be formulated as the following max-min optimization problem (P1): Since min fC j sr , C j rd g ≤ C j sr or ≤C j rd , two upper bounds of P1 are Under the assumption of equal power allocation (EPA) among the source and the relay, transmit power is given by P s = P r,j = ðp tot /2Þ∀j, and p tot represents the total power consumption in both transmission phases.
Firstly, P1ð1Þ is used to derive the relay selection criterion. In the first transmission phase, because of inexistence of a closed form of the exact capacity of SM, C ðLBÞ sm and C ðUBÞ sm are considered instead of C j sr . Thus, using (26), The first term of the right-hand side of (28) is a constant value, so the entire equation can be maximized if the second term of the right-hand side of (28) has a minimum value:

Wireless Communications and Mobile Computing
For the same reason, The term min Þg is repeated for the upper and lower bounds and could be used as a relay selection criterion (RSC): Additionally, according to [14], criterion RSC2 = argmin j f1/jh j rd jg is chosen for relay selection, and this could be used as the solution of P1ð2Þ. Relay selection that is based on RSC1 or RSC2 might not yield the optimal solution. Here, we propose a new method that is based on the properties of max-min optimization for solving P1. The following lemma is instrumental for obtaining the optimum solution based on the link quality in both transmission phases.

Lemma 1.
If j * = argmax j fC j sr g and C j * sr = min fC j * sr , C where j * is the index of selected relay, then j * = argmax j fmin fC j sr , C j rd gg.
Proof. From min fC j sr , C j rd g ≤ C j sr , it follows that First, we define j * = argmax j fC j sr g. From (33), we deduce that the equality holds if C j * sr = min fC j * sr , C j * rd g. On the other hand, when the inequality is fulfilled with equality in (33), the optimal solution is obtained, namely, max In the proposed method, namely, the optimum relay selection algorithm (ORSA), first, we sort the relays according to RSC1. Then, a relay with the highest priority is selected. If the chosen relay satisfies the conditions of Lemma 1, it is the optimal relay; otherwise, another relay with the next top priority is selected. In the case of the multiple relay selection scheme, this process will continue until the required number of relays have been selected. Computing C ðLBÞ sm for the large numbers of relays, (K ≫ 1), is much faster; therefore, we can consider C ðLBÞ sm instead of C j csm in practical applications. Using an exhaustive search to acquire optimum selection has exponential complexity of OðKÞO ðFunðC 1,j Þ + FunðC 2,j ÞÞ, in which OðFunð·ÞÞ is the computational complexity of any function. However, we propose a heuristic selection algorithm with rational complexity. In the next section, we will see that this method has much less computational complexity compared to the exhaustive search algorithm.
In comparison with exhaustive search, the proposed selection algorithm has some features, which can be noticeable and practical due to its complexity, which is OðFun ðRSC1Þ + FunðRSC2ÞÞ in the best situation and OðKÞOðFun ðRSC1Þ + FunðRSC2ÞÞ in the worst one.
The two aforementioned criteria, namely, RSC1 and RSC2, consider the link quality in only one of the transmission phases. The maximum harmonic mean (MHM) relay selection criterion is an important criterion in relay selection, as it considers the channel qualities of both transmission phases. Using SM in the first transmission phase enforces a change in the relay selection criterion as it is named modified maximum harmonic mean (MMHM) and given by where jh SR j 2 is interpreted as the mean effective channel gain of SRL and is expressed as follows: In addition to the previously defined criteria, we present MMHM in CSM as a new selection criterion for benchmarking ORSA.

Simulation Results
This section presents a simulation study and evaluation of the CSM system model (Figure 1) in terms of channel capacity. The study also evaluates the earlier presented relay selection criteria.
First, the original and the lower and upper bounds of the SM system as derived in Section 2 are calculated under the assumption of 8 antennas at the source. Figure 2 shows that the lower bound of the SM capacity is very close to its original function. Therefore, due to the nonclosed form and the computational complexity of the original function for the SM 6 Wireless Communications and Mobile Computing capacity, we can use the lower bound as a closed form approximation for the capacity analysis in this study. Next, a numerical simulation based on the proposed relay selections RSC1, RSC2, MMHM, and ORSA is conducted. Also, the random relay selection (RRS) scheme is used to benchmark the results. Based on the locations of the source, relays, and destination, we will evaluate the criteria for the relay selection in two case studies, as illustrated in Figure 3.
In the simulation study, we assumed that the number of transmitted antennas is N = 8, and BPSK modulation is applied, i.e., M = 2. A single relay would be selected among the available eight terminals. Equal power allocation is considered where p s = p r = p tot /2.
In the first case study, the relay is closer to the destination than the source, i.e., d SR > d RD (Figure3). The results in Figure 4 show that RSC1 outperforms both RSC2 and RRS since it considers the quality of the first transmission link as a selection criterion, and according to (1), this link has a stronger effect on the system capacity. Figure 5 shows that for a similar reason, in the second case study where the relay    Figures 4 and 5, the ORSA algorithm behaves better than the other methods. Similarly to MMHM, it considers both transmission links to define an optimal solution of the P1 problem and identify the optimum relay to forward the information signal. At the expense of computational overhead, all the suggested selection policies record higher performance than no selection policy where a relay is selected randomly regardless of its channel coefficients or its position.
To reflect the computational overhead that each selection policy would enforce, the average time for the computational operations in the proposed methods for single relay selection versus the number of the available relays is presented in Figure 6. The proposed optimal solution for P1 that is based on ORSA is far less complicated compared to the exhaustive search, which has linear computational complexity with respect to the number of relays. Therefore, ORSA is a highly effective algorithm for realizing optimal performance in CSM with relay selections. Moreover, MMHM, RSC1, and RSC2 record lower complexity than ORSA since it consumes less time to select a relay at the expense of lower performance.

Conclusions
A relay-aided CSM network is studied to increase the coverage area and leverage the channel capacity. Theoretical analysis of the channel utilization in the CSM network is presented, and the lower and upper bounds of the capacity is derived. The lower bound capacity function is exploited in the optimal relay selection problem because of its 9 Wireless Communications and Mobile Computing simplicity and its much-approximated values to the original SM capacity. Different relay selection methods and criteria with different computational complexity are applied in the system to increase the transmission capacity. The methods and the criteria are evaluated in terms of the channel capacity and computational time. All the suggested criteria behave better than no selection policy at the expense of a cost.
It has been found that ORSA has lower computational complexity than the exhaustive search and higher performance than the other suggested selection policies. MMHM is presented as another important selection criterion to be used in CSM, which is originally based on MHM that is widely applied in conventional cooperative networks. The criterion also yields a suboptimal solution in terms of network performance and an equivalent complexity to that for RSC1 and RSC2.

Data Availability
The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest
The authors declare that they have no conflicts of interest.