 Research
 Open Access
NonRegenerative MultiAntenna MultiGroup MultiWay Relaying
 Aditya Umbu Tana Amah^{1}Email author and
 Anja Klein^{2}
https://doi.org/10.1186/16871499201129
© Amah and Klein; licensee Springer. 2011
 Received: 23 December 2010
 Accepted: 5 July 2011
 Published: 5 July 2011
Abstract
We consider nonregenerative multigroup multiway (MGMW) relaying. A halfduplex nonregenerative multiantenna relay station (RS) assists multiple communication groups. In each group, multiple halfduplex nodes exchange messages. In our proposal, the required number of communication phases is equal to the maximum number of nodes among the groups. In the first phase, all nodes transmit simultaneously to the RS. Assuming perfect channel state information is available at the RS, in the following broadcast (BC) phases the RS applies transceive beamforming to its received signal and transmits simultaneously to all nodes. We propose three BC strategies for the BC phases: unicasting, multicasting and hybrid uni/multicasting. For the multicasting strategy, network coding is applied to maintain the same number of communication phases as for the other strategies. We address transceive beamforming maximising the sum rate of nonregenerative MGMW relaying. Due to the high complexity of finding the optimum transceive beamforming maximising the sum rate, we design generalised low complexity transceive beamforming algorithms for all BC strategies: matched filter, zero forcing, minimisation of mean square error and BCstrategyaware transceive beamforming. It is shown that the sum rate performance of nonregenerative MGMW relaying depends both on the chosen BC strategies and the applied transceive beamforming at the RS.
Keywords
 Multiway relaying
 Nonregenerative
 Multiantenna
 Analog network coding
 Transceive beamforming
