 Research
 Open access
 Published:
An adaptive transmission protocol for exploiting diversity and multiplexing gains in wireless relaying networks
EURASIP Journal on Wireless Communications and Networking volume 2015, Article number: 37 (2015)
Abstract
Wireless relaying networks with distributed spacetime block codes have been shown to provide high link reliability. This is because of the space diversity gain from multiple transmitting relays, which improves by adding more relays. The drawback of this approach is the overall reduction in throughput of the network. In this paper, we propose a method to construct a distributed spacetime block code that is combined with spatial modulation to find a flexible tradeoff between reliability and throughput. This proposed method is not restricted to a specific number of relays and can be constructed as necessary. The constructed code also uses a novel adaptive transmission protocol to achieve higher space diversity, even with relays equipped with a single antenna. This protocol assumes use of coherent detection, meaning that a perfect channel estimation is available at the destination. Lastly, a new decoder is proposed that offers significant reduction in complexity to maintain high data throughput. All claims in this work are supported with theoretical analysis and backed up with empirical results.
1 Introduction
In recent years, the spatial diversity of wireless relaying networks (WRNs) has been used to improve signal quality in wireless transmission [15]. A WRN constructs a virtual multipleinput multipleoutput (MIMO) system using multiple neighbouring client apparatuses as relaying nodes. It has been suggested that distributed spacetime block codes (DSTBC) be used in WRNs to allow simultaneous transmission among relaying nodes to increase the spectral efficiency of the network [69]. It is known that the diversity is further improved when the number of relays in the WRN is increased. Unfortunately, this has the drawback of reducing the overall throughput of the network as the number of relays increase [10]. The throughput can be retained by increasing the code rate of the DSTBC at the cost of decoding complexity [11]. It has been shown that an orthogonal design of fullrate codes is possible only with two relays [12]. The orthogonal designs lead to a low decoding complexity at the destination[11].
To summarise, the major challenge in WRNs is to coordinate an arbitrary number of relay transmissions with high rate while maintaining both full diversity and low decoding complexity.
1.1 Prior work
The overall interest in this field of research lies in the construction of a highrate DSTBC that has the ability to utilise any arbitrary number of relays [13,14]. It would appear that research has had limited success in designing highrate codes while maintaining a singlesymbol decodability at the destination. In [15], the authors proposed systematic construction steps of a rowmonomial DSTBC with a code rate bounded by 2/(2+N), where N denotes the number of relays. In [16], a new code class called semiorthogonal precoded distributed singlesymbol decodable STBC (SemiPDSSDSTBCs) was proposed. It has the advantage of performing precoding on the information symbols, which in turn doubles the achieved code rate. Although these codes were designed for an arbitrary number of relays, they may be preferable to be used only in WRNs with a few number of relays. This is because the code rate decreases dramatically as the number of relays increases. In [17], a coding scheme, with a code rate of \(\frac {1}{4}\), was proposed to operate in WRNs of high number of relays. However, this scheme has a high decoding delay. This is as the required transmission time increases exponentially with the number of relays. In [18], an adjustable fullrate STBC matrix was designed, but it requires a feedback channel to adjust the code. This creates additional network overhead that inherently reduces the achieved diversity gain. In [1921], the generalised ABBA code (GABBA) of [22] was adapted for amplifyandforward (AF) WRNs to offer a fullrate while maintaining singlesymbol decodability. However, the resulting DGABBA scheme has some constraints: (1) the number of symbols per block (T) should be expressible as a power of two, and (2) the number of available relays (N) should be smaller or equal to T (N≤T). These constraints were resolved by utilising global knowledge of channel state information (CSI) of the entire WRN at the relays [10].
Spatial modulation (SM) was developed to improve the throughput of MIMO systems and was initially extended for WRNs in [2325]. The intention was to add the spatial dimension to the modulated signal constellation; this allowed information to be transmitted not only using amplitude/phase modulation (APM) but also using the relay index. This offers higher throughput due to data multiplexing via different relays [24,26]. However, the overall achieved diversity gain was limited to the number of receive antennas, as only one relay was active for any given transmission. This was partially solved when employing SM specifically at the source node and leaving the full diversity gain to be achieved in the link between the relays and the destination [25,27,28]. The effective use of SM was still bounded by the number of antennas available at the source node. Due to size, cost and hardware limitations, the availability of multiple antenna may not be feasible in many systems [29]. In [30,31], transmit diversity gain can be achieved at the expense of orthogonal channel resources.
In conclusion, the current WRN uses its relays either to offer high throughput only (using SM) or to achieve transmit diversity gain (using DSTBC).
1.2 Our contribution
As mentioned, a major challenge in a WRN is to coordinate an arbitrary number of relay transmissions while maintaining full diversity gain and offering high rates with low decoding complexity at the destination. Using a combination of STBC and SM, it is expected that high throughput and high transmit diversity gain is possible. In general, such combinations are achieved using MIMO systems. This allows the construction of a fixed STBCSM code as the number of antennas at the transmitter is fixed [3236]. These designs are also bounded by a transmit diversity gain of 2. To the best of the authors’ knowledge, there is no existing research addressing distributed STBCSM (DSTBCSM). With respect to the current literature, this paper presents:

An adaptive transmission protocol to accommodate N relays in decodeandforward (DF) WRNs, where \(N \in \mathbb {N}^{+}\). Unlike [3236], this protocol offers a transmit diversity gain of N _{0} (N≤N _{0}≤1) because the possibility of activating N _{0} number of relays simultaneously during transmission. Given some control information, the protocol can be adapted to transmit through any given number of relays (N _{0}). This means the network can work with a varying number of N _{0}, which is a desirable feature for networks that experience imperfect time synchronisation [37,38].

