 Research
 Open Access
 Published:
Lowcomplexity QLQR decomposition based beamforming design for twoway MIMO relay networks
EURASIP Journal on Wireless Communications and Networking volume 2015, Article number: 246 (2015)
Abstract
In this paper, we investigate the optimization problem of joint source and relay beamforming matrices for a twoway amplifyandforward (AF) multiinput multioutput (MIMO) relay system. The system, consisting of two source nodes and two relay nodes, is considered, and the linear minimum meansquareerror (MMSE) is employed at both receivers. We assume individual relay power constraints and study an important design problem, a socalled determinant maximization (DM) problem. Since this DM problem is nonconvex, we consider an efficient iterative algorithm by using an MSE balancing result to obtain at least a locally optimal solution. The proposed algorithm is developed based on QL, QR, and Choleskey decompositions which differ in complexity and performance. Analytical and simulation results show that the proposed algorithm can significantly reduce computational complexity compared with their existing twoway relay systems and have equivalent biterrorrate (BER) performance to the singular value decomposition (SVD) based on a regular block diagonal (RBD) scheme.
Introduction
Recently, wireless relay networks have been the focus of a lot of research because the relaying transmission is a promising technique which can be applied to extend the coverage or increase the system capacity. Various cooperative relaying schemes have been proposed, such as amplifyandforward (AF) [1, 2], decodeandforward (DF) [3], denoiseandforward (DNF) [4], and compressandforward (CF) [5] cooperative relaying protocols. Among these approaches, an AF scheme is most widely used because it does not need to detect the transmitted signal. In addition, it requires less processing power at the relays compared to other schemes.
In a oneway relaying (OWR) approach, to completely exchange information between two base stations, four time slots are required in uplink (UL) and downlink (DL) communications, which leads to a loss of onehalf spectral resources [6]. In order to solve this problem, a twoway relaying approach has been considered in [7–9]. In a typical twoway relaying scheme, the communication is completed in two steps. First, the transmitters send their symbols to two relays, simultaneously. Upon receiving the signals, each relay processes them based on an efficient relaying scheme to produce new signals. After these processes, the processed signals are broadcasted to both receiver nodes.
Multiinput multioutput (MIMO) relay systems have been investigated in [10–13]. It is shown that, by employing multiple antennas at the transmitter and/or the receiver, one can significantly improve the transmission reliability by leveraging spatial diversity. Relay precoder design methods have been investigated in [14–16]. A problem in designing optimal beamforming vectors for multicasting is challenging due to its nonconvex nature. In [14], the authors propose a transceiver precoding scheme at the relay node by using zeroforcing (ZF) and MMSE criteria with certain antenna configurations. The information theoretic capacity of the multiantenna multicasting is studied in [15], along with the achievable rates using lower complexity transmission schemes, as the number of antennas or users goes to infinity. In [16], the authors propose an alternative method to characterize the capacity region of a twoway relay channel (TWRC) by applying the idea of rate profile.
Joint optimizations of the relay and source nodes for the MIMO TWRC have been studied in [9, 17]. In [9], the authors develop a unified framework for optimizing twoway linear nonregenerative MIMO relay systems and show that the optimal relay and source matrices have a general beamforming structure. The joint source node and relay precoding design for minimizing the mean squared error in a MIMO twoway relay (TWR) system is studied in [17].
Since singular value decomposition (SVD) and generalized SVD (GSVD) are widely used to find the orthogonal complement to solve an optimization problem [2, 9, 16, 33], but their computational complexity is extremely high. In order to reduce the complexity, the SVD can be replaced with a less complex QR decomposition [18] in this work. However, this approach leads to degrading the biterrorrate (BER) performance. In addition, it is difficult to realize in the TWRC. In this paper, we investigate the joint source and relay precoding matrix optimization for a twoway relay amplifyandforward relaying system where two source nodes and two relay nodes are equipped with multiple antennas. Also, in order to apply the QLQR decomposition to the TWRC, we design a threepart relay filter. Compared with existing works such as [9–14], the contributions of this paper can be summarized as follows. Firstly, we investigate a twoway MIMO relay system using the criteria which minimize an MSE of the signal waveform estimation for both two source nodes. We prove an optimal sumMSE solution can be obtained as the Wiener filter while the signaltonoise ratios (SNR) at both source nodes are equivalent [20], which leads to an MSE balancing result. Secondly, we propose a new cooperative scenario, i.e., the QLQR compared with the Choleskey decomposition which significantly reduces the computational complexity of the optimal design. In this proposed design, the channels of its left side are decomposed by the QL decomposition while those of its right side factorized by the QR decomposition. And the equivalent noise covariance is decomposed by the Choleskey decomposition. We also design the threepart relay filter, which is comprised of a left filter, a middle filter, and a right filter, to efficiently combine two source nodes and the relay nodes. By these approaches, the received signals at both two source nodes are able to be redeemed as either lower or upper triangular matrices. Stemming from one of the properties of triangular matrices such that their determinant is identical to the multiplication of their eigenvalues, we are able to straightforwardly solve the optimization problem as a determinant maximization problem. Also, we can obtain the BER performance equivalent to that of the singular value decompositionregular block diagonal (SVDRBD) scheme.
The rest of this paper is organized as follows. Section 2 describes a system model of the TWRC and raises a sumMSE problem. In Section 3, we propose an iterative QLQR algorithm and a joint optimal beamforming design. In Section 4, we discuss the computational complexity of an efficient channel model. The simulation results are presented to show the excellent performance of our proposed algorithm for the TWRC in Section 5. Section 6 concludes this paper.
Notations: A ^{∗}, A ^{T}, A ^{H}, E(A), tr(A), ℜ(A), and det(A) denote the conjugate, transpose, Hermitian transpose, statistical expectation, trace, real part, and determinate of a matrix A, respectively. An N×N identity matrix is denoted by I _{ N }.
System model and sumMSE
We consider a TWRC consisting of two source nodes, S _{1} and S _{2}, and two relay nodes, R _{1} and R _{2}, as shown in Fig. 1. The source and relay nodes are equipped with M and N antennas, respectively. We adopt the relay protocol with two time slots introduced in [14]. In the first time slot, the information vector \(\mathbf {x}_{i}\in {\mathbb {C}^{G\times {1}}}\), where G≤M, is linearly processed by a precoding matrix, \(\mathbf {V}_{i}\in {\mathbb {C}^{M\times {M}}}\), and then transmitted to the relay nodes. In this paper, we assume that each transmit antenna satisfies the unity transmission power constraint, which is \(\text {tr}\left \{\mathbf {x}_{i}\mathbf {x}^{\mathrm {H}}_{i}\right \}=\mathbf {I}_{M}\). The received signals at R _{ i }, i∈{1,2} can be expressed as
where \(\mathbf {y}_{R_{i}}\in {\mathbb {C}^{N\times 1}}, i\in \{1,2\}\), indicates the received signal vector, \(\mathbf {H}_{i,j}\in {\mathbb {C}^{N\times {M}}}, i,j\in \{1,2\}\), represents the channel matrix from source j to relay i, as shown in Fig. 1, \(\mathbf {s}_{i}=\mathbf {V}_{i}\mathbf {x}_{i}\in {\mathbb {C}^{M\times 1}}\) is the transmitted symbol vector from S _{ i } with a power constraint \(\text {tr}\left \{E\left (\mathbf {s}_{i}\mathbf {s}^{\mathrm {H}}_{i}\right)\right \}\leq {P_{i}}\), and \(\mathbf {n}_{R_{i}}\sim {CN\left (0,\sigma ^{2}_{R_{i}}\mathbf {I}_{N}\right)}\) represents the additive white Gaussian noise (AWGN) vector with zero mean and variance \(\sigma ^{2}_{R_{i}}\) at relay node i.
In the second time slot, the relay node R _{ i } linearly amplifies \(\mathbf {y}_{R_{i}}\) with an N×N matrix F _{ i } and then broadcasts the amplified signal vector \(\mathbf {x}_{R_{i}}\) to source nodes 1 and 2. The signal transmitted from relay node i can be expressed as
Using (1) and (2), the received signal vectors at S _{1} and S _{2} can be, respectively, written as
where \({\mathbf {H}}^{\mathrm {T}}_{i,j}\), i,j∈{1,2}, indicates the M×N channel matrix from the relay node i to the source node j and n _{ i }, i∈{1,2}, is an M×1 noise vector at S _{ i }.
We assume that the relay nodes perfectly know the channel state information (CSI) of H _{ i,j }. The relay node R _{ i } performs the optimizations of F _{ i } and V _{ i } and then transmits the information to the source nodes 1 and 2. Since source node i knows its own transmitted signal vector s _{ i } and full CSI, the selfinterference components in (3) can be efficiently canceled. The effective received signal vectors are given by
where \(\widetilde {\mathbf {H}}_{1}=\mathbf {H}^{\mathrm {T}}_{1,1}\mathbf {F}_{1}\mathbf {H}_{1,2}+ \mathbf {H}^{\mathrm {T}}_{2,1}\mathbf {F}_{2}\mathbf {H}_{2,2}\) and \(\widetilde {\mathbf {H}}_{2}=\mathbf {H}^{\mathrm {T}}_{1,2} \) \(\mathbf {F}_{1}\mathbf {H}_{1,1}+\mathbf {H}^{\mathrm {T}}_{2,2}\mathbf {F}_{2}\mathbf {H}_{2,1}\) are the equivalent MIMO channels seen at source nodes S _{1} and S _{2}, respectively. The vectors \(\widetilde {\mathbf {n}}_{1}=\mathbf {H}^{\mathrm {T}}_{1,1}\mathbf {F}_{1}\mathbf {n}_{R_{1}}+\mathbf {H}^{\mathrm {T}}_{2,1}\mathbf {F}_{2}\mathbf {n}_{R_{2}}+\mathbf {n}_{1}\) and \(\widetilde {\mathbf {n}}_{2}=\mathbf {H}^{\mathrm {T}}_{1,2}\mathbf {F}_{1}\mathbf {n}_{R_{1}}+ \mathbf {H}^{\mathrm {T}}_{2,2}\mathbf {F}_{2}\mathbf {n}_{R_{2}}+\mathbf {n}_{2}\) are the equivalent noises at source nodes S _{1} and S _{2}, respectively.
Due to the lower computational complexity, linear receivers are applied at source node i to retrieve the transmitted signals sent from the other nodes. The estimated signal waveform vector is given as \(\widehat {\mathbf {s}}_{\overline {i}}=\mathbf {W}^{\mathrm {H}}_{i}\widetilde {\mathbf {y}}_{i}\), where W _{ i } is an M×M weight matrix, with \(\overline {i}=2\) for i=1 and \(\overline {i}=1\) for i=2. From (4), the MSE matrix of the signal waveform estimation is denoted by \(\mathbf {MSE}_{\overline {i}}=\mathrm {E}\left [\left (\widehat {\mathbf {s}}_{i}{\mathbf {s}}_{i}\right) \left (\widehat {\mathbf {s}}_{i}{\mathbf {s}}_{i}\right)^{\mathrm {H}}\right ]\), which can be further written as
where \(\mathbf {C}_{n_{i}}=\mathbf {H}^{\mathrm {T}}_{i,i}\mathbf {F}_{i}\mathbf {F}^{\mathrm {H}}_{i} \mathbf {H}^{*}_{i,i}+\mathbf {H}^{\mathrm {T}}_{\overline {i},i}\mathbf {F}_{\overline {i}}\mathbf {F}^{\mathrm {H}}_{\overline {i}} \mathbf {H}^{*}_{\overline {i},i}+\mathbf {I}_{M}\) is the equivalent noise covariance. The sumMSE of the two source nodes in the proposed system model can be written as
Note that the sumMSE minimization criterion measures the overall transmission performance of both the DL and the UL. Since the two data streams are transmitted at different directions during the two time slots, M S E _{sum} is considered in the TWR network.
Joint source and relay beamforming design
In this section, we develop an iterative QLQR algorithm by using the MSE balancing result. The QLQR algorithm involves two steps, i.e., the linear receiver matrix optimization and the joint source and relay beamformer design.
Proposed optimal detector and optimization problem
We would like to find the jointly optimal beamforming vectors W _{ i }, V _{ i }, and F _{ i } such that the following sumMSE is minimized:
According to (2), we consider the following individual transmission power constraint at relay node:
where \(\mathbf {D}_{i}=\mathbf {H}_{i,i}\mathbf {V}_{i}\mathbf {V}^{\mathrm {H}}_{i}\mathbf {H}^{\mathrm {H}}_{i,i}+ \mathbf {H}_{i,\overline {i}}\mathbf {V}_{\overline {i}}\mathbf {V}^{\mathrm {H}}_{\overline {i}}\mathbf {H}^{\mathrm {H}}_{i,\overline {i}}+\mathbf {I}_{N}\) and the \(P_{R_{i}}\) denotes the individual power constraint at the relay node R _{ i }. The transmission power constraint at two source nodes can be written as
where P _{ i } is the available power at the ith source node. According to (8), (9), and (10), the joint optimization problem of the sumMSE can be formulated as follows:
It is shown in [20] that at the optimum, SNR_{1}=SNR_{2} holds true, thus leading to an SNR balancing result. Otherwise, if SNR_{1}>SNR_{2}, then P _{2} can be reduced to retain SNR_{1}=SNR_{2}, and this reduction of P _{2} will not violate the power constraint, i.e.,
In Fig. 2, we show two examples of the SNR regions with α _{1}=0.5 and α _{2}=0.3, where ω _{ i }∈[ 0,1] is a Lagrange multiplier weight value and α _{ i }∈[ 0,1] is an SNR weight value. We have assumed that the sum of SNR is a constant value. It is clear that the SNR region of α _{1} is larger than that of α _{2}. For further details, see [20]. As discussed in [21], the optimization problems have the performance matrix that are functions of SNR, namely the MSE at the output of a linearMMSE (LMMSE) filter of each user:
By these two approaches, the maxmin optimization problem in (11) can be efficiently written as
Since the optimization problem (14)–(15) is nonconvex, it is difficult to obtain the globally optimal solution. In this paper, we present a locally optimal solution of the joint optimization problem over W _{ i }, V _{ i }, and F _{ i }, where i=1,2, which can be solved by three stages, i.e., (1) the linear receiver weighted matrices are optimized with the fixed source precoding matrix V _{ i } and relay amplifying matrices F _{ i } (W _{ i } is not in constraint (15)). (2) With given W _{ i } and fixed F _{ i }, update V _{ i }. (3) With given W _{ i } and V _{ i }, obtain suboptimal F _{ i } to solve (14).
Lemma 1.
For any fixed V _{ i } and F _{ i }, the minimization problems in (14) are convex quadratic problems and the optimal W _{ i } can be obtained as the Wiener filter [22] which is used to decode s _{ i } shown as follows:
Proof.
For source node i, the MSE can be further expressed as
Based on (17), the derivation of an optimal MSE detection matrix \(\mathbf {W}^{\text {opt}}_{i}\) is equivalent to solving the following equation [23]:
Then, we may obtain the closedform solution of W _{ i }, which is
This completes the proof.
With the optimal \(\mathbf {W}^{o}_{1}\) fixed, the outer minimization problem in (14) can be rewritten as
where \(\mathbf {MSE}^{o}_{i}\) is the MSE matrix using \(\mathbf {W}^{o}_{i}\). By substituting (16) into (6), we have
Note that the matrix inversion lemma is used to obtain (21).
Joint optimal source and relay beamforming matrices design and iterative algorithm
In this section, we focus on the source and relay beamforming matrices design and develop an iterative algorithm which is suboptimal for the general case but has a much lower computational complexity. For the fixed F _{ i }, the source precoding matrix V _{ i } is optimized by solving the following problem:
where \(\mathbf {\Phi }_{i}=\mathbf {\widetilde {H}}^{\mathrm {H}}_{i} \mathbf {\widehat {C}}^{1}_{n_{i}} \mathbf {\widetilde {H}}_{i}\), \(\mathbf {\widehat {C}}^{1}_{n_{i}}=\left (\mathbf {\widetilde {n}}_{i}\right)^{\mathrm {H}} \mathbf {\widetilde {n}}_{i}\), \(\mathbf {\Psi }_{i}=\mathbf {H}^{\mathrm {H}}_{i,i}\mathbf {F}^{\mathrm {H}}_{i}\) \(\mathbf {F}_{i} \mathbf {H}_{i,i}+\mathbf {H}^{\mathrm {H}}_{\overline {i},i}\mathbf {F}^{\mathrm {H}}_{\overline {i}}\mathbf {F}_{\overline {i}}\mathbf {H}_{\overline {i},i}\).
The Lagrangian function associated with the problem (22) is given by
where μ _{ i }≥0 is the Lagrange multiplier.
Case 1: When μ _{ i }=0, making the derivative of L _{ V } with respect to \(\mathbf {V}_{\overline {i}}\) be zero, we obtain
Since \(\mathbf {V}_{\overline {i}}\) and Φ _{ i } are nonsingular matrices, (24) can be represented as
Simplifying (25), I _{ M }>0 and \(\mathbf {V}^{\mathrm {H}}_{\overline {i}}\mathbf {\Phi }_{i}\mathbf {V}_{\overline {i}}\geq 0\). Consequently, in Case 1, the optimal solution is not existent.
Case 2: When μ _{ i }>0, we rewrite the Lagrangian function as
where \(\mathbf {\Upsilon }_{\overline {i}}\mathbf {\Upsilon }_{\overline {i}}^{\mathrm {H}}=\mu _{2} \mathbf {I}_{M}+\mu _{4}\mathbf {\Psi }_{\overline {i}}\). We obtain the derivative of L _{ V } as
Since \(\mathbf {V}^{\mathrm {H}}_{\overline {i}}\) and Φ _{ i } are nonsingular matrices, multiply both sides by \(\left (\mathbf {V}^{\mathrm {H}}_{\overline {i}}\right)^{1}\) and \(\mathbf {\Phi }_{i}^{1}\); we have
Since Φ _{ i } is Hermitian and positive definite, we apply the Choleskey decomposition of \(\mathbf {\Phi }_{i}=\mathbf {\Omega }_{i}^{\mathrm {H}}\mathbf {\Omega }_{i}\), where Ω _{ i } is a lower triangular matrix. Consequently, we represent (28) as
By the definition of the matrix identity as
for any M×N matrix X, we can rewrite (29) as
Solving (31) for \(\mathbf {V}_{\overline {i}}\), we have
where \(\nabla _{i}=\left (\mathbf {\Upsilon }_{\overline {i}}^{\mathrm {H}}\mathbf {\Omega }_{i}\right)^{\frac {1}{2}}\).
Figure 3 shows our proposed relay filter design, which forwards the received signal (input) from S _{1} amplified by a left filter (LF) matrix F _{ L,i } and the signal from S _{2} amplified by a right filter (RF) matrix F _{ R,i } to a center filter (CF) F _{ D,i }. F _{ D,i } amplifies the outputs from the LF matrix F _{ L,i } and the RF matrix F _{ R,i } (i∈{1,2} denotes relay node i) and forwards them to S _{1} and S _{2} (output).^{1}
Lemma 2.
The optimal relay filter constructive of F _{ L }, F _{ R }, and F _{ D } matrices, i.e., for R _{1} and R _{2}, can be designed as
where Q _{ L,i } and Q _{ R,i } for i=1,2 are the unitary matrices which relate to QL and QR decompositions for the dependent channel coefficients.
Proof.
For F _{ L,i } and F _{ R,i }, the proof is similar to Theorem 3.1 in [24]. For F _{ D,i }, using Theorem 2 in [9], the structure of F _{ D,i } is optimal for the two cases of
Case a: If N=2, the optimal F _{ D,i } is a diagonal matrix given as
If N=2a, a=2,3,…, the optimal F _{ D,i } is a 2×2 block diagonal matrix given as
where F _{ D,i,1} and F _{ D,i,2} are \(\frac {N}{2}\times \frac {N}{2}\) matrices.
Case b: The optimal F _{ D,i } is defined as
Discussion 1: In Case b, since \(\mathbf {F}^{\star }_{D,i}\) is optimal, but the computational complexity will be considerably increased compared with Case a, so we exclude it.
For Case a, Before we develop a numerical method to solve vector F _{ D,i }, let us have some insights into the structure of this suboptimal relay beamforming matrix. To simplify relay beamforming matrix F _{ D,i }, we introduce the following properties:
Property 1: The statistical behavior of a unitary matrix U remains unchanged when multiplied by any unitary matrix T independent of U. In other words, T U has the same distribution as U, i.e., in (33),
Now, let us introduce the following Q L decomposition:
where Q _{ L,i } for i=1,2 is a unitary matrix with a dimension \({\mathbb {C}^{N\times {N}}}\) and \(\left \{\mathbf {L}_{1}, \mathbf {L}_{2}\right \}\in {\mathbb {C}^{N\times {M}}}\) are lower triangular matrices.
Similarly, let us introduce another decomposition, namely Q R decomposition, as
where \(\mathbf {Q}_{R,i}\in {\mathbb {C}^{N\times {M}}}\) for i=1,2 is a unitary matrix and \(\left \{\mathbf {R}_{1}, \mathbf {R}_{2}\right \} \in {\mathbb {C}^{M\times {M}}}\) are upper triangular matrices. Substituting (38) and (39) back into (4), we can get equivalent received signals shown as
where \(\mathbf {\widehat {H}}_{i}=\mathbf {L}^{\mathrm {T}}_{i}\mathbf {F}_{D,i} \mathbf {R}_{i}+\mathbf {L}^{\mathrm {T}}_{\overline {i}}\mathbf {F}_{D,\overline {i}}\mathbf {R}_{\overline {i}}\) and \(\widehat {\mathbf {n}}_{i}=\mathbf {L}^{\mathrm {T}}_{i}\mathbf {F}_{D,i}\mathbf {n}_{R_{i}}+ \mathbf {L}^{\mathrm {T}}_{\overline {i}}\mathbf {F}_{D,\overline {i}}\mathbf {n}_{R_{\overline {i}}}+\mathbf {n}_{\overline {i}}\) are efficient channel and noise coefficients; obtained from the covariance of \(\mathbf {\widehat {C}}_{i}\), we have
For fixed V _{ i }, using (40) and Property 1, the optimal problem (20) becomes
where we have employed the principle min(a)=max (a ^{−1}), for a≠0. By using the lemma tr(A + B)=tr(A)+tr(B), (42) can be represented as
Since the matrix \(\mathbf {\widehat {C}}_{i}\) is Hermitian and positive definite, we can decompose this matrix using the Cholesky factorization as
where Ξ _{ i } denotes a lower triangular matrix. By substituting (45) back into (44), we can simply rewrite the optimal problem as
where \(\overset {a}{=}\) denotes n has nothing to do with the maximum solution and \(\mathbf {B}_{i}=\mathbf {\widehat {H}}^{\mathrm {H}}_{i}\mathbf {\Xi }^{1}_{i}\). Therefore, the optimal problem can be represented as the determinant maximization of \(\mathbf {B}_{i}^{2}\) [29].
In Case a, since F _{ D,i } is the block diagonal matrix, its determinant can be written as
Let A, B, C, and D be an \(\frac {N}{4}\times \frac {N}{4}\) matrix. We can define detF _{ D,i,i }, for i∈1,2, as
where I stands for an \(\frac {N}{4}\times \frac {N}{4}\) identity matrix. In (48), to obtain maximum detF _{ D,i,i }, we should minimize BA ^{−1} D. Let us introduce the SVD of B, A, and D as
where U _{ i }, Λ _{ i }, i∈{A,B,D}, are the unitary matrices and Σ _{ i } is an \(\frac {N}{4}\times \frac {N}{4}\) diagonal matrix. Substituting (49) back into BA ^{−1} D, we have
where b _{ i }, d _{ i }, and a _{ i } are the diagonal elements of Σ _{ B }, Σ _{ D }, and Σ _{ A }, respectively. To simplify our discussion, we assume that F _{ D,i,i } is a semipositive matrix; thus, we have the minimum solution as b _{ i } d _{ i }=0. Interestingly, if both b _{ i } and d _{ i } are 0, F _{ D,i,i } is a diagonal matrix. Otherwise, it is a lower/upper triangular matrix. In addition, for S _{1}, the equivalent channel \(\widehat {\mathbf {H}}_{1}\), since the terms \(\mathbf {L}^{\mathrm {T}}_{1}\), \(\mathbf {L}^{\mathrm {T}}_{2}\), R _{1}, and R _{2} are upper triangular matrices, the optimal F _{ D,i } should be an upper triangular matrix. Since the equivalent channel \(\widehat {\mathbf {H}}_{2}\), L _{1}, L _{2}, \(\mathbf {R}^{\mathrm {T}}_{1}\), and \(\mathbf {R}^{\mathrm {T}}_{2}\) are lower triangular matrices for S _{2}, the optimal F _{ D,i } is a lower triangular matrix. Therefore, if and only if F _{ D,i } is a diagonal matrix, the sumMSE is optimal in our proposed method.
This completes the proof for Lemma 2.
Property 2: For any M×N rectangular matrices G and J, matrices A and B are lower/upper triangular matrices based on QR or QL decomposition of G and J. If a _{ i,i }+b _{ i,i }≠0, where a _{ i,i } and b _{ i,i } are diagonal elements of matrices A and B, respectively, we can easily obtain
Consequently, we have
where ς _{1}=l _{ i,m,m } f _{ D,i,m } r _{ i,m,m }, \(\varsigma _{\overline {i}}=l_{\overline {i},m,m}f_{D,\overline {i},m}r_{\overline {i},m,m}\), l _{ i,m,m }, f _{ D,i,m }, r _{ i,m,m }, \(l_{\overline {i},m,m}\), \(f_{D,\overline {i},m}\), and \(r_{\overline {i},m,m}\) are diagonal elements of L _{ i }, F _{ D,i }, R _{ i }, \(\mathbf {L}_{\overline {i}}\), \(\mathbf {F}_{D,\overline {i}}\), and \(\mathbf {R}_{\overline {i}}\), respectively. Since Ξ _{ i } and \(\mathbf {\Xi }_{i}^{1}\) are also lower triangular matrices, we have
where ξ _{ m } is the diagonal element of \(\mathbf {\Xi }^{1}_{i}\).
After introducing slack the variable τ _{ i }, the objective problem can be equivalently converted into the optimization one with respect to an individual relay power constraint, shown as follows:
From (54) to (56), it is easy to see that τ _{ i } is only dependent on the beamformer F _{ D,t } and with respect to (55) and (56). Thus, by using (53), we have
From (57), it is easy to follow that with fixed F _{ D,i }/\(\mathbf {F}_{D,\overline {i}}\), τ _{ i } is convex with regard to \(\mathbf {F}_{D,\overline {i}}\)/ F _{ D,i }. In summary, we outline the iterative beamforming design algorithm as follows (Q L−Q R A l g o r i t h m):
Clearly, Algorithm 1 will converge to a suboptimal solution as \(\tau ^{(n)}_{\text {max}}\tau ^{(n1)}_{\text {max}}\leq \epsilon \). Therefore, ε is initialized to be a small value and N _{max} is set to limit the number of iterations.
Discussion 2: Figure 4 displays two extended system models. One is the multipair scenario with two relay nodes and K pairs of source nodes. The other is a Z relay node scenario with two source nodes. In Fig. 4 a, each pair of sources and two relay nodes can be seen as a group. Since each pair of source nodes are independent of one another, we can design each relay node comprised of K RFs, LFs, and one CF. Therefore, the extended system model (a) can be classified as another version of our proposed system model with K parallel nodes. The objective problem can be expressed as
where \(\mathbf {MSE}^{(a)}_{\text {sum}}=\sum _{i=1}^{K}\text {det}\left (\mathbf {B}_{i}\right)^{2}+ \sum _{j=K+1}^{2K}\text {det}\left (\mathbf {B}_{j}\right)^{2}\) is the sumMSE of the multipair scenario. It is clear that (58) is a biconvex problem which is similar to (54)–(56) with different effective channel coefficients and can be solved by our proposed algorithm.
In Fig. 1 b, a TWRC consisting of two source nodes and L relay nodes is considered. Obviously, by employing the MSE balancing result, the objective of the extended system model (b) is to minimize the sumMSE, which is subject to the individual relay transmit power constraint, shown as
where \(\mathbf {MSE}_{t}=\left (\mathbf {W}^{\mathrm {H}}_{i}\widetilde {\mathbf {H}}_{t}\mathrm {I}_{M}\right) \left (\mathbf {W}^{\mathrm {H}}_{i}\widetilde {\mathbf {H}}_{t}\mathrm {I}_{M}\right)^{\mathrm {H}}+\mathbf {W}^{\mathrm {H}}_{i}\mathbf {C}_{n_{t}}\) W _{ i }, for t=1,2, \(\widetilde {\mathbf {H}}_{t}=\sum _{i=1}^{L}\mathbf {H}^{\mathrm {T}}_{t,i} \mathbf {F}_{i}\mathbf {H}_{\overline {t},i}\), and \(\mathbf {C}_{n_{t}}=\sum _{i=1}^{L} \mathbf {H}^{\mathrm {T}}_{t,i}\mathbf {F}_{i}\mathbf {F}^{\mathrm {H}}_{i}\mathbf {H}^{*}_{t,i}+\mathbf {I}_{M}\), is the equivalent noise covariance, for i=1,…,L. Due to the semiinfinite constraints at the relay node, the objective problem (59) is nonconvex. In this scenario, we consider a twostage solution where in the first step, the semiinfinite constraints are converted to linear matrix inequalities (LMI) and in the second step, we use our proposed iterative algorithm to solve it. By using the SLemma [28], the relay power constraint can be converted into the LMI version, we have
where vec(·) denotes to stack the columns of a matrix into a single vector. Now, the objective problem (59) becomes
In step 2, we use an iterative algorithm based on alternating convex search (ACS) to solve the resulting convex problem. The algorithm is almost the same as our proposed one which only converts [Algorithm 1, Steps 4–11] into “for fixed \(\mathbf {W}^{(n)}_{i}\), \(\mathbf {V}^{(n)}_{i}\) update \(\mathbf {F}_{i}^{(n)}\) via solving (61)”.
Computational complexity analysis
In this section, we measure the performance of the proposed QLQR scheme in terms of the computational complexity compared with existing algorithms by using the total number of floating point operations (FLOPs). A flop is defined as a real floating operation, i.e., a real addition, multiplication, and division. In [30], the authors show the computational complexity of the real Choleskey decomposition. For complex numbers, a multiplication followed by an addition needs eight FLOPs, which leads to four times its real computation. According to [31], the required number of FLOPs of each matrix is described as follows:

