Joint Source and Relay Design for Multi-user MIMO Non-regenerative Relay Networks with Direct Links
Abstract
In this paper, we investigate joint source precoding matrices and relay processing matrix design for multi-user multiple-input multiple-output (MU-MIMO) non-regenerative relay networks in the presence of the direct source-destination (S-D) links. We consider both capacity and mean-squared error (MSE) criterions subject to the distributed power constraints, which are nonconvex and apparently have no simple solutions. Therefore, we propose an optimal source precoding matrix structure based on the point-to-point MIMO channel technique, and a new relay processing matrix structure under the modified power constraint at relay node, based on which, a nested iterative algorithm of jointly optimizing sources precoding and relay processing is established. We show that the capacity based optimal source precoding matrices share the same structure with the MSE based ones. So does the optimal relay processing matrix. Simulation results demonstrate that the proposed algorithm outperforms the existing results.
Index Terms:
MU-MIMO, non-regenerative relay, precoding matrix, direct link.I Introduction
Recently, MIMO relay network has attracted considerable interest from both academic and industrial communities. It has been verified that wireless relay can increase coverage and capacity of the wireless networks [1]. Meanwhile, MIMO techniques can provide significant improvement for the spectral efficiency and link reliability in scattered environments because of its multiplexing and diversity gains [2]. A MIMO relay network, combining the relaying and MIMO techniques, can make use of both advantages to increase the data rate in the network edge and extend the network coverage. It is a promising technique for the next generation’s wireless communications.
The capacity of MIMO relay network has been extensively investigated in the literature [3, 4, 5, 6, 7]. Recent works on MIMO non-regenerative relay are focusing on how to design the source precoding matrix and relay processing matrix. For a single-user MIMO relay network, an optimal relay processing matrix which maximizes the end-to-end mutual information is designed in [8] and [9] independently, and the optimal structures of jointly designed source precoding matrix and relay processing matrix are derived in [10]. In [11] and [12], the relay processing matrix to minimize the mean-squared error (MSE) at the destination is developed. A unified framework to jointly optimize the source precoding matrix and the relay processing matrix is established in [13]. For a multi-user single-antenna relay network, the optimal relay processing is designed to maximize the system capacity [14, 15, 16]. In [17], the optimal source precoding matrices and relay processing matrix are developed in the downlink and uplink scenarios of an MU-MIMO relay network without considering S-D links. There are only a few works considering the direct S-D links. In [18] and [19], the optimal relay processing matrix is designed based on MSE criterion with and without the optimal source precoding matrix in the presence of direct links, respectively. However, for a relay network with direct S-D links, jointly optimizing the source precoding matrix and the relay processing matrix based on capacity or MSE is much difficult, especially for an MU-MIMO relay network.
In this paper, we consider an MU-MIMO non-regenerative relay network where each node is equipped with multiple antennas. We take the effect of S-D link into the joint optimization of the source precoding matrices and relay processing matrix, which is more complicated than the relatively simple case without considering S-D links [17]. To our best knowledge, there is no such work in the literature on the joint optimization of source precoding and relay processing for MU-MIMO non-regenerative relay networks with direct S-D links. Two major contributions of this paper over the conventional works are as follows:
-
•
We first introduce a general strategy to the joint design of source precoding matrices and relay processing matrix by transforming the network into a set of parallel scalar sub-systems just as a point-to-point MIMO channel under a relay modified power constraint, and show that the capacity based source precoding matrices and relay processing matrix respectively share the same structures with the MSE based ones.
-
•
A nested iterative algorithm is presented to solve the joint optimization of sources precoding and relay processing based on capacity and MSE respectively. Simulation results show that the proposed algorithm outperforms the existing methods.
The rest of this paper is organized as follows. Section II illustrates the system model. Section III presents the optimal structures of source precoding and relay processing, and a nested iterative algorithm to solve the joint optimization of sources precoding and relay processing. Section IV devotes to the simulation results. Finally, Section V concludes the paper.
Notations: Lower-case letter, boldface lower-case letter, and boldface upper-case letter denote scalar, vector, and matrix, respectively. , , , , , and denote expectation, trace, inverse, conjugate transpose, determinant, and Frobenius norm of a matrix, respectively. stands for the identity matrix of order . is a diagonal matrix with the th diagonal entry . is of base . represents the set of matrices over complex field, and means satisfying a circularly symmetric complex Gaussian distribution with mean and covariance . denotes .
II System Model