An algorithm to construct DSTBCSM codes. Unlike [15,16,1921], this algorithm offers a rate that increases with the number of relays. The rate for this code is \(r_{0} \text {log}_{2} M_{2}+\frac {1}{T_{2}}\text {log}_{2} c\) bpcu instead of r _{0}log_{2} M _{2} bpcu, where \(c=\left \lfloor \left (\begin {array}{c} N\\N_{0}\end {array}\right)\right \rfloor _{2^{p}}\) is the number of possible relay combinations, r _{0} is the code rate of the used STBC, M _{2} is the order of modulation used by the relays and ⌊.⌋ represents the floor integer operator. The increase in throughput uses the same total average transmitting energy. This is as only N _{0} of the N available participating relays are active at any given time. The proposed algorithm uses multilevel optimisation processes, and hence the constructed code outperforms the few existing STBCSM codes.

An optimal and suboptimal reducedcomplexity decoder to work for the proposed protocol. The orthogonal property of the STBC allows a decoding complexity to reduce from \(\mathcal { O}\left (cM_{2}^{n_{s}}\right)\) to \(\mathcal { O}(cn_{s}M_{2})\), where n _{ s } is the number of symbols per information block of transmission. Using the suboptimal decoder, this decoding complexity can be further reduced to \(\mathcal { O}(c+n_{s}M_{2})\) with some performance penalty. This makes it suitable to acquire higher throughput.

Theoretical analysis of diversity gain, coding gain and required decoding complexity of the proposed protocol. Also, these claims are backed up by numerical simulations.
This paper is organised as follows: First, the network model is described followed by an outline of the proposed transmission protocol. Designing the DSTBCSM code is then discussed. This is followed by a theoretical analysis of performance and complexity. Last, empirical results to back up the claims are presented.
1.3 Notations
Hereafter, small letters, bold small letters and bold capital letters will designate scalars, vectors and matrices, respectively. If A is a matrix, then A ^{H}, A ^{∗} and A ^{T} denote the hermitian, conjugate and the transpose of A, respectively.
2 Network model
A dualhop WRN comprised a source , \(\hat {N}\) number of halfduplex (HD) relays \(R_{1},\ldots,R_{\hat {N}}\) and a destination is considered (depicted in Figure 1). Let the source and relays be equipped with a single antenna and the destination has N _{ r } antennas, \(N_{r}\in \mathbb {N}^{+}\). This configuration is denoted by \(\left (\hat {N},N_{r}\right)\). The transmission through the network is conducted in two phases. In the first phase, the information is broadcast from the source to the relays. In the second phase, each relay decodes its received symbols which are then only encoded and transmitted to the destination if received correctly. The total transmission power for the entire network is denoted by P and is evenly divided between both phases. The channel through the network is assumed to be a quasistatic Rayleigh fading channel. The source is assumed to be completely blind, while perfect CSI is assumed only at the decoding nodes.
3 The proposed transmission protocol
In this section, an adaptive protocol that uses an efficient combination of DSTBC and SM is proposed to obtain better cooperative diversity gain and higher overall throughput. This will be supported by a mathematical evaluation and an empirical comparison to existing protocols on bit error rate (BER) graphs.
3.1 Protocol description
For a network configuration of \(\left (\hat {N},N_{r}\right)\), the transmission through the network is conducted in two phases:
Broadcasting phase:
The source transmits M _{1}ary PSK/QAM modulated symbols denoted by y(i)=[y(i,1),…,y(i,J)]^{T}, where i denotes the information block index and J is the number of symbols in the broadcasting phase. To maximise the number of participating relays, the source () uses an error control code (ECC) to mitigate all errors. This is as relays are only allowed to transmit if no error is present (see IEEE 802.16j standard of [39]). Thus, the received vector at R _{ n } is
where g _{ n } (\(g_{n} \sim \mathcal { C} \mathcal { N}(0,1)\)) is the channel coefficient for the link between and R _{ n }. The vector v _{ n } is the noise at R _{ n } with entries \(v_{n} \sim \mathcal { C} \mathcal { N}\left (0,\sqrt {\frac {2}{P}}\right)\).
Multiplexing and relaying phase:
To match the proposed modifications, this phase’s name is changed to ‘multiplexing and relaying phase’ rather than ‘relaying phase’. As stated previously, a relay will not partake in this phase if it detects an error. To limit the discussion, it is assumed that a fixed number N out of \(\hat {N}\) relays will always have no errors. The participating N relays will each conduct the following on its K=Jlog_{2} M _{1} received bits (illustrated in Figure 2):

1.
The K decoded bits are divided into two groups. The first group contains K _{1} bits, and it is multiplexed to determine the relays that will be used to transmit the second group of K _{2} bits. These K _{2} bits are modulated and then encoded with the DSTBC. If K≠K _{1}+K _{2}, the excess bits must be buffered. The values of K _{1} and K _{2} are chosen according to Section 2.

2.
The binary sequence of the first group is converted to a decimal value ℓ. This value is used to determine if the relay is allowed to transmit and what it should transmit. The second group of K _{2} bits is modulated to a symbol vector y _{2}(i)=[y _{2}(1,i),…,y _{2}(n _{ s },i)]^{T} using a twotier star M _{2}ary QAM modulator (see Section 2).