Introduction
Twoway relaying is a spectrally efficient protocol to establish bidirectional communication between two halfduplex nodes via a halfduplex relay station (RS) [1–3]. It was shown in [1, 3] that twoway relaying outperforms the traditional oneway relaying due to its smaller number of communication resources. In twoway relaying, two communication phases are needed. The first phase is the multiple access (MAC) phase where the two communicating nodes send their data streams simultaneously to the RS. The second phase is the broadcast (BC) phase where the RS sends the processed signals simultaneously to both nodes. Consequently, the nodes need to cancel their selfinterference.
Regarding the signal processing at the RS, it can be either regenerative, cf. [1, 2] or nonregenerative, cf. [1, 3]. A regenerative RS regenerates (decodes and reencodes) the data streams of all nodes while a nonregenerative RS performs linear signal processing to the received signals and transmits the output to the nodes.
The use of multiple antennas can improve the spectral efficiency and/or the reliability of communication networks [4, 5]. For twoway relaying, a multiantenna RS that serves one bidirectional pair was considered in [6–8] for a regenerative RS and in [3, 9–11] for a nonregenerative RS. For the nonregenerative case, while [3, 9] assume multiantenna nodes, [10, 11] assume single antenna nodes. Their works consider optimal transceive beamforming at the RS maximising the sum rate as well as linear transceive beamforming based on Zero Forcing (ZF) [3, 9–11], Minimisation of Mean Square Error (MMSE) [3, 9, 10], Maximisation of Signal to Noise Ratio (MSNR) [3] and Matched Filter (MF) criteria [10, 11].
Multiuser twoway relaying, where an RS serves multiple bidirectional pairs, is treated in [12–14] for a regenerative RS and in [15, 16] for a nonregenerative RS. In [12], all bidirectional pairs are separated using Code Division Multiple Access. Every two nodes in a bidirectional pair have their own code which is different from the other pairs' codes. In contrast to [12], having multiple antennas at the RS and assuming perfect detection in MAC phase, in [13, 14] the separation of the pairs in the BC phase is done spatially using transmit beamforming employed at the RS. In [15], ZF and MMSE transceive beamforming for multiuser nonregenerative twoway relaying is designed to separate the nodes. In [16], blockdiagonalisationsingularvaluedecomposition (BDSVD) transceive beamforming is designed for separating the twoway pairs by extending BDSVD transmit beamforming proposed in [17].
In applications such as video conference and multiplayer gaming, multiple nodes exchange messages. In [18], the multiway relay channel is considered, where an RS assists multiple communication groups. In each group, each member node exchanges messages with other member nodes, but not with other nodes from the other groups. A fullduplex communication is assumed and time division is used to separate the multiway groups. The full duplex assumption, however, is not yet practical and halfduplex nodes and relays are more of practical importance [1, 19]. Therefore, communication protocols for multiway relaying for halfduplex nodes and a halfduplex RS are needed.
Multiway relaying protocols for one communication group, where a halfduplex multiantenna RS assists N halfduplex nodes to exchange messages, is proposed by the authors of this paper in [20] for a nonregenerative RS and in [21] for a regenerative RS. The required number of communication phases is only N, consisting of one MAC phase and N  1 BC phases. In [20, 21], in each BC phase, the RS sends N data streams to N nodes simultaneously. Thus, each node receives an intended data stream from a specific node, while seeing other data streams as interference. Nevertheless, the interference can be canceled by performing successive interference cancellation or by applying linear transceive beamforming, e.g., ZF, that nullifies the interference [20]. In [20], it was also shown that instead of transmitting N different data streams per BC phase, the RS can transmit one data stream simultaneously to all nodes in each BC phase. This data stream is a superposition of two different data streams. Consequently, each node has to perform self and knowninterference cancellation. Since in each BC phase the RS transmits only one superposed data stream to all nodes, there is no interstream interference and, thus, the performance is improved.
In this paper, we consider nonregenerative multigroup multiway (MGMW) relaying. A halfduplex multiantenna RS assists L multiway groups where each group consists of halfduplex single antenna nodes. We consider nonregenerative relaying where the RS performs transceive beamforming. Nonregenerative, compared to regenerative, has three advantages: no decoding error propagation, no delay due to decoding and deinterleaving, and transparency to the modulation and coding schemes that are used at the nodes [3].
In each lth multiway group, , , there are N_{ l } ≥ 2 nodes that exchange messages. In our proposal, the required number P of communication phases is equal to max _{ l }N_{ l } . Our work is a generalisation of some of the above mentioned publications. If L = 1 and N_{1} = 2, we have a nonregenerative twoway relaying as in [3, 10, 22]. If L > 1 and N_{ l } = 2, ∀l, , we have a nonregenerative multiuser twoway relaying as in [15, 16], and if L = 1 and N_{1} ≥ 2, we have a nonregenerative singlegroup multiway relaying as in [20].
We propose three BC strategies for the BC phases, namely, unicasting, multicasting and hybrid uni/multicasting. The proposed strategies are designed in such a way that the number of communication phases remains P = max _{ l }N_{ l } . We derive the sum rate expression for nonregenerative MGMW relaying with the proposed BC strategies for asymmetric and symmetric traffic. In asymmetric traffic all nodes in each group may communicate with different rate, while in symmetric traffic all nodes in each group communicate with the same rate.
We address the sum rate maximisation which requires optimum transceive beamforming. Due to the high complexity of finding the optimum transceive beamforming maximising the sum rate, we design generalised low complexity transceive beamforming algorithms for all proposed BC strategies, namely, ZF, MMSE, MF and BCstrategyaware (BCSA) transceive beamforming. BCSA transceive beamforming is designed by suppressing unwanted signals using either block diagonalisation (BD) [17] or regularised BD proposed in [23].
This paper is organised as follows. Section II explains the proposed broadcast strategies and the system model of nonregenerative MGMW relaying. Section III explains the sum rate expression. The transceive beamforming algorithms are explained in Section IV. The simulation results are given in Section V. Finally, Section VI provides the conclusion.
Notations
Boldface lower and upper case letters denote vectors and matrices, respectively, while normal letters denote scalar values. The superscripts (·)^{T}, (·)* and (·)^{H} stand for matrix or vector transpose, complex conjugate, and complex conjugate transpose, respectively. The operators mod _{ N } (x), E{X} and tr{X} denote the modulo N of x, the expectation and the trace of X, respectively, and denotes the circularly symmetric zeromean complex normal distribution with variance σ^{2}.
Broadcast Strategies And System Model
We consider L multiway communication groups. It is assumed that there are no direct links among the nodes and the MGMW communication can only be performed with the assistance of a halfduplex multiantenna RS with M antenna elements. In the l th group, , , there are N_{ l } nodes which exchange messages through an RS. For simplicity of notations, we consider the same number of nodes in all groups, i.e., N_{ l } = N_{mw}, . However, the extension to the case of different numbers of nodes in the groups is straightforward. The total number N of nodes in the network is .
Assuming that the RS already knows which nodes belong to which communication group, the RS makes the indexing of all nodes according to their group membership. Nodes in group one are indexed within the set {0,..., N_{1}  1}, nodes in group two are indexed within the set {N_{1},..., (N_{1} + N_{2})  1}, and so on. In general, it can be given as follows. The l th group consists of nodes Si_{ l } , , where is the set of node indices given by , with a_{ l } = (l  1)N_{mw}, b_{ l } = lN_{mw}  1. Each node only exchanges messages with the other nodes in its group and each node belongs only to one multiway group, i.e., , ∀l ≠ k and .
A. Broadcast Strategies
In this subsection, the broadcast strategies for nonregenerative MGMW relaying are described. The number P of communication phases to perform MGMW communication is given by the maximum number of nodes among all groups, i.e., P = max _{ l }N_{ l } = N_{mw}. In the first phase, the MAC phase, all nodes transmit simultaneously to the RS. In the following P  1 BC phases, the RS transmits to the nodes. Let p, , , denote the index of the BC phase. In p th phase, in group l, receiving node is intended to receive the data stream of transmitting node .
1) Unicasting Strategy
Using unicasting strategy, in each BC phase, the RS transmits different data streams to different nodes. Each data stream is intended only for one receiving node. Consequently, in each BC phase each node sees the other data streams transmitted by the RS to the other nodes as interference. The data stream transmitted from the RS to each particular node is changed in each BC phase, such that within P  1 BC phases, each node receives the data streams from all other nodes in its group.
2) Hybrid Uni/Multicasting Strategy
For each served group, one data stream is transmitted to one node exclusively (unicast transmission) and one data stream is transmitted to the other N_{ l }  1 nodes (multicast transmission). In each BC phase, the unicasted data stream is fixed and is transmitted to a different node in the group. Consequently, the multicasted data stream has to be changed in each BC phase to ensure that each node in each group receives all data streams of the other nodes in its group within P phases. Compared to the unicasting strategy, intragroup interference in each BC phase is reduced since only two data streams are transmitted simultaneously.
The procedure can be described as follows. For each group l, the RS chooses one data stream out of N_{ l } data streams. This data stream will be unicasted to different nodes in different BC phases. Therefore, in each BC phase, to ensure that each node receives the N_{ l }  1 data streams from the other N_{ l }  1 nodes, the multicasted data stream is the transmitted data stream of the node who will receive the unicasted data stream. In the following, we derive the mathematical formulation of the procedure for hybrid uni/multicasting.
The relationships in (2) and (3) are defined after choosing the data stream to be unicasted for group l, , which remains the same in all N_{ l } 1 BC phases. In the p th phase, node , whose data stream is multicasted by the RS, receives the unicasted data stream from . The other nodes, r_{ l }, , receive the data stream from node which is multicasted by the RS to these N_{ l } 1 nodes. The multicasted data stream is changed in every BC phase as defined in Equation (3).
Using hybrid uni/multicasting strategy, the nodes need to know which data stream is unicasted and which data stream is multicasted by the RS in the p th phase. However, given (2) and (3), and by choosing the unicasted data stream from the node with the lowest index, that is, , there is no signalling effort needed. The RS is then multicasting the data streams in the P  1 BC phases starting from the lowest index in the set . In case of onepair twoway relaying and multiuser twoway relaying, the hybrid uni/multicasting strategy is the same as the unicasting strategy. The proposed hybrid uni/multicasting strategy is a generalisation of the work in [3, 10] for L = 1 and N_{1} = 2, and in [15] for L > 1 and N_{ l } = 2, ∀l. Figure 1b shows an example of the proposed hybrid uni/multicasting strategy for MGMW relaying when L = 2 and N_{1} = N_{2} = 3 nodes.
3) Multicasting Strategy
Using multicasting strategy, the RS transmits only one data stream for each served group in each BC phase. The RS transmits , i.e., the superposition of the data streams of nodes Sv_{ l } , , and Sw_{ l } , , in the l th group, to all N_{ l } nodes in group l. Prior to detection, each node has to cancel the self and knowninterference from each of the received data streams using the available side information. The side information can be its own transmitted data stream or a data stream which has been decoded in one of the previous BC phases. The general rule for selecting the two data streams for each group in each BC phase is that we have to ensure that the data stream of each node in each group is selected at least once.
Given the general rule, we may have several options to define the superposed data stream. However, each option will lead to different signaling requirement, since the RS has to inform the nodes about the indices v_{ l } and w_{ l } in each BC phase. In this work, we are interested in an option that does not need any signalling. Therefore, we extend the proposal in [20] to the case of MGMW relaying. We always choose v_{ l } = a_{ l } , and, consequently, w_{ l } is changed in each BC phase and is selected successively based on the relationship defined by w_{ l } = v_{ l } + p  1.
Using such relationships, node Sr_{ l } = a_{ l } always performs selfinterference cancellation, i.e., , to obtain all N_{ l }  1 data streams from other nodes t_{ l } = w_{ l } , . Regarding the other nodes , they have to be able to decode and, afterwards, use to perform knowninterference cancellation. Each node has to wait until its own data stream is superposed with , that is in the p th phase which leads to r_{ l } = (p + a_{ l } ) 1. In this corresponding p th phase, node r_{ l } = (p + a_{ l } )  1 performs selfinterference cancellation, i.e., to obtain . Afterwards, using , it performs knowninterference cancellation to obtain the other data stream from the other nodes t_{ l } = w_{ l } , received in the other BC phases. The proposed multicasting strategy is a generalisation of the work in [1, 22, 24] for L = 1 and N_{1} = 2, in [16] for L > 1 and N_{ l } = 2, ∀l, and in [20] for L = 1 and N_{1} ≥ 2 with analog network coding transmission. Figure 1c shows an example of MGMW relaying using the multicasting strategy when L = 2 and N_{1} = N_{2} = 3 nodes.
In this subsection, we have mathematically formulated the BC strategies. With the assumption of timeinvariant channels within P phases, for unicasting strategy, any other relationship that one may derive will lead to the same performance. The relationships given in Section IIA1 has an advantage that it does not require any signaling in the network. For hybrid uni/multicasting, one may also find other relationship than the relationships given in (2) and (3). However, with the timeinvariant channels assumption and given the same , the same performance will be obtained. In Section IIA2, we choose such that there will be no signaling in the network. This is suboptimum and one may improve the performance by exhaustively searching the best , ∀l. This will lead to a higher computational complexity and also requires signalling in the network since the RS needs to inform all nodes in group l about the chosen . Regarding multicasting strategy, in this work we propose v_{ l } = a_{ l } and w_{ l } = p + a_{ l } 1 which does not require any signaling in the network. This is suboptimum and one may improve the performance by exhaustively searching v_{ l } and w_{ l } which optimises the performance while fulfilling the general rule for multicasting strategy as described in Section IIA3. However, the computational complexity will be higher and there are signaling needed since the RS needs to inform the nodes in group l about v_{ l } and w_{ l } .
Note that all the relationships of parameters which are described in this subsection can also be directly applied for the case when the numbers of nodes are not equal in all groups. If the numbers of nodes are not equal in all groups, in each p th phase, the RS serves only the groups with N_{ l } ≥ p.
B. Generalised System Model
In this subsection, we explain the generalised system model for nonregenerative MGMW relaying which is valid for all BC strategies. In order to have nonregenerative MGMW relaying with a specific BC strategy, the relationship of p, r_{ l } , and t_{ l } as described in the previous subsection has to be set accordingly.
The overall channel matrix from the nodes to the RS is given by , with , , the channel vector between node Si and the RS. The channel coefficient h_{i, m}, , , follows . The vector is equal to (x_{0},..., x_{N1})^{T}, with x_{ i } the transmit signal of node Si that follows . The AWGN noise vector at the RS is denoted as with z_{RSm}following . In this work, we assume that all nodes transmit with fixed and equal transmit power.
Sum Rate Expression
In this section, we derive the sum rate expression of nonregenerative MGMW relaying. We start by defining the signal to interference and noise ratio (SINR) for the BC strategies. The achievable sum rate of MGMW relaying for both asymmetric and symmetric traffic are explained afterwards. The achievable sum rate is the sum of the rates received at all nodes. Asymmetric traffic refers to the situation where we allow all nodes in the group to transmit with different rates. Each node transmits with a rate that ensures that in the following N_{ l }  1 consecutive BC phases, all N_{ l }  1 nodes in its group can decode its data stream correctly. Symmetric traffic is when all nodes in group l have to transmit simultaneously with the same rate that is defined by the lowest rate among all possible link combinations of receive and transmit node (r_{ l } , t_{ l } ) in group l.
A. Signal to Interference and Noise Ratio
In the following, we explain and for each BC strategy.
1) Unicasting
with the set of the nodes' indices whose data streams have been decoded by receiving node r_{ l } in the previous BC phases.
2) Hybrid uni/multicasting
3) Multicasting
with {v_{ l } , w_{ l } } the indices of the two nodes in group l whose data streams are superposed by the RS in the p th phase.
with the set of the nodes' indices whose data streams have been decoded by receiving node r_{ l } in the previous BC phases.
B. Sum Rate for Asymmetric Traffic
The factor N_{ l }  1 is since in group l there are N_{ l }  1 nodes that receive the same data stream from a certain transmitting node t_{ l } . The scaling factor is due to P channel uses for MGMW relaying.
One important note regarding (27) is that by taking the minimum, we ensure each node Si transmits x_{ i } with the rate that can be decoded correctly by all other nodes in its group. Thus, knowing x_{ i } , all other nodes in the group can use it to perform knowninterference cancellation in a similar fashion to their selfinterference cancellation.
C. Sum Rate for Symmetric Traffic
Transceive Beamforming
In this section, first, we formulate the optimisation problem of finding the optimum transceive beamforming maximising the sum rate. Afterwards, we explain the design of generalised low complexity transceive beamforming algorithms for all BC strategies. It is assumed that perfect channel state information is available at the RS whose number of antennas is higher than or equal to the total number of the nodes, i.e., M ≥ N.
A. Sum Rate Maximisation
with , , and f(i, p) the receiving node index, which is a function of transmitting index i and BC phase index p, and depends on the applied BC strategy.
In this work, we assume that the transmit powers at the nodes are fixed and equal. In order to improve the sum rate, one could have the transmit powers at the nodes as variables to be optimised subject to a power constraint at each node. However, since there is only one MAC phase, one has to find the optimum transmit power at each node and, simulateneously, the transceive beamforming for all BC phases, i.e., G^{ p } , ∀p, . This joint optimisation problem would further increase the computational effort.
The optimisation problem in (30) is nonconvex and it requires high computational complexity to find the global optimum solution. Thus, in the following, we propose generalised low complexity transceive beamforming algorithms for all proposed BC strategies.
As mentioned in Section IIB and as seen in (30), the transceive beamforming G^{ p } depends on the BC strategy applied at the RS. In order to design generalised transceive beamforming for all BC strategies and to make the problem more tractable, we decouple G^{ p } into transmit beamforming , BCstrategydefining permutation matrix Π^{ p } and receive beamforming , such that .
In the following, we explain specially designed transceive beamforming for MGMW relaying. First, we explain the generalised linear transceive beamforming based on three different optimisation criteria, namely, MF, ZF, and MMSE. Afterwards, we explain the generalised BCstrategyaware (BCSA) transceive beamforming.
B. Linear Transceive Beamforming
BCstrategydefining permutation matrices of L = 2, N_{1} = N_{2} = 3
Π^{2}  Π^{3}  