We consider a multiple access MIMO relay network with two source nodes (SNs), one relay node (RN) and one destination node (DN) as illustrated in Fig. 1, where the channel matrices have been shown. The numbers of antennas equipped at the SNs, RN and DN are , and , respectively. We assume that there is only two SNs and both SNs have the same number of antennas for simplicity. However, it is easy to be generalized to the scenario of multiple SNs with different numbers of antennas at each SN. In this paper, we consider a non-regenerative half-duplex relaying strategy applied at the RN to process the received signals. Thus, the transmission will take place in two phases. Suppose that perfect synchronization has been established between SN1 and SN2 prior to transmission, and both SN1 and SN2 transmit their independent messages to the RN and DN simultaneously during the first phase. Then the RN processes the received signals and forwards them to the DN during the second phase.
Let and denote the channel matrices of the th SN to RN, to DN, and RN to DN, respectively. Each entry of the channel matrices is assumed to be complex Gaussian variable with zero-mean and variance . Furthermore, all the channels involved are assumed to be quasi-static i.i.d. Rayleigh fading combining with large scale fading over a common narrow-band. Let and denote the precoding matrices for SN1 and SN2, respectively, which satisfy the power constraint . Let denote the relay processing matrix. Suppose that and are the noise vectors at RN and DN, respectively, and all noise are independent and identically distributed additive white Gaussian noise (AWGN) with zero-mean and unit variance. Then, the baseband signal vectors and received at the DN during the two consecutive phases can be expressed as follows:
(13) | |||||
where is assumed to be a zero-mean circularly symmetric complex Gaussian signal vector transmitted by the th SN and satisfies . Let Y, (), and N, shown in (13), denote the effective receive signal, effective channels and effective noise respectively. Then , where is the covariance matrix of the effective noise at the DN during the second phase.
III Optimal coordinates of Joint Source and Relay Design
In this section, the capacity and MSE for the MMSE detector with successive interference cancelation (SIC) at DN are analyzed. Then, we will exploit the optimal structures of source precoding and relay processing based on capacity and MSE respectively. Then a new algorithm on how to jointly optimize the sources precoding matrices and the relay processing matrix is proposed to maximize the capacity or minimize MSE of the entire network.
III-A Decoding Scheme
Conventional receivers such as matched filter (MF), zero-forcing (ZF), and MMSE decoder have been well studied in the previous works. The MF receiver has bad performance in the high SNR region, whereas the ZF produces a noise enhancement effect in the low SNR region. The MMSE detector with SIC has significant advantage over MF and ZF, which is information lossless and optimal [20]. Therefore, we consider the MMSE-SIC receiver at the DN and first decode the signal from SN2 without loss of generality. With the predetermined decoding order, the interference from SN2 to SN1 is virtually absent. To exploit the optimal structures of the matrices at the SNs, we first set up the RN with a fixed processing matrix without considering the power control. With the predetermined decoding order, the MMSE receive filter for SNi () is given as [21][22]:
(14) |
where Then, the MSE-matrix for SNi can be expressed as:
(15) | |||||
where and . Hence, the capacity for SNi is given as [20]
(16) |
III-B Optimal Precoding Matrices at SNs
In this subsection, we will introduce two lemmas, which will be used to exploit the optimal source precoding matrices and relay processing matrix, respectively.
Lemma 1
For a matrix , if matrix is a positive definite matrix, and , then is an Hermitian and positive semidefinite matrix (HPSDM).
Proof:
Since is a positive definite matrix, then is also a positive definite matrix. For any non-zero column vector x, let . Then we have , which implies that is an HPSDM. ∎
Lemma 2
If and are positive semidefinite matrices, then, , and, there is an , such that .
Proof:
See [23, page 269]. ∎
Since is positive definite matrix [24], according to Lemma 1, is HPSDM, which can be decomposed as:
(17) |
with unitary matrix , and non-negative diagonal matrices , which diagonal entries are in descending order. One of our main results of this paper is as below.
Propositon 1
For a given matrix111The relay power constraint problem will be deal with directly by an iterative algorithm later. and predetermined decoding order, the precoding matrix for SNi with the following canonical form
(18) |
is optimal with the water-filling power allocation policy (Policy-A) based on capacity or with the inverse water-filling power allocation policy (Policy-B) based on MSE, where:
(19a) | |||||
(20a) | |||||
(21a) |
Proof:
Substituting in (18) into (16) and (15), we respectively have:
According to KKT conditions [25], the Policy-A and Policy-B can make the capacity maximized and the MSE minimized, respectively, under the power control at SN1. This implies that is optimal. After deciding , and substituting the into , we can prove that is optimal. ∎
III-C A Nearly Optimal Processing Matrix at Relay
In this subsection, we first exploit the structure of relay processing matrix based on capacity for given and . Then, we show that the same structure matrix at RN can make the MSE of the entire network near to minimum with a different power allocation policy. The capacity of the entire network is [20]
where . According to the determinant expansion formula of the block matrix [26], (III-C) can be rewritten as:
(22) |
where
(23a) | |||||
(24a) | |||||
(25a) |
Let , which is independent of . Then, for given and , the problem on maximum capacity of the network can be formulated as
(26a) | |||||
(27a) |
To solve this problem, and find a nearly optimal processing matrix , due to , we first decompose based on eigenvalue decomposition, and then decompose based on singular value decomposition, i.e.,
where and are unitary matrices, and is an diagonal matrix, and is an diagonal matrix, which diagonal entries are in descending order.
From (26a), it is easy to verify that the optimal left canonical of is still given by [8]. But, it is intractable to find the optimal right canonical for the processing matrix , because there is no matrix which can achieve the diagonalization of both the capacity cost function (26a) and the power constraint (27a). But, we can modify the power constraint (27a) to another expression to find a matrix which has the desired property. Due to is a deterministic matrix for the fixed sources precoding matrices, (27a) can be rewritten as
(28) |
Since is a positive definite matrix, according to Lemma 1, in (25a) is also a positive semidefinite matrix. According to Lemma 2, the new power constraint at the RN can be expressed as
(29) |
where the exact value can be found by an iterative method. Thus, applying the results in [8][17], the processing matrix with the following structure can achieve the desired diagonalization for both capacity cost function (26a) and the new power constraint (29), and will be optimal [8]:
(30) |
where can be solved by optimization method [8].
Let . Substituting into (26a), and using the new power constraint (29) to replace (27a), the problem (26a) to find becomes
(31a) | |||||
(32a) |
Then, this optimization problem with respect to is similar to a problem solved in [8, 17]. Then we have
(33) | |||
(34) |
Next, we will show that the same structure matrix can also make the MSE of the entire network near to minimum with a different power allocation matrix for given and . Due to the total MSE can be expressed as:
(35) | |||||
where , , is a scalar factor. In (35), (a) come from the fact that noise is enhanced by using to replace in calculating , (b) follows from Woodbury identity and , and (c) follows from Lemma 2 and Schur complement to inverse a block matrix [26]. From (35), to minimize the is equivalent to minimize . Then, for given and , the optimal to minimize MSE is
(36a) | |||||
(37a) |
From the analysis above, the structure of in (30) can also achieve the diagonalization of the equation (36a), but, has a new power allocation matrix different from that of capacity based one. Then, substituting in (30) into (36a) to find the new , (36a) becomes
(38a) | |||||
(39a) |
where
This problem can be solved by numerical optimization methods [25].
III-D Iterative Algorithm
In the above discussion, with predetermined decoding order and fixed , and can be optimized; For and , can be optimized. Therefore, we propose an iterative algorithm to jointly optimize and based on capacity. Note that, the MSE based algorithm can be easily obtained as well. The convergence analysis of the proposed iterative algorithm is intractable. But, it can yield much better performance than the existing methods, which will be demonstrated by the simulation results in the next section.
In summary, we outline the nested iterative algorithm as follows:
-
Initial: ;
-
Inner Repeat : Update ;
-
– Compute based on ;
-
– Compute based on ;
-
Inner Until: Convergence.
IV Simulation Results