3.
Given ℓ, the relay R _{ n } encodes its second group of K _{2} bits with a column of the DSTBC. The column index is obtained from the entries given in the codemapping table. This encoding process is expressed as
$$ \underset{L \times 1}{\mathbf{t}_{n}(i)}=\underset{L \times n_{s}}{\mathbf{A}_{n_{\ell}}}\underset{n_{s}\times 1}{\mathbf{y}_{2}(i)}+\underset{L \times n_{s}}{\mathbf{B}_{n_{\ell}}}\underset{n_{s} \times 1}{\mathbf{y}_{2}^{*}(i)}, $$((2))where L=n _{ s }/r _{0} and r _{0} is the code rate of the code used. n _{ ℓ } is the logic index used to identify the encoding matrices that should be used at relay R _{ n }. Both \(\mathbf {A}_{n_{\ell }}\) and \(\mathbf {B}_{n_{\ell }}\) are the encoding matrices responsible for generating the column n _{ ℓ } of the DSTBC matrix. All of \(\mathbf {A}_{n_{\ell }}\) and \(\mathbf {B}_{n_{\ell }} \left (n_{\ell }=1\ldots N_{0}\right)\) are characterized by the DSTBC matrix and are used to construct the code in a distributive manner (see Appendix Appendix 1: Example STBC encoding matrices) [11,29]. It is worth noting that many existing DSTBC matrix can be used, given the number of relays and the extent of the diversity gain required (N _{0}). This will be discussed in detail in Section 2.