Unicasting 


Uni/multicasting 


Multicasting 


1) Matched Filter
2) Zero Forcing
3) Minimisation of Mean Square Error
where the subscript (·)_{algorithm} refers to either MF, ZF, or MMSE.
C. BroadcastStrategyAware Transceive Beamforming
In the following, we explain the design of BCSA transceive beamforming. Based on the chosen BC strategy, the RS separates the data streams which are going to be transmitted in the BC phase and transmits to the corresponding node or nodes. For unicasting strategy, the RS separates all data streams and transmits each data stream to each corresponding receiving node. For hybrid uni/multicasting, for each group, the RS separates the unicasted data stream from the other data streams and transmits it to the corresponding node whose data stream is multicasted. The RS also separates the multicasted data stream from the other data streams and transmits it to the remaining nodes in the corresponding group. For multicasting strategy, the RS separates the superposition of two data streams from the others and transmits the superposed data stream to all nodes in the group.
In order to compute the transceive beamforming, we first compute the equivalent channels for receive beamforming and transmit beamforming. The equivalent channels are needed to ensure that there will be no interstream interference received at the unintended receiving node or nodes. In order to find the equivalent channel, BD as proposed in [17] can be applied. Several works have considered BD for separation of data streams, e.g., [16, 20, 29, 30]. In this work, we also consider regularised BD (RBD) as proposed in [23]. RBD avoids the drawbacks of BD which has a quite poor performance if the subspaces of the users channel matrices overlap significantly [23].
Equivalent channel
The corresponding and for all BC strategies
Receive beamforming  Transmit beamforming  