1.
Multiplication of m×n and n×p complex matrices: 8mnp−2mp;

2.
Multiplication of m×n and n×m complex matrices: 4nm×(m+1);

3.
SVD of an m×n(m≤n) complex matrix where only Σ is obtained: 32(mn ^{2}−n ^{3}/3);

4.
SVD of an m×n(m≤n) complex matrix where only Σ and Λ are obtained: 32(nm ^{2}+2m ^{3});

5.
SVD of an m×n(m≤n) complex matrix where U, Σ, and Λ are obtained: 8(4n ^{2} m+8nm ^{2}+9m ^{3});

6.
Inversion of an m×m real matrix using GaussJordan elimination: 2m ^{3}−2m ^{2}+m;

7.
Cholesky factorization of an m×m complex matrix: 8m ^{3}/3;

8.
QR or QL decomposition of an m×n conplex matrix \(16\left (n^{2}mnm^{2}+\frac {1}{3}m^{3}\right)\).
For the RBD method [32], the authors consider a linear MUMIMO precoding scheme for DL MIMO systems. For the nonregenerative MIMO relay systems [33], the authors investigate a precoding design for a threenode MIMO relay network. In [2], a relayaided system based on a quasiEVD channel is proposed. We compare the required number of FOLPs of our proposed method with conventional precoding algorithms, such as the RBD, the nonregenerative MIMO relay system, and the CDBD algorithm as shown in Tables 1, 2, 3, and 4, respectively, under the assumption that N _{ T }=N _{ R } and \(\overline {N}_{i}=N_{T}N_{i}\).
For instance, the (2,2,2)×6 case denotes a system with three users (K=3), where each user is equipped with two antennas (N _{ i }=2) and the total number of transmit antennas is six (N _{ T }=2×3=6). The required number of FLOPs of the QLQR algorithm, the RBD, the nonregenerative MIMO relay system, and the CDBD algorithm are counted as 33,530, 40,824, 45,306, and 34,638, respectively. From these results, we can see that the reduction in the number of FLOPs of our proposed precoding method is 17.87, 25.99, and 3.20 % on an individual basis compared to the RBD, the nonregenerative MIMO relay systems, and the CDBD algorithm. Thus, our proposed QLQR algorithm exhibits lower complexity than conventional algorithms. In addition, the complexity reduces as N _{ i } and N _{ T } increase with fixed K.
We summarize our calculation results of the required number of FLOPs of the alternative methods in Tables 1, 2, 3, and 4 and show them in Figs. 5 and 6. Figure 5 shows the computational complexity where N _{ i }=2 and a value of K varies. And Fig. 6 shows the computational complexity where K=4 and a value of N _{ i } varies. For the RBD method, the orthogonal complementary vector V _{ k,0} requires K times SVD operations. If only V _{ k,0} is obtained, it is not computationally efficient. In step 5, the efficient channel \(\mathbf {H}_{\text {eff}}=\mathbf {H}_{i}\mathbf {P}^{a}_{i}\) is decomposed by the SVD with a dimension R _{eff}×N _{ T }, where R _{eff} is the rank of H _{eff}. In the nonregenerative MIMO relay method and the CDBD algorithm, two SVD operations are performed for the channels from the source to the relay and from the relay to the destination, and then the efficient channel covariance matrix is measured. In the nonregenerative MIMO relay method, the authors compute A using the EVD, and then they diagonalize G. In the CDBD algorithm, the authors calculate \(\mathbf {V}^{a}_{i}\) by the SVD of \(\mathbf {H}^{\dag }_{\text {mse}}\), and then they structure \(\mathbf {V}^{b}_{i}\) by using the Choleskey decomposition.
In our proposed QLQR algorithm, we take advantage of QL and QR decompositions instead of the SVD operation, and then we compute an efficient channel as well as decompose a noise covariance matrix by the Choleskey decomposition. Finally, we calculate the determinant of \(\mathbf {B}^{2}_{i}\) to solve an optimization problem. Obviously, our proposed QLQR algorithm outperforms conventional algorithms in the light of the computational complexity.
Simulation results
In this section, we study the performance of the proposed QLQR algorithm for twoway MIMO relay networks. All the simulations are performed on the assumption that all the channel estimates are the Rayleigh fading channels, and they are independent and identically distributed (i.i.d.) complex Gaussian random variables. The noise variances \({\sigma ^{2}_{i}}\) are equally given as σ ^{2}. All the simulation results are averaged over 1000 channel trials.
In Fig. 7, we compare the sum mutual information (SMI) of various MUMIMO schemes where full CSI is known at each node. We set P _{1}=P _{2}=10 dB and M=1 with an equal power budget for the two relays. The negative SMI is adopted in [16] which can be defined as
In our proposed method, the SMI shown in the simulation results is calculated as \(2~\text {log}_{2}\mathbf {B}^{2}_{i}\) by using (45), (52), and (53). It can be observed that the proposed QLQR algorithm has the same SMI performance as an optimal solution in [16].
Figure 8 shows the performance of our proposed SMI performance versus the number of the relays, T, which is even. We consider a practical scenario with different relay power constraints and set P _{ R }=30 dB. It is clear that, for different values of P _{1} and P _{2}, a solution of our proposed QLQR algorithm shows better performance than a maxpower solution.
Figure 9 a, b exhibits the BER performance of the BD water filling, the RBD, the SVDRBD, and our proposed QLQR method, where the quadrature phase shift keying (QPSK) and 16 quadrature amplitude modulation (16QAM) are made use of. As pointed out in [35], the BER performance for a MIMO precoding system is actually determined by the energy of the transmitted signal. To simplify our discussion, we assume a=0. In the RBD, \(\text {det}\left (\overline {\mathbf {H}} \overline {\mathbf {H}}^{\mathrm {H}}\right)= \prod ^{m}_{i=1}{\lambda ^{2}_{i}}\), where \(\overline {\mathbf {H}}\in {\mathbb {C}^{N\times M}}\), for M<N, is an equivalent channel matrix with its eigenvalues λ _{ i }. In our proposed QLQR method, for source node S _{1}, we have \(\text {det}\left (\mathbf {\widehat {H}}_{1}\mathbf {\widehat {H}}^{\mathrm {H}}_{1}\right)=\prod ^{m}_{i=1}{\varsigma ^{2}_{1}}\). Under the stipulation that detF _{ D,i }=1, we are able to easily obtain λ _{ i }=ς _{ i }. Therefore, our proposed QLQR method has the same BER performance as that of the SVDRBD method.
Conclusions
This paper studies a joint optimization problem of an AF based on the MIMO TWRC, where two source nodes exchange their messages with two relay nodes. A relay filter is designed, which is able to efficiently join the source and the relay nodes. Our main contribution is that the optimal beamforming vectors can efficiently be computed using determinant maximization techniques through an iterative QLQR algorithm based on a MSE balancing method. Our proposed QLQR algorithm can significantly reduce the computational complexity and has an equivalent BER performance to that of the SVDBD algorithm.
Endnote
^{1}For example: For S _{1}, the equivalent channel can be written as \(\widetilde {\mathbf {H}}_{1}=\mathbf {H}^{\mathrm {T}}_{1,1}\mathbf {F}_{1} \mathbf {H}_{1,2}+\mathbf {H}^{\mathrm {T}}_{2,1}\mathbf {F}_{2}\mathbf {H}_{2,2}=\mathbf {H}^{\mathrm {T}}_{1,1}\mathbf {F}_{L,1} \mathbf {F}_{D,1}\mathbf {F}_{R,1}\mathbf {H}_{1,2}+\mathbf {H}^{\mathrm {T}}_{2,1}\mathbf {F}_{L,2}\mathbf {F}_{D,2}\mathbf {F}_{R,2}\mathbf {H}_{2,2}\). For S _{2}, the equivalent channel can be written as \(\widetilde {\mathbf {H}}_{2}= \mathbf {H}^{\mathrm {T}}_{1,2}\mathbf {F}_{1}\mathbf {H}_{1,1}+\mathbf {H}^{\mathrm {T}}_{2,2}\mathbf {F}_{2} \mathbf {H}_{2,1}=\mathbf {H}^{\mathrm {T}}_{1,2}\mathbf {F}_{R,1}\mathbf {F}_{D,1}\mathbf {F}_{L,1} \mathbf {H}_{1,1}+\mathbf {H}^{\mathrm {T}}_{2,1}\mathbf {F}_{R,2}\mathbf {F}_{D,2}\mathbf {F}_{L,2}\mathbf {H}_{2,2}\).
References
JN Laneman, DNC Tse, GW Wornell, Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Trans. Inf. Theory. 50(12), 3062–3080 (2004).
W Duan, W Song, SS Song, MH Lee, Precoding method interference management for quasiEVD channel. Sci. World J. 2014: (2014). Article ID 678578.
TM Cover, AAE Gamal, Capacity theorems for the relay channel. IEEE Trans. Inf. Theory. 25(5), 572–584 (1979).
Z Zhao, M Peng, Z Ding, W Wang, HH Chen, Denoiseandforward network coding for twoway relay MIMO systems. IEEE Trans. Veh. Technol. 63(2), 775–788 (2014).
S Simoens, O MunozMedina, J Vidal, Coso AD, Compressandforward cooperative MIMO relaying with full channel state information. IEEE Trans. Signal Pross. 58(2), 781–791 (2010).
B Rankov, A Wittneben, Spectral efficient protocols for halfduplex fading relay channels. IEEE J. Sel. Areas Commun. 25(2), 379–389 (2007).
T KoikeAkino, P Popovski, V Tarokh, Optimized constellations for twoway wireless relaying with physical network coding. IEEE J. Sel. Areas Commun. 27(5), 773–787 (2009).
S Xu, Y Hua, Optimal design of spatial sourceandrelay matrices for a nonregenerative twoway MIMO relay system. IEEE Trans. Wireless Commun. 5(10), 1645–1655 (2011).
Y Rong, Joint source and relay optimization for twoway linear nonregenerative MIMO relay communications. IEEE Trans. Signal Process. 60(12), 6533–6546 (2012).
KJ Lee, H Sung, E Park, I Lee, Joint optimization for one and twoway MIMO AF multiplerelay systems. IEEE Trans. Wireless Commun. 9(12), 3671–3681 (2010).
H Bolcskei, RU Nabar, O Oyman, AJ Paulraj, Capacity scaling laws in MIMO relay networks. IEEE Trans. Wireless Commun. 5(6), 1433–1444 (2006).
KJ Lee, KW Lee, H Sung, I Lzee, in Proc. IEEE Veh. Technol. Conf.Sumrate maximization for twoway MIMO amplifyandforward relaying systems (Barcelona, Spain, 2009), pp. 1–5.
F Roemer, M Haardt, Algebraic normmaximizing (ANOMAX) transmit strategy for twoway relaying with MIMO amplify and forward relays. IEEE Signal Process. Lett. 16(10), 909–912 (2009).
T Unger, A Klein, Duplex schemes in multiple antenna twohop relaying. EURASIP J. Adv. Signal Process. 2008: (2008). Article ID 128592.
N Jindal, Z Luo, in Proceedings of the IEEE International Symposium on Information Theory (ISIT 06). Capacity limits of multiple antenna multicast (Seattle, WA, USA, 2006), pp. 1841–1845.
R Zhang, YC Liang, CC Chai, S Cui, Optimal beamforming for twoway multiantenna relay channel with analogue network coding. IEEE J. Selected Areas Commun. 27(5), 699–712 (2009).
R Wang, M Tao, Joint source and relay precoding designs for MIMO twoway relaying based on MSE criterion. IEEE. Trans. Signal Process. 60(3), 1352–1365 (2012).
H Wang, L Li, L Song, X Gao, A linear precoding scheme for downlink multiuser MIMO precoding systems. IEEE Commun. Lett. 15(6), 653–655 (2011).
H Park, HJ Yang, J Chun, R Adve, A closedform power allocation and signal alignment for a diagonalized MIMO twoway relay channel with linear receivers. IEEE Trans. Signal Process. 60(11), 5948–5962 (2012).
V HavaryNassab, S Shahbazpanahi, A Grami, Optimal distributed beamforming for twoway relay networks. IEEE Trans. Signal Process. 58(3), 1238–1250 (2010).
P Viswanath, V Anantharam, DNC Tse, Optimal sequences, power control, (1999) and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers. IEEE Trans. Inf. Theory. 45(6), 1968–1983.
SM Kay, Fundamentals of Statistical Signal Processing: Estimation Theory (Prentice Hall, Englewood Cilffs, NJ, 1993).
DC Lay, Linear Algebra and Its Applications, 4th edition (University of Maryland Press, College Park, USA, 2012).
R Zhang, YC Liang, CC Chai, Cui S, Optimal beamforming for twoway multiantenna relay channel with analogue network coding. IEEE J. Sel. Areas Commun. 27(5), 699–712 (2009).
C Lameiro, J Va, I Santamara, Amplifyandforward strategies in the twoway relay channel with analog Tx–Rx beamforming. IEEE Trans. Veh. Technol. 62(2), 642–654 (2013).
Y Rong, Simplified Algorithms for optimizing multiuser multihop MIMO relay systems. IEEE Trans. Commun. 59(10), 2896–2904 (2011).
S Boyd, L Vandenberghe, Convex Optimization (Cambridge Univ. Press, Cambridge, UK, 2004).
Y Huang, D Palomar, S Zhang, Lorentzpositive maps and quadratic matrix inequalities with applications to robust MISO transmit beamforming. IEEE Trans. Signal Process. 61(5), 1121–1130 (2013).
A Benavoli, L Chisci, A Farina, Estimation of constrained parameters with guaranteed MSE improvement. IEEE Trans. Signal Process. 55(4), 1264–1274 (2007).
X Gao, L Li, P Zhang, L Song, G Zhang, Q Wang, H Tian, Lowcomplexity RBD precoding method for downlink of multiuser MIMO system. Electronics Lett.46(23), 1574–1576 (2010).
GH Golub, CF Van Loan, Matrix Computations, Johns Hopkins Studies in the Mathematical Sciences, 3rd edition (Johns Hopkins University Press, Baltimore, Md, USA, 1996).
H Wang, L Li, L Song, X Gao, A linear precoding scheme for downlink multiuser MIMO precoding systems. IEEE Commun. Lett. 15(6), 653–655 (2011).
R Mo, YH Chew, Precoder design for nonregenerative MIMO relay systems. IEEE Trans. Wireless Commun. 8(10), 5041–5049 (2009).
S Vishwanath, N Jindal, A Goldsmith, in Proceedings of the International Conference on Communications (ICC 02). On the capacity of multiple input multiple output broadcast channels (NY, USA, 2002), pp. 1444–1450.
CB Peel, BM Hochwald, AL Swindlehurst, A vectorperturbation technique for near capacity multiantenna multiuser communication—part I: channel inversion and regularization. IEEE Trans. Commun. 52(1), 195–202 (2005).
Acknowledgements
This work was supported by MEST 2015R1A2A1A05000977, NRF, South Korea, National Nature Science Foundation of China (61201249, 61359153, 61272495), the Brain Korea 21 PLUS Project, National Research Foundation of Korea, DHU Distinguished Young Professor Program (15D210402), Natural Science Foundation of Guangdong Province (S2011040004068), China, and the scientific research foundation for returned overseas Chinese Scholars, State Education Ministry.
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 distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Duan, W., Jiang, X., Guo, Y. et al. Lowcomplexity QLQR decomposition based beamforming design for twoway MIMO relay networks. J Wireless Com Network 2015, 246 (2015). https://doi.org/10.1186/s1363801504752
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s1363801504752
Keywords
 Twoway relay channel
 MIMO
 QLQR decomposition
 Choleskey decomposition
 Determinant maximization
 Amplifyandforward