4.
The vector t _{ n }(i) is then phaserotated to ensure maximum diversity and coding gain. If the rotation is not used, then rank deficiency occurs due to interfering codewords and the achieved diversity gain is reduced. This results in the transmitted vector given as \(\mathbf {t}^{\theta }_{n}(i)=\text {exp}(j\theta _{i})\mathbf {t}_{n}(i)\), where θ _{ i }, θ _{ i }∈[0,π] are provided by the codemapping table.
Accordingly, the received symbol matrix at destination is given by
where \(\mathbf {h}_{n}=\left [h_{n,1},\ldots,h_{n,N_{r}}\right ]^{T}\) is the channel coefficient vector from the relay R _{ n } to the destination with entries \(h_{n,j} \sim \mathcal { C} \mathcal { N}(0,1)\). The matrix η is the noise at the destination with entries \(\eta _{\textit {ij}} \sim \mathcal { C} \mathcal { N}\left (0,\sqrt {\frac {2}{P}}\right)\).
The received signal matrix of (3) can be rewritten using (2) as
where \(\boldsymbol {\mathcal { H}}_{\ell }\) is the equivalent channel matrix that encapsulates both the rotation employed and the channel coefficients of the relay set ℓ used for transmission.
3.2 DSTBCSM system design and optimisation
3.2.1 Review of conventional STBCSM
Recently, the design of STBCSM codes has drawn attention because of the promising improvements shown [3236]. In this section, background and some required definitions of STBCSM that are needed to work for DSTBCSM are shown.
Definition 1.
The STBC scheme is represented by a matrix expressed as
where the columns represent the encoded L timeslot sequences that should be transmitted by the N transmitting antennas of the source. If n _{ s } denotes the number of encoded symbols, then the code rate r of the used STBC is defined as \(r=\frac {n_{s}}{L}\). ■
Definition 2.
Let X denote the STBC matrix (see Definition 1) and the STBCSM code word denoted by X _{ i,j } [32]. An STBCSM codebook \(\mathcal { X}_{d}\) is defined as a set of n _{ X } STBCSM codewords. The STBCSM code is, here, formally defined as a set of \(n_{\mathcal { X}}\) codebooks. ■
Definition 3.
Let be an STBCSM code with \(n_{\mathcal { X}}\) codebooks, and each has n _{ X } codewords. The minimum coding gain distance (CGD) is defined by
where \(i,j=1\ldots n_{\mathcal { X}}\) and \(\gamma _{\min }(\mathcal { X}_{i}, \mathcal { X}_{j})\) is the minimum CGD between two codebooks given by
The variables l,k=1…n _{ X }, \(\mathbf {H}_{\lambda }\left (\mathbf {X}_{\textit {ik}}, \hat {\mathbf {X}}_{\textit {jl}}\right)\) are the harmonic mean of the nonzero eigenvalues of \(\mathbf {A}\left (\mathbf {X}_{\textit {ik}}, \hat {\mathbf {X}}_{\textit {jl}}\right)= \Delta \left (\mathbf {X}_{\textit {ik}}, \hat {\mathbf {X}}_{\textit {jl}}\right)\Delta ^{H}\left (\mathbf {X}_{\textit {ik}}, \hat {\mathbf {X}}_{\textit {jl}}\right)\), and \(\Delta \left (\mathbf {X}, \hat {\mathbf {X}}\right)=\mathbf {X}\hat {\mathbf {X}}\). ■
The STBCSM code exploits the properties of SM by distributing the STBC codeword over a subset of the number of antennas at the transmitter. The number of antennas at the transmitter is fixed. This allows the construction only of a fixed STBCSM code. For example, codewords of an STBCSM code () proposed in [32] is based on Alamouti’s STBC for a 4×1 MIMO system which are expressed as
In this STBCSM design, the first 2 bits are used to decide on the codeword X _{ ij }. These bits define the set of antennas to transmit the remaining encoded bits (y(1) and y(2)). It should be noted that each codeword X _{ ij } uses a unique antenna mapping pattern. The phase rotation θ _{ i } is set to avoid rank deficiency among codebooks to mitigate diversity gain loss. The designs of a more complex STBCSM in a MIMO system have shown promising improvements and recently have started to attract attention [3236].
3.2.2 DSTBCSM code construction
In a conventional MIMO system, the number of antennas at both the destination and source is fixed. In contrast, the number of transmitting antennas is determined by the number of available relays in WRNs. The number of relays can differ for each initiated transmission, a variation that equates to the need for a DSTBCSM code to operate over a varying distributed network. In this section, an algorithm is defined to construct DSTBCSM codes to work in WRNs. Two examples of constructing a DSTBCSM code for given WRNs are also provided.
The construction of an optimal DSTBCSM code relies on the proper selection of a relay index pattern that maximises the CGD. To reduce the search space for the optimised codebooks, the inner and mutual CGDs are formally defined:
Definition 4.
For a given , the inner CGD (\(\varphi _{\min }(\mathcal { X})\)) and the mutual CGD (\(\delta _{\min }(\mathcal { X})\)) are given by
and
respectively. ■
Another two important metrics in the construction of the code are how the relay patterns are chosen, namely the indexing distance and the Hamming distance. Both are used in the shown algorithm and are formally defined as
Definition 5.
Let {R _{ i }} and {R _{ j }}, \(i \text {and }j \in \mathbb {N}\), denote two sets of relays. Then, \(\rho : \mathbb {N} \rightarrow (\{R_{i}\}\cap \{R_{j}\})\) defines the indexing distance. This computes the size of the intersection between these two sets. ■
Definition 6.
Let {R _{ i }} and {R _{ j }}, \(i \text {and }j \in \mathbb {N}\), denote two sets of relays with similar cardinality. Then, \(d_{\text {min}}: \mathbb {N} \rightarrow (\{R_{i}\},\{R_{j}\})\) defines the Hamming distance between the two sets of relays. ■
To maximise the BER performance, the proposed algorithm is designed to construct codewords with minimal indexing distance ρ and maximum Hamming distance d _{min}. This design can operate on the common modulation schemes, but an additional improvement was observed using star QAM. The star QAM relies on two parameters that are also optimised in the algorithm as an additional step and, for completeness, are defined in Definition 7.
Definition 7.
A twotier star Mary QAM modulation has its constellation points distributed over two amplitude levels a and b. There are \(\frac {M}{2}\) constellation points on each amplitude level with a phase difference ϕ [40], as depicted in Figure 3.
Both a and ϕ should be optimised to maximise codeword differences. \(b=\sqrt {2a^{2}}\) should hold to ensure a unity average transmitted power. ■
Now with the necessary definitions, the proposed algorithm can be described in detail in Algorithm 1. Two examples are provided to illustrate how the algorithm operates. The codes shown below follow step by step in its construction phase. The algorithm shown have a code rate of
where r and r _{0} are the code rate of the constructed DSTBCSM and the STBC used, respectively.
The overall rate increases as the number of relays increases. This is seen in (12) for a number of participating relays (examples are shown in Table 1).
Example 1.
Let N _{0}=2 and N=4, then the number of possible combinations is c=4. A DSTBCSM is constructed based on the proposed algorithm while using Alamouti’s STBC shown in Appendix Appendix 1: Example STBC encoding matrices. For illustration purposes, the optimisation process results are shown in Appendix Appendix 2: Optimising a codemapping table. The STBCSM proposed in [32] that was originally designed for a conventional MIMO system can be used on this WRN, but Section 2 shows an improvement when using the proposed algorithm. The final constructed codemapping table is given in Table 2. ■
Example 2.
Let N _{0}=3 and N=6, then the number of possible combinations is c=8. A DSTBCSM is constructed using the STBC (with code rate \(\frac {3}{4}\)) of Appendix Appendix 1: Example STBC encoding matrices. The constructed codemapping table is given in Table 3. To avoid repetition, the illustration of optimization process for this code is omitted. ■
3.3 Decoding methods
The growing demand for more complex WRN transmissions requires more complex decoders at the receiving node. In this section, an optimal maximum likelihood (ML) decoder for the transmission protocol is described, followed by a proposal of a reducedcomplexity decoder.
3.3.1 Optimal ML decoder
The ML decoder considers an exhaustive search trying to estimate the transmitted data. This is expressed as
where \(\mathcal { S}_{2}\) is the M _{2}ary starQAM modulation used by the relays.
This equates to searching over all \(cM_{2}^{n_{s}}\) permutations. Assuming an orthogonal STBC (OSTBC) is used, the received matrix can be decomposed into
and
where \(\mathbf {u}= \left [ \mathbf {u}(1), \mathbf {u}(2), \ldots, \mathbf {u}(n_{S})\right ]^{T}=\boldsymbol {\mathcal { H}}_{\ell }^{H}\mathbf {y}_{d}\) and \(\boldsymbol {\mathcal { H}}_{\ell }^{H}\boldsymbol {\mathcal { H}}_{\ell }=\beta \mathbf {I}_{n_{s}}\).
This simplification based on the orthogonality property reduces the complexity of the decoder from \(cM_{2}^{n_{s}}\) to n _{ s } c M _{2}.
3.3.2 Proposed reducedcomplexity decoder
A further reduction in decoding complexity can be made using two sequential steps, with an accepted loss in BER performance. The first step determines the set of relays used in the relaying phase. This is accomplished by using a projection matrix P _{ ℓ } with the condition that \(\mathbf {P}_{\ell }\boldsymbol {\mathcal { H}}_{\ell }=0\). This projection matrix maps the received vector y _{ d } to an orthogonal subspace \(\boldsymbol {\mathcal { H}}_{\hat {\ell }}=\left [\begin {array}{cccc} \boldsymbol {\mathcal { H}}_{1}\ldots & \boldsymbol {\mathcal { H}}_{\ell 1} & \boldsymbol {\mathcal { H}}_{\ell +1} & \ldots \boldsymbol {\mathcal { H}}_{c}\end {array}\right ]\). The projection matrix is computed as
This matrix projects the received vector y _{ d } to the space of \(\boldsymbol {\mathcal { H}}_{\ell }\), which results in a product of zero for the correct set of relays if N _{ r }≥N _{0} and has no channel impairments. However, in the presence of channel impairments, the projection of the received vector z is altered and the decoder decides on the set of relays by
It should be noted that there are numerous reducedcomplexity (RC) detectors that appeared in the literature and that can be adapted for the first step of this sequential detector [4446]. They differ in the offered performance complexity tradeoff. The second step of this decoder is conducted using a traditional OSTBC decoder which computes [11]
where \(\mathbf {u}=\boldsymbol {\mathcal { H}}_{\hat {\ell }}^{H}\mathbf {z}\), and \(\boldsymbol {\mathcal { H}}_{\hat {\ell }}^{H}\boldsymbol {\mathcal { H}}_{\ell }=\beta \mathbf {I}_{n_{s}}\) and \(\mathbf {I}_{n_{s}}\) is n _{ s }×n _{ s } identity matrix.
Thus, it can be observed that the number of all possible combinations for an ML search reduces from c n _{ s } M _{2} to (c+n _{ s } M _{2}).
4 Performance analysis
In this section, the proposed transmission protocol is evaluated theoretically in terms of diversity gain, coding gain and the decoding complexity.
4.1 Diversity analysis
The diversity gain of a DF WRN is determined by the broadcasting or relaying phase that offers the lowest diversity gain individually. The scope of this work is focused on the diversity gain in the relaying phase. This section shows analysis of the diversity gain in the case of the optimal ML decoder and then in the case of the RC decoder.
4.1.1 ML decoder diversity analysis
Lemma 1.
If the diversity gain of an STBC code is N _{0}×N _{ r }, then constructing the DSTBCSM based on Algorithm 1 using this STBC will also have a diversity gain of N _{0}×N _{ r }, if the ML decoder of Section 2 is used at the destination.
Proof.
It is known that a wireless communication system achieves a space diversity gain of d if the average error probability is upper bounded in the high SNR range by \(\mathbb {P}\leq \alpha \gamma ^{d}\), where \(\alpha \in \mathbb {R}^{+}\) and it is independent of γ. γ is the SNR.
Assuming that a codeword X is transmitted through the relays, then (4) is equivalently written for a singleantenna destination as
where h is the relaysdestination channel vector.
Thus, the conditional pairwise error probability (PEP) of the WRN (see Section 2) can be computed as [47]
where \(Q\left (x\right)=\int _{x}^{\infty }{e^{y^{2}/2}\text {dy}}\). The error matrix is denoted by \(\Delta \mathbf {X} =\mathbf {X}\hat {\mathbf {X}}\).
Equation (21) can be expanded as
where \(\Lambda =\text {diag}\left ({\lambda _{1}^{2}},\ldots,{\lambda _{N}^{2}}\right)\) and λ _{ n } denotes the singular values of Δ X. V is a unitary matrix and \(\tilde {\mathbf {h}}=\mathbf {V} \mathbf {h}\). It is worth noting that there is no rank deficiency in Λ due to using of the phase rotation (see Appendix Appendix 3: Rank of the constructed code).
Equation (22) can be simplified and bounded as
Given that the former code construction steps are followed, the rank of N _{0} is preserved (see Appendix Appendix 3: Rank of the constructed code). Thus, according to Lemma 1 of [48], the unconditional PEP is determined by
which can be approximated for high SNR values as
This concludes that a transmit diversity gain of N _{0} is achieved. As the equivalent channel matrix is a concatenation of the equivalent channel matrices of each receive antenna, it suffices to check the diversity gain for only one receiving antenna. This results in a diversity gain of N _{0}×N _{ r } for a code employed with an N _{ r }antenna destination.
4.1.2 Diversity analysis of RC decoder
It was shown that the designed DSTBCSM code achieves the full diversity gain if the ML decoder is used. However, the RC decoder of Section 2 has limited diversity gain encapsulated in (18). It is limited by the relay combination detection step, which has an error probability \(\mathbb {P}_{c}\) of
where with \({\sigma _{i}^{2}}={\sigma _{i}^{2}}\left \Vert \mathbf {P}_{\ell }\right \Vert ^{2}\), μ _{ i }=P _{ ℓ } H and
This holds assuming that ν _{ ℓ }=P _{ ℓ } z^{2} and information bits are independent and equiprobable.
By applying the Chernoff bound to (26), we can rewrite as
Averaging over H, the relay combination detection error can be determined as
From (28), it can be concluded that the twostep decoder can achieve only the fullreceive diversity gain N _{ r }. Therefore, the complexity reduction is at the expense of transmit diversity gain.
4.2 Coding gain analysis
The coding gain of the proposed DSTBCSM code is improved by maximising the CGD. The inner and mutual CGD of the code designed in Example 1 is compared with the code of [32] under the assumption of using an 8ary modulation.
Thus, it can be observed that the proposed STBCSM has a larger inner and mutual CGD than the code proposed in [32], and hence, better performance can be achieved (Table 4).
4.3 Complexity analysis
The complexity order is defined here as the number of iterations needed to find the optimal estimate for (4). The complexity order of the optimal ML decoder is \(\mathcal {O}\left (cM_{2}^{n_{s}}\right)\), where n _{ s } is the number of symbols per codeword and M _{2} is the order of the modulation used. This order is reduced to \(\mathcal {O}(cM_{2}n_{s})\) when orthogonality of the STBC used is preserved. This is as orthogonality allows linear decomposition of the symbols. In contrast, the complexity order of the proposed RC decoder is further reduced to \(\mathcal {O}(c+M_{2}n_{s})\). This is because the set of transmitting relays is firstly identified. A comparison of the complexity order is shown in Figure 4 in terms of the number of relays, for the configuration used in Example 1. The offered bits per channel use (bpcu) is also shown; this is determined by the number of relays and the modulation scheme. From Figure 4, it is observed that the complexity of the RC decoder increases marginally with the number of relays when compared to the complexity of the optimal ML decoder. The advantage of using the RC decoder is that the throughput can be increased from 3 to 4.5 bpcu for a 4ary modulation scheme without complexity increasing at a cost of minor loss in performance.
5 Simulation results
Numerical simulations are shown here in terms of BER to back up the theoretical claims of the proposed protocol. First, Example 1 and 2 networks are simulated and compared with a number of existing systems in Figures 5 and 6, respectively. This is to show how the proposed protocol and the constructed codes outperform the existing systems. Tables 5 and 6 summarise the simulation parameters used for the existing systems. This section shows also a comparison of using the optimal ML decoder and the RC decoder for different network configurations (shown in Figure 7). All simulations were conducted on a Rayleigh faded channel, and it was assumed that the total transmission power is evenly distributed between the transmission phases. For comparison purposes, the shown figures include two slope diversity gain reference curves for cases of (N×N _{ r }) and (N _{0}×N _{ r }).
In Figure 5, the proposed transmission protocol (using the code in Example 1 on a (4^{2},4) network) is compared to Alamouti’s STBC, the \(\frac {3}{4}\)OSTBC, the ABBA code and the traditional SM. Alamouti’s STBC is limited to only two relays and can achieve a transmit diversity gain of 2 (N _{0}=2), while both the \(\frac {3}{4}\)OSTBC and the ABBA code constantly utilise all four relays and achieve a transmit diversity gain of N _{0}=N=4. However, they lose the throughput that can be offered by SM. The traditional SM offers better throughput at the cost of not using an STBC, which results in a loss of transmit diversity gain and coding gain. For a fair comparison in this experiment, no constraint was imposed on the modulation order used and the resulting system was required to provide a bpcu of 2. With reference to Figure 5, it is observed that the proposed protocol reports an improved BER performance. Specifically, it results in performance gains of 1.3, 2.3 and 3.6 dB over networks employing Alamouti’s STBC, \(\frac {3}{4}\)OSTBC and ABBA code, respectively. In addition, a gain of 1 dB was achieved over the STBCSM of [32] because of the unique selection of the c codewords and the use of optimised starQAM modulation. It should be noted that this STBCSM code of [32] was originally designed for a conventional MIMO system and was extended here to operate on the WRN for the purpose of this comparison.
The proposed protocol was simulated in Figure 6 for another network configuration of (6^{3},4) to investigate the ability to achieve higher diversity gain and to offer higher throughput. It was compared to an ABBA system which offers a transmit diversity gain of N _{0}=N=6 by using all the available relays but without throughput improvement. A simulation of the traditional SM was included again to illustrate how the throughput can be maximised. It was observed that the proposed protocol had the lowest BER in this experiment with a diversity gain of (N _{0}=3)×(N _{ r }=4). It provides an SNR gain of 1.2 and 2.8 dB over networks employing the ABBA code and SM, respectively.
In the next experiment, the loss in performance in the case of using the RC decoder was investigated in Figure 7. It was compared to the optimal ML decoder in WRNs of (3^{2},4), (5^{2},4) and (8^{2},4). It should be noted that a reduction in complexity is ideal in certain applications when higher throughput is needed. In this experiment, it was observed that the optimal ML decoder achieved a diversity gain of (2×N _{ r }=8), while the RC decoder had a reduced diversity gain of N _{ r }=4.
6 Conclusions
Motivated by the developments in spatial modulation, an adaptive transmission protocol was proposed for WRNs to exploit the potential space diversity gain while obtaining higher spectral efficiency. Unlike the existing literature, this protocol can accommodate an arbitrary number of relays while improving the overall throughput and maintaining the same achieved space diversity gain. In addition, an algorithm to generate DSTBCSM codes to be used by this protocol was shown. The achieved performance of the resulting codes is better than that of many existing codes because the criteria are designed to choose the codewords and to employ a multilevel optimization process. Also, a further reducedcomplexity decoder is proposed. All of these claims are accompanied by numerical and theoretical evaluations.
7 Appendices
7.1 Appendix 1: Example STBC encoding matrices
For the sake of convenience the encoding matrix of each STBC used in the two examples are listed here. For Example 1, the fullrate Alamouti’s STBC code is used given as
with encoding matrices: A _{1}=I _{2},B _{1}=0 _{2},A _{2}=0 _{2}, and \(\mathbf {B}_{2}=\left [ \begin {array} {cc} 0&1\\ 1&0\\ \end {array} \right ]\).
In Example 2, a \(\frac {3}{4}\)rate OSTBC code is used given as
with encoding matrices:
7.2 Appendix 2: Optimising a codemapping table
The resulting figures of the optimization process of Example 1 code are shown here for illustration purposes. First, the parameters set {a,ϕ} for a M _{2}ary starQAM modulation is chosen to maximise the inner CGD for the given code. In Figure 8, the inner CGD is shown over search ranges of a and ϕ. The values for the example was a=0.65 and ϕ=0.78 which provided a maximum inner CGD of 0.70.
Another optimization which is crucial is to determine the correct phase rotation θ _{ i } for each codebook. This is to avoid rank deficiency among codebooks to mitigate diversity gain loss. This is accomplished by choosing the set {θ _{ i }} to maximise the mutual CGD. In Figure 9, the mutual CGD is shown for Example 1 for the search range of θ.
7.3 Appendix 3: Rank of the constructed code
Following the steps of Algorithm 1, the constructed DSTBCSM code based an STBC (), is with rank of N _{0}, has the same rank of .
Proof.
Let {X} denote the set of codewords for a codebook \(\mathcal { X}_{i}\). The rank of the constructed code in Example 1, computed from \(\mathbf {A}(X,\hat {X})\) of (), is investigated to show that the maximum rate is preserved. There are two cases to consider: (1) when two codewords belong to the same codebook and (2) for the case of two different codebooks. In the first case, two codewords are present in the same codebook that used identical relays in its transmission. This results in
[t]̱ It can be noticed that \(\mathbf {A}(\mathbf {X},\hat {\mathbf {X}})\) of the constructed DSTBCSM is equal to the original STBC used in the construction of the code. Therefore, it has a rank of N _{0} if the used STBC has this rank.
In the second case, where two codewords belong to two different codebooks, the phase rotation between codebooks is used to mitigate rank deficiency among codebooks. The rank of N _{0} is preserved even under the worst case among codeword combination possibilities. Without loss of generality, this concept is shown for Example 1 as
It should be noted that if the phase θ is set to zero, then the code is rank deficient over several symbols, e.g. when \(\{\mathbf {y}(1)=\hat {\mathbf {y}}(2),\mathbf {y}(2)=\hat {\mathbf {y}}(1)\}\) and \(\{\mathbf {y}(1)=\mathbf {y}(2)=\hat {\mathbf {y}}(1)=\hat {\mathbf {y}}(2)\}\). However, if θ is selected to mitigate this effect, then the rank is preserved. ■
References
JNab Laneman, DNCc Tse, GWa Wornell, Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Trans. Inf. Theory. 50(12), 3062–3080 (2004).
SS Ikki, MH Ahmed, in IEEE Vehicular Technology Conference. Performance analysis of generalized selection combining for decodeandforward cooperativediversity networks (Ottawa, ON, 6–9 Sept. 2010).
Q Deng, A Klein, Relay selection in cooperative networks with frequency selective fading. EURASIP J. Wireless Commun. Networking. 2011(1), 171 (2011). doi:10.1186/168714992011171.
GK Karagiannidis, C Tellambura, S Mukherjee, AO Fapojuwo, Multiuser cooperative diversity for wireless networks. EURASIP J. Wireless Commun. Networking. 2006(1), 017202 (2006). doi:10.1155/WCN/2006/17202.
Y Izi, A Falahati, Amplifyforward relaying for multipleantenna multiple relay networks under individual power constraint at each relay. EURASIP J Wireless Commun. Networking. 2012(1), 50 (2012). doi:10.1186/16871499201250.
J Laneman, G Wornell, Distributed spacetimecoded protocols for exploiting cooperative diversity in wireless networks. IEEE Trans. Inf. Theory. 49(10), 2415–2425 (2003).
M Dohler, M Hussain, A Desai, H Aghvami, in IEEE Vehicular Technology Conference, 59. Performance of distributed spacetime block codes (Milan, Italy, 17–19 May 2004), pp. 742–746. Chap. 2.
G Menghwar, A Jalbani, M Memon, Hyder1, M., C Mecklenbrauker, Cooperative spacetime codes with network coding. EURASIP Journal on Wireless Communications and Networking. 2012(1), 205 (2012). doi:10.1186/168714992012205.
Y Jing, B Hassibi, Diversity analysis of distributed spacetime codes in relay networks with multiple transmit/receive antennas. Eurasip J. Adv. Signal Process, 254573 (2008).
MT El Astal, B Salmon, JC Olivier, Fullspace diversity and fullrate distributed spacetime block codes for amplifyandforward relaying networks. IET, J. Eng. 1, 0 (2009).
Y Jing, H Jafarkhani, Using orthogonal and quasiorthogonal designs in wireless relay networks. IEEE Transactions on Information Theory. 53(11), 4106–4118 (2007).
X Liang, X Xia, On the nonexistence of rateone generalized complex orthogonal designs. IEEE Trans. Inf. Theory. 49(11), 2984–2989 (2003). Cited By (since 1996):63.
Y Jing, B Hassibi, Distributed spacetime coding in wireless relay networks. IEEE Trans. Wireless Commun. 5(12), 3524–3536 (2006).
GS Rajan, BS Rajan, Multigroup ML decodable collocated and distributed spacetime block codes. IEEE Trans. Inf Theory. 56(7), 3221–3247 (2010).
Z Yi, I Kim, Singlesymbol ML decodable distributed STBCS for cooperative networks. IEEE Trans. Inf. Theory. 53(8), 2977–2985 (2007).
Sreedhar, A. D. Chockalingam, B Rajan, Singlesymbol ML decodable distributed STBCS for partiallycoherent cooperative networks. IEEE Trans. Wireless Commun. 8(5), 2672–2681 (2009).
K Pavan Srinath, B Sundar Rajan, in IEEE Inf. Theory Workshop 2010, ITW 2010. Single realsymbol decodable, highrate, distributed spacetime block codes (Cairo, Egypt, 6–8 Jan. 2010).
T Peng, R.C., de Lamare, A Schmeink, Adaptive distributed spacetime coding based on adjustable code matrices for cooperative MIMO relaying systems. IEEE Trans. Commun, 2692–2703 (2013).
B Maham, A Hjørungnes, in Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, ITW. Distributed GABBA spacetime codes in amplifyandforward cooperation (Solstrand, 1–6 July 2007), pp. 189–193.
B Maham, A Hjørungnes, G Abreu, in SAM 2008  5th IEEE Sensor Array and Multichannel Signal Processing Workshop. Distributed GABBA spacetime codes with complex signal constellations (Darmstadt, Germany, 21–23 July 2008), pp. 118–121.
B Maham, A Hjørungnes, G Abreu, Distributed GABBA spacetime codes in amplifyandforward relay networks. IEEE Trans. Wireless Commun. 8(4), 2036–2045 (2009).
T Giuseppe, D Freitas, Generalized ABBA spacetime block codes. CoRR. abs/cs/0510003 (2005).
RY Mesleh, H Haas, S Sinanovic, CW Ahn, S Yun, Spatial modulation. IEEE Trans. Vehicular Technol. 57(4), 2228–2241 (2008). doi:10.1109/TVT.2007.912136.
P Yang, B Zhang, Y Xiao, B Dong, S Li, M ElHajjar, L Hanzo, Detectandforward relaying aided cooperative spatial modulation for wireless networks. IEEE Trans. Commun. 61(11), 4500–4511 (2013).
R Mesleh, S Ikki, M Alwakeel, Performance analysis of space shift keying with amplify and forward relaying. IEEE Commun. Lett. 15(12), 1350–1352 (2011).
S Sugiura, S Chen, H Haas, PM Grant, L Hanzo, Coherent versus noncoherent decodeandforward relaying aided cooperative spacetime shift keying. IEEE Trans. Commun. 59(6), 1707–1719 (2011).
R Mesleh, S Ikki, EH Aggoune, A Mansour, Performance analysis of space shift keying (SSK) modulation with multiple cooperative relays. EURASIP J. Adv. Signal Process. 2012(1), 201 (2012). doi:10.1186/168761802012201.
R Mesleh, SS Ikki, Performance analysis of spatial modulation with multiple decode and forward relays. IEEE Wireless Communications Letters. 2(4), 423–426 (2013).
JNab Laneman, DNCc Tse, GWa Wornell, Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Trans. Inf. Theory. 50(12), 3062–3080 (2004).
Y Yang, S Aïssa, Informationguided transmission in decodeandforward relaying systems: spatial exploitation and throughput enhancement. IEEE Trans. Wireless Commun. 10(7), 2341–2351 (2011).
D Yang, C Xu, L Yang, L Hanzo, Transmitdiversityassisted spaceshift keying for colocated and distributed/cooperative MIMO elements. IEEE Trans. Vehicular Technol. 60(6), 2864–2869 (2011).
E Basar, U Aygolu, E Panayirci, HV Poor, Spacetime block coded spatial modulation. IEEE Trans. Commun. 59(3), 823–832 (2011). doi:10.1109/TCOMM.2011.121410.100149.
L Wang, Z Chen, X Wang, A spacetime block coded spatial modulation from (n,k) error correcting code. IEEE Wireless Commun. Lett. 3(1), 54–57 (2014).
X Li, L Wang, High rate spacetime block coded spatial modulation with cyclic structure. IEEE Commun. Lett. 18(4), 532–535 (2014).
H Mai, T Dinh, X Tran, M Le, V Ngo, in 2012 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2012. A novel spatiallymodulated orthogonal spacetime block code for 4 transmit antennas (Ho Chi Minh City, 12–15 Dec. 2012), pp. 119–123.
M Le, V Ngo, H Mai, XN Tran, M Di Renzo, Spatially modulated orthogonal spacetime block codes with nonvanishing determinants. IEEE Trans. Commun. 62(1), 85–99 (2014).
MTO El Astal, AM AbuHudrouss, Sic detector for 4 relay distributed spacetime block coding under quasisynchronization. IEEE Commun. Lett. 15(10), 1056–1058 (2011).
F Zheng, AG Burr, S Olafsson, Signal detection for distributed spacetime block coding: 4 relay nodes under quasisynchronisation. IEEE Trans. Commun. 57(5), 1250–1255 (2009).
V Genc, S Murphy, Y Yu, J Murphy, IEEE 802.16j relaybased wireless access networks: an overview. Wireless Commun., IEEE. 15(5), 56–63 (2008). doi:10.1109/MWC.2008.4653133.
L Hanzo, S Ng, T Keller, W Webb, Star QAM Schemes for Rayleigh Fading Channels. Quadrature Amplitude Modulation: From Basics to Adaptive TrellisCoded, TurboEqualised and SpaceTime Coded OFDM, CDMA and MCCDMA Systems (WileyIEEE Press, 2004).
S Kitaev, Patterns in Permutations and Words (Springer, London, 2011).
C Savage, A survey of combinatorial gray codes. SIAM Rev. 39(4), 605–629 (1997).
T Hough, F Ruskey, An efficient implementation of the Eades, Hickey, Read adjacent interchange combination generation algorithm. J. Comb. Math. Comb. Comp. 4, 79–86 (1988).
MM Mansour, A nearML MIMO subspace detection algorithm. IEEE Signal Process. Lett. 22(4), 408–412 (2014).
Y Chen, S Ten Brink, in IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC. Nearcapacity MIMO subspace detection (Toronto, ON, 11–14 Sept. 2011), pp. 1733–1737.
RC De Lamare, Adaptive and iterative multibranch MMSE decision feedback detection algorithms for multiantenna systems. IEEE Trans. Wireless Commun. 12(10), 5294–5308 (2013).
MK Simon, MS Alouini, Digital Communication over Fading Channels, 2nd edn (WileyIEEE Press, USA, 2004).
MC Ju, H Song, I Kim, Exact BER analysis of distributed Alamouti’s code for cooperative diversity networks. IEEE Trans. Commun. 57(8), 2380–2390 (2009).
AT Hanan, B Imad, Performance analysis of relay selection in cooperative networks over Rayleigh flat fading channels. EURASIP J. Wireless Commun. Networking. 2012(10), 224 (2012). doi:10.1186/168714992012224.
S Narayanan, M Di Renzo, F Graziosi, H Haas, in IEEE Vehicular Technol. Conference. Distributed spatial modulation for relay networks (Las Vegas, NV, 2–5 Sept. 2013).
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made.
The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
To view a copy of this licence, visit https://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
O El Astal, M.T., AbuHudrouss, A.M., Salmon, B.P. et al. An adaptive transmission protocol for exploiting diversity and multiplexing gains in wireless relaying networks. J Wireless Com Network 2015, 37 (2015). https://doi.org/10.1186/s1363801502669
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s1363801502669