∀t_{ l } :  ∀r_{ l } :  
UC 



 

 

 

 
U/MC  

 

 

 
∀l :  ∀l :  
MC 




where F_{null} is the nullspace matrix which can be computed either using BD or RBD.
Using BD, with denoting the rank of matrix . The BD approach can be used directly for receive and transmit beamforming, since it only deals with the channels without considering the noise. Using RBD, however, the equivalent channels for receive and transmit beamforming need to be computed differently. RBD for transmit beamforming has been derived in [23] and in this work, we provide the derivation of RBD for receive beamforming in the appendix. Using RBD, with for transmit beamforming [23] and for receive beamforming, see appendix.
Having , we can now compute the receive beamforming and transmit beamforming. In the following, when computing the receive beamforming, and relate to and as defined in Table 2 for receive beamforming, while when computing transmit beamforming, and relate to and as defined in Table 2 for transmit beamforming.
In this work, we consider signal processing algorithms which do not deal with interference since is free from unwanted data streams, namely, MF, SVD, and semidefinite relaxation (SDR) of maximising the minimum SNR. MF and SVD for singlepair twoway relaying have been investigated in [3, 10]. The BDMF and BDSDR have been designed in [20] for singlegroup multiway relaying for multicasting strategy. BDSVD has been designed in [16] only for multiuser twoway relaying with multicasting strategy. In this work, BCSA transceive beamforming is designed for nonregenerative MGMW relaying for all proposed BC strategies. Due to the requirement to make generalised BCSA transceive beamforming also suitable for nonregenerative MGMW relaying with multicasting strategy, it has a slight difference to [3, 10, 16]. Using BCSA for multicasting strategy, for each group l, the RS has to transmit one data stream, which is a superposition of two data streams, to N_{ l } nodes in the group where N_{ l } can be any number higher than two. For that reason, in the design of receive beamforming using MF and SVD, we have to do a superposition of two data streams. This makes the proposed BCSA not a direct generalisation of [3, 10, 16]. However, for cases of onepair twoway relaying and multiuser twoway relaying, if the superposition is not performed, BCSA is a generalisation of [3, 10, 16].
where a vector of ones of length . superposes (adds) twodata streams from two nodes in each group for multicasting strategy. can be seen as receive power loading where the modulus operator  ·  is assumed to be applied elementwise and the mean function returns the mean of a vector.
with the transmit power loading. is a vector of ones with size . For multicasting strategy, replicates the superposed data stream times.
with the receive power loading.
with the transmit power loading.
Semidefinite Relaxation
Since in MGMW relaying all member nodes in each group exchange messages, we are also interested in a fair beamforming algorithm which aims at balancing the SNRs at the RS as well as at the receiving nodes in each group.
with the receive power loading.
Equation (60) is a nonconvex quadratically constrained quadratic program. A similar optimisation is also considered in [31]. It is proved to be NPhard in [31]. Nonetheless, it can be approximately solved using SDR techniques [31, 32]. We will not go further into this relaxation and the interested reader may find more detailed derivation in [20, 31, 32].
with the transmit power loading. Note that to compute the transmit beamforming with SDR, we assume that the information of the noise power at the nodes is available at the RS. Similar to (60), (62) can be approximately solved with semidefinite relaxation techniques using a solver such as SEDUMI [33].
where , , is the transmit beamforming as in (56), (59), or (63) given the equivalent channel of node r_{l}.
where , , and , , are the transmit beamforming as in (56), (59), or (63) given the equivalent channel of node and the equivalent channel of all other nodes in group l, , respectively.
where , , is the transmit beamforming as in (56), (59), or (63) given the equivalent channels of all nodes in group l.
Note that Π^{ p } is not the same for all BC strategies. For unicasting strategy, Π^{ p } is the same as for MF, ZF, and MMSE, where an example for L = 2, N_{1} = N_{1} = 3 is given in Table 1. For hybrid uni/multicasting strategy, Π^{ p } = I_{2L}and for multicasting strategy, Π^{ p } = I _{L}.
Simulation Results
In this section, the sum rate performance is analysed based on simulation results. We set , , and E_{RS} = 1. The channel coefficients are i.i.d. , i.e., Rayleigh fading. Hence, the SNR value is given by .
We consider three scenarios. The first two scenarios are the wellknown scenarios, namely, onepair twoway relaying and multiuser twoway relaying. We consider both scenarios to show that the proposed BC strategies and the generalised transceive beamforming designed in this work are valid for both wellknown scenarios. The third scenario is the twogroup multiway case, where each group consists of three nodes.
A. First Scenario: L = 1 and N_{1} = 2
B. Second Scenario: L = 2 and N_{1} = N_{2} = 2
C. Third Scenario: L = 2 and N_{1} = N_{2} = 3
Comparing Figures 6, 7, and 8, one can clearly see that BCSA transceive beamforming improves the sum rate performance compared to MF, ZF, and MMSE transceive beamforming, especially for multicasting strategy. For the multicasting strategy, only RBDSVD performs worse than ZF and MMSE. For the hybrid uni/multicasting strategy, BDMF performs similar to ZF, RBDMF performs similar to MMSE and both BDSDR and RBDSDR outperform MF, ZF, and MMSE. For the unicasting strategy, BDMF, BDSVD, and BDSDR perform similar to ZF, while RBDMF, RBDSVD, and RBDSDR perform similar to MMSE. The highest sum rate (especially in high SNR) is obtained by multicasting strategy with BCSA BDSDR and RBDSDR. Therefore, provided a suitable transceive beamforming is used which can exploit analog network coding, the sum rate of nonregenerative MGMW relaying can be improved.
Conclusion
In this paper, we consider nonregenerative MGMW relaying. A multiantenna RS assists L communication groups, where N_{ l } nodes in each group communicate to each other but not with other nodes in other groups. The number P of communication phases is equal to max_{ l }N_{ l } . Three BC strategies are proposed, namely, unicasting, hybrid uni/multicasting, and multicasting. We derive the sum rate expression for nonregenerative MGMW relaying for asymmetric and symmetric traffic. We address the optimum transceive beamforming maximising the sum rate of nonregenerative MGMW relaying. We design generalised low complexity suboptimum transceive beamforming for all BC strategies, namely, MF, ZF, MMSE, and BCSA transceive beamforming. It is shown that the performance of nonregenerative MGMW relaying depends on the BC strategy and the applied transceive beamforming. While multicasting strategy using BCSA SDR provides better sum rate performance compared to other strategies, however, if either MF, ZF, or MMSE are applied, multicasting strategy is outperformed by the other strategies.
Appendix
RBD for Receive Beamforming
with .
Declarations
Acknowledgements
The work of Aditya U. T. Amah is supported by the 'Excellence Initiative' of the German Federal and State Governments and the Graduate School of Computational Engineering, Technische Universität Darmstadt. The authors would like to thank the anonymous reviewers whose review comments are very helpful in improving this article.
Some parts of this paper have been presented at the IEEE ICASSP 2010, Dallas, USA, and IEEE WCNC 2010, Sydney, Australia.
Authors’ Affiliations
References
 Rankov B, Wittneben A: Spectral efficient protocols for halfduplex relay channels. IEEE Journal on Selected Areas in Communications 2007, 25(2):379389.View ArticleGoogle Scholar
 Oechtering T: Spectrally Efficient Bidirectional DecodeandForward Relaying for Wireless Networks. Ph.D dissertation, TU Berlin 2007.Google Scholar
 Unger T: Multiantenna twohop relaying for bidirectional transmission in wireless communication systems. Ph.D dissertation, TU Darmstadt 2009.Google Scholar
 Biglieri E, Calderbank R, Constantinides A, Goldsmith A, Poor HV: MIMO Wireless Communication. Cambridge University Press; 2007.View ArticleGoogle Scholar
 Tse D, Viswanath P: Fundamentals of Wireless Communication. Cambridge University Press; 2005.View ArticleGoogle Scholar
 Hammerström I, Kuhn M, Esli C, Zhao J, Wittneben A, Bauch G: MIMO twoway relaying with transmit CSI at the relay. Proc IEEE Signal Processing Advances in Wireless Communications, Helsinki 2007, 15.Google Scholar
 Oechtering TJ, Wyrembelski RF, Boche H: Multiantenna bidirectional broadcast channels  optimal transmit strategies. IEEE Transactions on Signal Processing 2009, 57(5):19481958.MathSciNetView ArticleGoogle Scholar
 Oechtering TJ, Jorswieck EA, Wyrembelski RF, Boche H: On the optimal transmit strategy for the mimo bidirectional broadcast channel. IEEE Transactions on Communications 2009, 57(12):38173826.View ArticleGoogle Scholar
 Unger T, Klein A: Duplex schemes in multipleantenna twohop relaying. EURASIP Journal on Advances in Signal Processing 2008., 2008: Article ID 128592Google Scholar
 Liang YC, Zhang R: Optimal analogue relaying with multiantennas for physical layer network coding. Proc IEEE International Conference on Communications, Beijing 2008, 38933897.Google Scholar
 Zhang R, Liang YC, Chai CC, Cui S.: Optimal beamforming for twoway multiantenna relay channel with analogue network coding. IEEE Journal on Selected Areas in Communications 2009, 27(5):699712.View ArticleGoogle Scholar
 Chen M, Yener A: Multiuser twoway relaying for interference limited systems. Proc IEEE International Conference on Communications, Beijing 2008, 38833887.Google Scholar
 Esli C, Wittneben A: One and twoway decodeandforward relaying for wireless multiuser mimo networks. Proc IEEE Global Communications Conference, New Orleans 2008, 16.Google Scholar
 Amah AUT, Klein A, Silva YCB., Fernekeß A: Multigroup multicast beamforming for multiuser twoway relaying. Proc International ITG Workshop on Smart Antennas, Berlin 2009.Google Scholar
 Joung J, Sayed AH: Multiuser twoway amplifyandforward relay processing and power control methods for beamforming systems. IEEE Transactions on Signal Processing 2010, 58(3):18331846.MathSciNetView ArticleGoogle Scholar
 Yilmaz E, Zakhour R, Gesbert D, Knopp R: Multipair twoway relay channel with multiple antenna relay station. Proc IEEE International Conference on Communications, Cape Town 2010.Google Scholar
 Spencer QH, Swindlehurst AL, Haardt M: eroforcing methods for downlink spatial multiplexing in multiuser MIMO channels. IEEE Transaction on Signal Processing 2004, 52: 461471. 10.1109/TSP.2003.821107MathSciNetView ArticleGoogle Scholar
 Gündüz D, Yener A, Goldsmith A, Poor HV: Multiway relay channel. Proc IEEE International Symposium on Information Theory, Seoul 2009.Google Scholar
 Simoens S: Cooperative MIMO Communications, Information Theoretical Limits and Practical Coding Strategies. Ph.D dissertation, TU Catalonia (UPC) 2009.Google Scholar
 Amah AUT, Klein A: Beamformingbased physical layer network coding for nonregenerative multiway relaying. EURASIP Journal on Wireless Communications and Networking, Special Issue on Physical Layer Network Coding for Wireless Cooperative Networks 2010., 2010: Article ID 521571Google Scholar
 A transceive strategy for regenerative multiantenna multiway relaying Proc. IEEE International Workshop on Computational Advances in MultiSensor Adaptive Processing, Aruba 2009.Google Scholar
 Katti S, Gollakota S, Katabi D: Embracing wireless interference: analog network coding. Proc ACM Special Interest Group on Data Communication, Kyoto 2007, 397408.Google Scholar
 Stankovic V, Haardt M: Generalized design of multiuser mimo precoding matrices. IEEE Transactions on Wireless Communications 2008, 7: 953961.View ArticleGoogle Scholar
 Popovski P, Yomo H: Wireless network coding by amplify and forward for bidirectional traffic flows. IEEE Communications Letters 2007, 11(1):1618.View ArticleGoogle Scholar
 Nossek JA, Joham M, Utschick W: Transmit processing in mimo wireless systems. Proc IEEE International Symposium on Emerging Technologies, Shanghai 2004.Google Scholar
 Joham M: Optimization of linear and nonlinear transmit signal processing. Ph.D dissertation, TU München 2004.Google Scholar
 Joham M, Kusume K, Gzara MhH, Utschick W, Nossek JA: Transmit wiener filter for downlink of tdddscdma systems. Proc IEEE International Symposium on SpreadSpectrum Techniques and Applications 2002.Google Scholar
 Joham M, Utschick W, Nossek JA: Linear transmit processing in mimo communications systems. IEEE Transactions on Signal Processing 2005, 53(8):27002712.MathSciNetView ArticleGoogle Scholar
 Silva YCB: Adaptive beamforming and power allocation in multicarrier multicast wireless network. Ph.D dissertation, TU Darmstadt 2008.Google Scholar
 Silva YCB, Klein A: Linear transmit beamforming techniques for the multigroup multicast scenario. IEEE Transactions on Vehicular Technology 2009, 58: 43534367.View ArticleGoogle Scholar
 Sidiropoulos ND, Davidson TN, Luo ZQ: Transmit beamforming for physicallayer multicasting. IEEE Transaction on Signal Processing 2006, 54: 22392251.View ArticleGoogle Scholar
 Karipidis E, Sidiropoulos ND, Luo ZQ: Quality of service and maxmin fair transmit beamforming to multiple cochannel multicast groups. IEEE Transaction on Signal Processing 2008, 56(3):12681279.MathSciNetView ArticleGoogle Scholar
 Sturm JF: Using sedumi 1.02, a matlab toolbox for optimisation over symmetric cones. Optimisation Methods and Software 1999, 1112: 625653.MathSciNetView ArticleGoogle Scholar
 Scaglione A, Stoica P, Barbarosa S, Giannakis G, Sampath H: Optimal designs for spacetime linear precoders and decoders. IEEE Transactions on Signal Processing 2002, 50(5):10511064. 10.1109/78.995062View ArticleGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.