In this section, simulation results are carried out to verify the performance superiority of the proposed joint source-relay design scheme (JDS) for MU-MIMO relay network with direct links. We first compare the proposed scheme with other three schemes in terms of the ergodic capacity and the Cumulative Distribution Function (CDF) of instantaneous capacity of the MIMO relaying networks, and then compare the sum-MSE of the networks. The alternative schemes are:
-
(1)
Naive scheme (NAS): The source covariances are fixed to be scaled by the identity matrices and at SN1 and SN2, respectively, and the relay processing matrix is , where is a power control factor. The S-D links contribution is included.
-
(2)
Suboptimal scheme (SOS): This scheme is proposed in [17] for MU-MIMO relay network without considering S-D links in design. But, the S-D links contribution of capacity is included in the simulation for fair comparison. Note that this scheme is optimal for the scenario without considering the S-D links.
-
(3)
No-direct links scheme (NOD): This scheme is like SOS, but, without S-D links contribution.
Noting that both SOS and NOD have different power control polices to accommodate the capacity and MSE criterions. In the simulations, we consider a linear two-dimensional symmetric network geometry as depicted in Fig. 1, where both SNs are deployed at the same position, and the distance between SNs (or RN) and DN is set to be (or ), and . The channel gains are modeled as the combination of large scale fading (related to distance) and small scale fading (Rayleigh fading), and all channel matrices have i.i.d. entries, where is the distance between two nodes, and is the path loss exponent.
Fig. 2-4 are based on capacity criterion. Fig. 2 shows the CDF of instantaneous capacity for different power constraints, when all nodes positions are fixed. Fig. 3 shows the capacity of the network versus the power constraints, when all nodes positions are fixed. These two figures show that capacity offered by the proposed relaying scheme is better than both SOS and NOD schemes at all SNR regime, especially at high SNR regime. The naive scheme surpasses both SOS and NOD schemes at high SNR regime, which demonstrates that the direct S-D link should not be ignored in design. Fig. 4 shows the capacity of the network versus the distance () between SNs and RN, for fixed . It is clear that the capacity offered by the proposed scheme is better than those by the SOS, NAS and NOD schemes. NOD scheme is the worst performance scheme at any relay position at moderate and high SNR regimes.
V Conclusion
In this paper, we propose a optimal structure of the source precoding matrices and relay processing matrix for MU-MIMO non-regenerative relay network with direct S-D links based on capacity and MSE respectively. We show that the capacity based optimal source precoding matrices share the same structures with the MSE based ones. So does relay processing matrix. A nested iterative algorithm jointly optimizing the source precoding and relay processing is proposed. Simulation results show that the proposed algorithm provides better performance than the existing methods.
References
- [1] R. Pabst, B. H. Walke, D. C. Schultz, S. Mukherjee, H. Viswanathan, D. D. Falconer, and G. P. Fettweis, “Relay-based deployment concepts for wireless and mobile broadband radio,” IEEE Commun. Mag., vol. 42, no.9, pp. 80–89, Sept 2004.
- [2] L. Zheng and D. N. Tse, “Diversity and multiplexing: A fundamental tradeoff in multiple antenna channels,” IEEE Trans. Inf. Theory, vol. 8, no.1, pp. 2–25, August 2002.
- [3] B. Wang, J. Zhang, and A. Høst-Madsen, “On the capacity of MIMO relay channels,” IEEE Trans. Inf. Theory, vol. 51, no.1, pp. 29–43, Jan. 2005.
- [4] Z. Wang, W. Chen, F. Gao, and J. Li, “Capacity performance of relay beamformings for MIMO multirelay networks with imperfect - CSI at relays,” IEEE Trans. Veh. Tech., vol. 60, no.6, pp. 2608–2619, July 2011.
- [5] C. K. Lo, S. Vishwanath, and J. Robert W. Heath, “Rate bounds for MIMO relay channels using precoding,” in Proc. of the IEEE GLOBECOM 2005, St.Louis, MO, vol. 3, pp. 1172–1176, Nov. 2005.
- [6] H. Bölcskei, R. U. Nabar, Özgür Oyman, and A. J. Paulraj, “Capacity scaling laws in MIMO relay networks,” IEEE Trans. Inf. Theory, vol. 5, no.6, pp. 1143–1444, Jun. 2006.
- [7] H. Wan, W. Chen, and J. Ji, “Efficient linear transmission strategy for mimo relaying broadcast channels with direct links,” IEEE Wireless Commun. Lett., vol. 1, pp. 14–17, Feb. 2012.
- [8] X. Tang and Y. Hua, “Optimal design of non-regenerative MIMO wireless relays,” IEEE Trans. Wireless Commun., vol. 6, no.4, pp. 1398–1407, Apr. 2007.
- [9] O. M. noz Medina, J. Vidal, and A. Agustín, “Linear transceiver design in nonregenerative relays with channel state information,” IEEE Trans. Sig. Proc., vol. 55, no.6, pp. 2593–2604, Jun. 2007.
- [10] Z. Fang, Y. Hua, and J. C. Koshy, “Joint source and relay optimization for a non-regenerative MIMO relay,” in Proc. of the IEEE Workshop Sensor Array Multi-Channel Processing, Waltham, MA, 2006.
- [11] W. Guan and H. Luo, “Joint MMSE transceiver design in non-regenerative MIMO relays systems,” IEEE Commun. Lett., vol. 55, no.12, pp. 517–519, July. 2008.
- [12] A. S. Behbahani, R. Merched, and A. M. Eltawil, “Optimizations of a MIMO relay network,” IEEE Trans. Sig. Proc., vol. 56, no.10, pp. 5062–5073, Oct. 2008.
- [13] Y. Rong, X. Tang, and Y. Hua, “A unified framework for optimizing linear nonregenerative multicarrier MIMO relay communication systems,” IEEE Trans. Sig. Proc., vol. 57, no.12, pp. 4837–4851, Dec. 2009.
- [14] L. Weng and R. D. Murch, “Multi-user MIMO relay system with self-interference cancellation,” in Proc. of the IEEE Wireless Communications Networking Conf.(WCNC), pp. 958–962, 2007.
- [15] C.-B. Chae, T. Tang, J. Robert W. Heath, and S. Cho, “MIMO relaying with linear processing for multiuser transmission in fixed relay networks,” IEEE Trans. Sig. Proc., vol. 56, no.2, FEB 2008.
- [16] K. S. Gomadam and S. A. Jafar, “Duality of MIMO multiple access channel and broadcast channel with amplify-and-forward relays,” IEEE Trans. Commun., vol. 58, no.1, pp. 211–217, Jan 2010.
- [17] Y. Yu and Y. Hua, “Power allocation for a MIMO relay system with multiple-antenna users,” IEEE Trans. Sig. Proc., vol. 58, no.5, pp. 2823–2835, May 2010.
- [18] Y. Rong and F. Gao, “Optimal beamforming for non-regenerative MIMO relays with direct link,” IEEE Commun. Lett., vol. 13, no.12, pp. 926–928, Dec. 2009.
- [19] Y. Rong, “Optimal joint source and relay beamforming for MIMO relays with direct link,” IEEE Commun. Lett., vol. 14, no.5, pp. 390–392, May. 2010.
- [20] D. Tse and P. Viswanath, Fundamentals of Wireless Communications. Cambridge University Press, 2005.
- [21] S. M.Kay, Fundamental of Statistical Signal Processing: Estimation Theory. EngLewood Cilffs, NJ: Prentice Hall, 1993.
- [22] S. S. Christensen, R. agarwal, E. de Carvalho, and J. M.Cioffi, “Weighted sum-rate maximization using weighted MMSE for MIMO-BC beamforming design,” IEEE Trans. Wireless Commun., vol. 7, no.12, Dec. 2008.
- [23] E. H. Lieb and W. Thirring, Studies in Mathematical Physics, Essays in Honor of Valentine Bartmann. Princeton University Press, Princeton, NJ, USA,, 1976.
- [24] M. H.Hayes, Statistical Digital Signal Processing and Modeling. John Wiley & Sons, Inc., 1996.
- [25] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.
- [26] R. A. Horn and C. R. Johnson, Topics in Matrix Analysis. Cambridge University Press, 1991.