Advanced
Tensor-Based Channel Estimation Approach for One-Way Multi-Hop Relaying Communications
Tensor-Based Channel Estimation Approach for One-Way Multi-Hop Relaying Communications
KSII Transactions on Internet and Information Systems (TIIS). 2015. Dec, 9(12): 4967-4986
Copyright © 2015, Korean Society For Internet Information
  • Received : August 03, 2015
  • Accepted : October 07, 2015
  • Published : December 31, 2015
Download
PDF
e-PUB
PubReader
PPT
Export by style
Share
Article
Author
Metrics
Cited by
About the Authors
Shuangzhi Li
School of Information Engineering, Zhengzhou University, Zhengzhou, China
Xiaomin Mu
School of Information Engineering, Zhengzhou University, Zhengzhou, China
Xin Guo
School of Information Engineering, Zhengzhou University, Zhengzhou, China
Jing Yang
College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China
Jiankang Zhang
National Mobile Communications Research Laboratory, Southeast University, Nanjing, China

Abstract
Multi-hop relaying communications have great potentials in improving transmission performance by deploying relay nodes. The benefit is critically dependent on the accuracy of the channel state information (CSI) of all the transmitting links. However, the CSI has to be estimated. In this paper, we investigate the channel estimation problem in one-way multi-hop MIMO amplify-and-forward (AF) relay system, where both the two-hop and three-hop communication link exist. Traditional point-to-point MIMO channel estimation methods will result in error propagation in estimating relay links, and separately tackling the channel estimation issue of each link will lose the gain as part of channel matrices involved in multiple communication links. In order to exploit all the available gains, we develop a novel channel estimation model by structuring different communication links using the PARAFAC and PARATUCK2 tensor analysis. Furthermore, a two-stage fitting algorithm is derived to estimate all the channel matrices involved in the communication process. In particular, essential uniqueness is further discussed. Simulation results demonstrate the advantage and effectiveness of the proposed channel estimator.
Keywords
1. Introduction
M ulti-hop relaying communications have gained a lot of attention recently because of both its theoretical and practical importance in cooperative communication system [1] . As a fundamental technique to enable device-to-device communication, multi-hop relaying system is expected to realize high spectrum efficiency for next generation communication systems e.g., 5G wirelss systems [2 , 3] . Combined with the multiple-input and multiple-output (MIMO) techniques, the spectral efficiency of this promising technique can be further improved.
Referring to the strategies performed by the relay, relaying communications can be classified into various categories: amplify-and-forward (AF) relaying, decode-and-forward (DF) relaying, compressed-and-forward (CF) relaying and so on. In this work, we consider a multi-hop AF relaying system due to its simplicity and small system delay without additional decoding steps existed in DF relay system.
As its special cases, extensive methods have been proposed to analyze the performance of dual-hop MIMO AF relay system, including the optimal source and relay beamforming matrix [4 , 5] , optimal relay amplification matrix [6] , energy efficient [7] on the assumption that the perfect channel statement information (CSI) of all links have been acquired at the destination node. However, in practical communication system, the CSI has to be estimated by using different channel estimation methods. In [8 , 9] , an optimal transceiver design for multi-hop AF MIMO system under imperfect channel knowledge is studied, and it reveals that the achievable gain depends largely on the estimation accuracy of channel links in multi-hop system. And in [10] , the impact of channel estimation error on outage loss of the multiple antennas multiple relaying network is investigated, which indicates that the effect of the channel estimation error has a great influence on the system, especially at low-to-medium SNR. Unlike traditional point-to-point MIMO systems, the destination node in cooperative system has to estimate the CSI of all hops due to the limited computation ability in AF relays.
In [11] , least square (LS) based algorithm is proposed to estimate channel matrices of all links of one-way two-hop MIMO AF cooperative communication system. However, the channel estimation errors accumulate across the consecutive stages. For AF relay networks with single-antenna source, relay, and destination nodes, a modified transmitting frame is proposed in [12] for OFDM modulated relay system, which enables the relay node to have the ability of saving the pilot data as an ample to estimate the channel between the relay to the destination node, which in turn serves as known information to estimate the source-to-relay channel in a decision-directed (DD) way. However, this known channel information in this proposed DD algorithm is also the error-existing channel estimation value. A disintegrated channel estimation method has been presented in [13] , which implies that the relay node has to be equipped with a channel estimator. However, it is not realistic for a low complexity non-regenerative relay node.
Exploiting the estimation of relay to the destination node and/or relay to relay node is available, the channel estimation issue in cooperative system can be transformed to the traditional MIMO channel estimation problems. However, the inherent estimation error in the estimation of channel matrices will propagate when estimating the following links, which will finally deteriorate the whole performance. By taking advantage of their unique characteristics in digging the hidden structure in mixed samples, a few tensor-based channel estimation algorithms have shown to be efficient approaches for channel estimation and/or symbol detection in cooperative systems.
In [14 , 15] , a channel estimation algorithm with the aid of parallel factor (PARAFAC) model is investigated in one-way two-hop MIMO relay system, which allows the estimation of related channel matrices to be computed in a parallel way by resorting to tensor modeling. In addition, a unified PARAFAC received signal model for cooperative MIMO system is built based on which a blind receiver is proposed for jointly estimating the channel matrices and detecting the symbols [16] . Note that the works in [16] is on the condition that the same cluster has the same spatial signature, which is strict for the communication environment. The authors in [17] investigate the channel estimation algorithm for a two-way MIMO relay system. Since the algorithm in [17] exploits the channel reciprocity in a two-way relay system, its application in one-way MIMO relay systems is not straightforward. By introducing a space-time matrix at the source node, a PARAFAC-PARATUCK2 [18] tensor model is built for two-hop cooperative MIMO relay systems in [19] .
The common feature of the aforementioned works focus on the two-hop cooperative system, it may not be adapted to scenario that more relays are employed to further increase the coverage of communication. In [20] , the author proposes a trilinear coding structure of the MIMO AF system, which is capable of exploiting cooperative diversity by tensor-based signal processing. In [21] , the author establishes a PARATUCK2-based framework for three-hop cooperative communication system. However, only considering the link of one-way three-hop link will lose diversity gain in real communication scenario. In this paper, a more general tensor-based channel estimator of this system is considered, which provides the destination node with full knowledge of all channel matrices involved in the system. The main contributions of this paper can be summarized as follows:
  • - A more general one-way multi-hop MIMO AF relay system is considered in this paper, where the path loss factor is taken into account in this paper to analyze the achievable diversity gain of additional one-way two-hop links existing in the one-way three-hop link system.
  • - By resorting to the multi-way analysis tool, a unified tensor model is established and a combined PARAFAC/PARATUCK2 alternative least square (ALS) fitting algorithm is proposed to obtain the CSI of all involved links.
  • - With the initial estimation of channel matrices, a linear minimum mean square error (LMMSE) approach is further derived to enhance the channel estimator performance.
The rest of this paper is organized as follows. In Section 2, we give a brief overview of the system model. The detailed proposed channel estimation algorithm is presented in Section 3. In Section 4, simulation results are given to verify the effectiveness of the proposed algorithm. Conclusions are given in Section 5.
Notations and Properties : Scalars, column vectors, matrices, and tensors are denoted by lower-case ( a,b ,...) boldface lower-case ( a,b ,...), boldface capital ( A,B ,...), and calligraphic ( A,B ,...) letters, respectively. A :,:, k C I×J is the so-called front slice obtained by fixing the third dimension of a third-order tensor A C I×J×K . A T , A H , A -1 , A , A l . and A m represent matrix transposition, Hermitian transposition, matrix inverse, the Moore-Penrose pseudo inverse, the l -th row and the m -th column of A C L×M , respectively. The operator vec (⋅) forms a vector by stacking the columns of its matrix argument, while the unvec (⋅) operator is the inverse process of vec (⋅) to reshape a vector into a matrix. The operator diag (⋅) forms a diagonal matrix from its vector argument, and bd [ A 1 ,... A K ] forms a block-diagonal matrix with K matrix blocks. tr ( A ) and || A || F is the trace and the Frobenius norm of A , and D i ( A ) = diag ( vec ( A i .)) corresponds to the diagonal matrix with the i th row of A forming its diagonal. The Kronecker and the Khatri-Rao (column-wise Kronecker) matrix products are denoted by ⊗ and ◊, respectively. For A = [ A 1 ,..., A .R ] ∈ C I×R and B = [ B 1 ,..., B .R ] ∈ C J×R , we have
PPT Slide
Lager Image
We also use two following properties in this work:
PPT Slide
Lager Image
PPT Slide
Lager Image
2. System Model
We consider the one-way multi-hop MIMO AF relay system as illustrated in Fig. 1 where the direct link between the source node and the destination node is assumed to be negligible and hence ignored due to a large path loss, and the source node transmits information to the destination node with the aid of T MIMO AF relays, which should be chosen according to practical communication scenario, such as the path loss factor, the size of the cellular, etc.. Moreover, the relays operate in a half-duplex mode (i.e., each relay node does not receive and transmit signals simultaneously).
PPT Slide
Lager Image
One-way multi-hop MIMO AF relay system
We denote that the source node and the destination node are equipped with Ns ≥ 2 and Nd ≥ 2 antennas, respectively, while the i -th relay has Ni antennas, i = 1,2,⋯, T .
In the following, for simplicity, we mainly consider the one-way three-hop MIMO AF relay system to present our algorithm, i.e. T =2. But the generalization to the multi-hop MIMO relay system is just in a similar way. For example, we can firstly regard the cascade channel from the first relay node to the T -th relay node as a whole effective channel model H r1rT = H r1r2 G 2 H r2r3 G T -1 H rT -1 rT physical circumstance, like the methodology of using nested tensor model in [22, 23]. Through the proposed algorithm, H r1rT can be estimated in the first place; then, by means of corresponding fitting methods, the channel statement information contained in H r1rT can be further extracted.
Firstly, in order to derive the proposed channel estimators, we recast the formulation of the system model by resorting to tensor analysis. Let us define the overall training period as K time blocks, during which we assume the channels of all hops are quasi-static and each frame consists four phases. In k -th time block, the source node S transmits an orthogonal channel training sequences S 0 C Ns×L 0 ( L 0 Ns ) with
PPT Slide
Lager Image
SSIto the first relay node R 1 and the second relay node R 2 in the first phase. Then the received signal at the second relay node will be amplified with amplification matrix
PPT Slide
Lager Image
and forwarded to the destination node D in the second phase and R 1 keeps silent. In the third phase, R 1 will amplify its received signal with amplification matrix
PPT Slide
Lager Image
and transmit it to both R 2 and D . During the fourth phase, R 2 will transmit the data received in the previous phase to D with amplification matrix
PPT Slide
Lager Image
once again.
To sum up, there are five channel matrices in total to be estimated in the proposed system. Let us define the channel from source to R 1 and R 2 as H sr 1 C N 1 × Ns and H sr 2 C N 2 × Ns , respectively. From R 1 to R 2 and D are defined as H r 1 r 2 = ∈ C N 2× N 1 and H r 1 d C Nd × N 1 , and from R 2 to D is defined as H r 2 d C Nd × N 2 . We assume that H sr 1 , H r 1 r 2 , H r 2 d , H sr 2 and H r 1 d have complex Gaussian entries with zero means and variances of 1/ Ns , 1/ N 1 , 1/ N 2 , 1/( η ; 1 3 Ns ) and 1/( η ; 2 3 N 1 ), respectively. The variances are set to normalize the effect of the number of transmit antennas to the received signal-to-noise (SNR) ratio [14] . And the S - R 1 link, R 1 - R 2 link and R 2 - D link are assumed to have equal distance, i.e. dSR 1 = dR 1 R 2 = dR 2 D = d 0 . Assuming R 1 and R 2 lie between the source node and the destination node, and R 1 is closer to S than R 2 , while R 2 is closer to D , and the distance of S - R 2 link and the R 1 - D link are denoted by dSR 2 and dR 1 D , respectively. Then the normalized parameters η 1 = dSR 2 / d 0 and η 2 = dR 1 D / d 0 satisfy 1 ≤ η 1 ≤ 2 and 1 ≤ η 2 ≤ 2. With a path loss factor of 3, the above channel matrices can be constructed.
Thus the received signal at the destination node in phase 2 (i.e. S - R2 - D link), 3 (i.e. S - R1 - D link) and 4 (i.e. S - R1 - R2 - D link) of k -th time block can be given by:
PPT Slide
Lager Image
PPT Slide
Lager Image
PPT Slide
Lager Image
where
PPT Slide
Lager Image
are noise matrices at R 1 , R 2 and D corresponding to the k -th time block t -th transmission phase.
3. Proposed Tensor-based Channel Estimation Algorithm
In order to extract the channel matrices involved in the received signal model (4), (5) and (6), we resort to the tensor unfolding algorithm, which is useful when we want to isolate a matrix in a tensor model. In the following, we will present the core equations leading to the development of the proposed tensor-based channel estimator.
- 3.1 Model of Two-Hop Link
In this section, we first establish the tensor model of one-way two-hop (i.e. S - R1 - D and S - R2 - D ) communication link based on PARAFAC model [24] . For simplicity, the amplification matrix design pattern will be similar to the pattern in [21] , in which the rows of matrices E C K×N 1 and F C K×N 2 contain AF coefficients of R 1 and R 2 in different time blocks. More specifically, the amplification matrix at k -th time block at R 1 and R 2 are
PPT Slide
Lager Image
respectively. Note that, since our work is focused on channel estimation issues in multi-hop AF relaying system, the AF matrices G 1 and G 2 cannot be optimized at the channel estimation phases. Thus, in order to be fair for the comparison, we followed the setting as the references [14 , 15 , 19 , 21 , 22] selected as benchmark. In addition, in the scenario where multiple single antenna relay nodes operate in a distributed manner [23] , it is reasonable to assume the relay amplification matrix G is diagonal. During the normal communication period, however, the relay amplification matrix does not need to be diagonal. For this work, the use of non-diagonal AF matrices in the proposed approach is left for future work. Note also that, once the channels are estimated, the design of full AF matrices can be done.
Then, at the destination node D , by multiplying both sides of (4), (5) with
PPT Slide
Lager Image
respectively, yields the k -th frontal slice of the third-order tensor:
PPT Slide
Lager Image
PPT Slide
Lager Image
where M k = H r 2 d Dk ( F ) H sr 2 and T k = H r 1 d Dk ( E ) H sr 1 are the matrix-of-interest.
PPT Slide
Lager Image
are the noise version of M k and T k , respectively, while V k (1), V k (2) are the effective noise matrices at the destination node corresponding to the second phase and third phase of the k-th training block, which can be denoted as follows:
PPT Slide
Lager Image
PPT Slide
Lager Image
We take the case of S - R2 - D link for illustrating the tensor-based channel estimation procedure; nevertheless, the extension to the S - R1 - D link is rather straightforward. Considering the k -th time-block, the received signals at destination via the S - R2 - D link are stored in the k -th frontal slice M k of the third-order received signal tensor
PPT Slide
Lager Image
the operator ∪ r represents the concatenation of two matrices along the r -th mode. Each entry of M is given by
PPT Slide
Lager Image
Note that (11) represents the typical PARAFAC tensor model [24] , with H r 2 d , F and H sr 2 as matrix factors. In order to isolate the channel matrices involved in the S - R2 - D link, H sr 2 and H r 2 d , there are two unfolding of tensor M by stacking frontal slice M k ( k = 1,⋯, K ) and its transpose
PPT Slide
Lager Image
on top of each other as follows,
PPT Slide
Lager Image
PPT Slide
Lager Image
And, we can have the noise version of [ M ] (1) and [ M ] (2) ,
PPT Slide
Lager Image
PPT Slide
Lager Image
To extract the channel matrices H sr 1 and H r 1 d , similar to the steps (11)-(15), we can obtain another PARAFAC tensor model T = [ T 1 3 T 2 ⋯∪ 3 T k ], and its two tensor unfolding, which consist of matrix-of-interest, can be denoted as follows,
PPT Slide
Lager Image
PPT Slide
Lager Image
- 3.2 Model of Three-hop Link
During the fourth phase, the training signals are transmitted to destination node through the channel H sr 1 , H r 1 r 2 and H r 2 d . Compared to the PARAFAC tensor model, a more flexible tensor model should be adopted to capture this characteristic. By multiplying both sides of received signal (6) with
PPT Slide
Lager Image
we have
PPT Slide
Lager Image
where
PPT Slide
Lager Image
PPT Slide
Lager Image
By storing the set of K matrices in (19) together along the direction of the index k (the third dimension), we obtain a third-order tensor Q = ∈ C Nd×Ns×K , whose ( i,j,k )-th element is given by
PPT Slide
Lager Image
PPT Slide
Lager Image
for all i = 1,⋯, Nd , j = 1,⋯, Ns and k = 1,⋯, K . V = ∈ C Nd×Ns×K is the noise tensor stacked with V k (3) as Q k . Note that (21) fellows the typical PARATUCK2 tensor model [25] , in which the matrices H r 2 d and H sr 1 are associated with the first and second dimension of Q . E and F are interaction matrices defining the linear combination profile between the N 2 columns of H r 2 d and the N 1 columns of
PPT Slide
Lager Image
while H r 1 r 2 is the core matrix of PARATUCK2 model.
From the set of slices
PPT Slide
Lager Image
in order to estimate H sr 1 and H r 2 d , we can define two matrix unfolding
PPT Slide
Lager Image
in the following manner,
PPT Slide
Lager Image
From (23), we get the following factorization for
PPT Slide
Lager Image
PPT Slide
Lager Image
PPT Slide
Lager Image
where
PPT Slide
Lager Image
PPT Slide
Lager Image
and
PPT Slide
Lager Image
PPT Slide
Lager Image
To estimate H r 1 r 2 , the third matrix unfolding of
PPT Slide
Lager Image
can be defined as
PPT Slide
Lager Image
where
PPT Slide
Lager Image
Note that from equation (30), to estimate the channel matrix h r 1 r 2 = vec ( H r 1 r 2 ), using the property (3), we can have
PPT Slide
Lager Image
and
PPT Slide
Lager Image
PPT Slide
Lager Image
- 3.3 Combined ALS (Comb-ALS) Channel Estimation Algorithm
From the previous discussion, both the channel matrices of H sr 1 and H r 2 d are involved in the two-hop link and three-hop link, corresponding to different tensor models. How to extract the channel matrices effectively is a challenge. In this section, we propose a combined channel estimator to estimate the CSI by jointly exploit the benefit of PARAFAC and PARATUCK2.
Equation (31) leads to the following LS estimation problem,
PPT Slide
Lager Image
Combining (16) and (24) the LS estimation of H sr 1 can be obtained by solving the following problem,
PPT Slide
Lager Image
The solution is given by
PPT Slide
Lager Image
With a similar procedure, we combine (15) and (25) to establish the following LS optimization problem for H r 2 d ,
PPT Slide
Lager Image
The solution of (37) is given by
PPT Slide
Lager Image
From (14) and (17), we can obtain the LS approximation of H sr 2 and H r 1 d as follows,
PPT Slide
Lager Image
PPT Slide
Lager Image
Identifiability: Both PARAFAC and PARATUCK2 decompositions are essentially unique under some mild conditions, which allows a joint estimation of channel matrices of all links. Note that H sr 1 and H r 2 d are identifiable from (36) and (38) if H eff 1 and H eff 2 are full column-rank, which requires 2 KNd N 1 and 2 KNs N 2 . From equations (34), (39), (40), we can have KNsNd N 1 N 2 , KNd N 2 and KNs N 1 . Combining these conditions yields the following lower bound on the number of time blocks,
PPT Slide
Lager Image
where ⎾ x ⏋ is equal to the smallest integer which is greater than or equal to x .
Let
PPT Slide
Lager Image
be an alternative set of matrices yielding the same tensor M, T and Q . If the channel matrices of all the involved links are full rank and the identifiablity conditions (41) are satisfied, then
PPT Slide
Lager Image
are essentially unique. In this case, we have
PPT Slide
Lager Image
where the following relation holds,
PPT Slide
Lager Image
PPT Slide
Lager Image
PPT Slide
Lager Image
Since these ambiguities compensate each other, the compound channel is strictly unique
PPT Slide
Lager Image
From (41), we can see that there is a tradeoff can be achieved between the number of antenna and the period of required training symbols, which is meaningful in the scenario that the destination antenna number is less than the relay node antenna numbers as the traditional LS-based channel training method cannot be used. In addition, if we know the first row of H r 1 d and H r 2 d , these scaling ambiguities can be eliminated by means of the following equations:
PPT Slide
Lager Image
PPT Slide
Lager Image
where
PPT Slide
Lager Image
denotes the estimated values of
PPT Slide
Lager Image
at the convergence of Comb-ALS algorithms. In practice, the knowledge of the first row of H r 1 d and H r 2 d can be obtained by a simple supervised procedure [19 , 22] . In this paper, for purpose of performance evaluation, the scaling ambiguities affecting the estimation of the channel matrices are removed by assuming the first row of H r 1 d and H r 2 d contain all one elements, similar to [14 , 15 , 19 , 21 , 23] . First, we find
PPT Slide
Lager Image
Then, applying property
PPT Slide
Lager Image
and from (42)-(44) we obtain
PPT Slide
Lager Image
Note that these uniqueness results are naturally applicable if the S - R1 - D link and S - R2 - D link are too weak or not available (e.g. due to shadowing). Thus, we do not have to estimate H sr 2 , H r 2 d and H r 1 d any more, and we can model S - R 1 - R 2 - D link by using the PARATUCK2 tensor model. Then the uniqueness issue can be simplified to the works in [21] ,
PPT Slide
Lager Image
If the R1 - R2 link is too weak or not available, our model will be simplified to the work in typical two-hop AF relay system, the uniqueness condition simplifies to the scenario in works [14 , 15] .
- 3.4 Linear Minimal Mean Square Error (LMMSE) Estimation
In this section, an improved estimation of H sr 1 , H r 1 r 2 and H r 2 d can be derived by the LMMSE approach, which will further inhibit the error propagation by project the sampled data to the desired channel subspace by assuming a linear system model [14 , 15 , 27] . Obviously, the covariance matrix of the effective noise in (27), (29) and (33) is non-white any more. Note that the subsequent LMMSE signal processing method has been used in paper [14 , 15] in two-hop PARAFAC tensor model channel estimation algorithm. In this paper, we will firstly derive the corresponding procedures for PARATUCK2-based LMMSE algorithm of S - R 1 - R 2 - D three-hop link. Table 1 briefly summarizes the proposed algorithm, referred to two-stage fitting algorithm. The basic ideas are as follows: after an initial estimation of
PPT Slide
Lager Image
by the Comb-ALS algorithm, an improved estimation of
PPT Slide
Lager Image
can be obtained by the following LMMSE approach as
PPT Slide
Lager Image
is the weight matrix. The mean square error of channel estimation can be written as,
PPT Slide
Lager Image
where
PPT Slide
Lager Image
and
PPT Slide
Lager Image
Proposed two-stage fitting algorithm
PPT Slide
Lager Image
Proposed two-stage fitting algorithm
The weight matrix minimizing (48) is given by,
PPT Slide
Lager Image
Similarly, we can also obtain an improved estimation of H r 2 d and H r 1 r 2 by the LMMSE approach as
PPT Slide
Lager Image
is the weight matrix with,
PPT Slide
Lager Image
PPT Slide
Lager Image
where
PPT Slide
Lager Image
and
PPT Slide
Lager Image
PPT Slide
Lager Image
- 3.5 Complexity Analysis
The computational cost at each iteration of the proposed algorithm is given in Table 2 . For the sake of simplicity, the expressions in Table 2 approximate the number of floating-point operations per iteration in considering the dominant cost associated with SVD computation, which is used to calculate the matrix pseudo-inverses. According to [22 , 26] , for a full column-rank matrix of dimensions M × N , the SVD computation cost is O ( MN 2 ). The overall complexity of the Comb-ALS based algorithm depends on the number of iterations. Generally, the required iterations for convergence of the proposed Comb-ALS is less than 12, which will be further analyzed in Section 4. In addition, the subsequent LMMSE approach imposes
PPT Slide
Lager Image
extra operations due to matrix inversions.
Algorithmic complexity of the Comb-ALS and PARATUCK2-based algorithms
PPT Slide
Lager Image
Algorithmic complexity of the Comb-ALS and PARATUCK2-based algorithms
In comparison with the PARATUCK-based algorithm [21] , we can conclude from Table 2 that the complexity per iteration scales similarly to the proposed algorithm, but the proposed algorithm is a little higher than [21] . One comes from the estimation of the additional channel links H sr 2 and H r 2 d , which is
PPT Slide
Lager Image
The other difference results from the extra sampled data provided in two-hop links when estimating H sr 1 and H r 2 d , which is
PPT Slide
Lager Image
4. Simulation Results
In this section, some simulation results are provided to demonstrate the performance of the proposed scheme. Each obtained result is an average over R = 5000 independent Monte Carlo simulations. For each run, the channels are generated from an i.i.d Rayleigh generator while the users symbols are generated from an i.i.d. distribution and are modulated using QPSK. And the proposed algorithm is performed following the procedure in Table 1 with ε = 1×10 (-5) . In particular, we compare the proposed algorithm with algorithm in [21] and the typical LS estimator. As for the LS estimator, we adopt the sequential estimation method in [21] to estimate H sr 1 , H r 1 r 2 and H r 2 d , the channel matrix H r 1 d is estimated from the received signal model of R 2 - D link while H sr 2 is draw from the received signal of link S - R 2 - D based on the estimated H r 2 d . Note that in order to ensure the uniqueness of the LS estimation, the antenna number should satisfy Nd N 2 N 1 . A factor of
PPT Slide
Lager Image
is used to scale the training sequences S 0 in the LS training process to ensure a fair comparison [14] . In addition, in order to make a fair comparison with the algorithm in [21] , we adopt the method in [21] to remove the ambiguities in the Step 1.6 of the proposed algorithm. From Fig. 2 to Fig. 6 , we consider a special communication scenario, where the source node, the two relay nodes and the destination node are in a line with equal distance, that is to say, η 1 = η 2 = 2. The effect of the path loss parameter on the achievable diversity gain will be further discussed in Fig. 7 and Fig. 8 .
PPT Slide
Lager Image
Convergence of the proposed Comb-ALS algorithm
The estimator’s performance is evaluated in terms of the normalized mean square error (NMSE) of the estimated channel matrices and the bit error rate (BER). For each channel realization, the NMSE of channel estimation for different algorithms is calculated as
PPT Slide
Lager Image
for the channel H , where
PPT Slide
Lager Image
His the estimated value. The SNR level at the first relay node and the second relay node is assumed to be 20dB above the SNR level at the destination, and the BER performance is obtained with a zero forcing (ZF) receiver. During the data transmission period, unlike the training period, the amplify matrices are generated based on DFT matrix. From (4)-(6), the ZF solution can be written as,
PPT Slide
Lager Image
We begin by evaluating the convergence of the proposed Comb-ALS algorithm. Considering the first propagation scenario, where the parameters are set to Ns = 2, N 1 = N 2 = 4, Nd = 6, L 0 = 2 and K = 16. The NMSE value of estimated compound channel matrix H c is plotted as a function of the iterations for various SNR values. It can be seen from Fig. 2 that the algorithm rapidly convergences, usually within 12 iterations.
The NMSE performance of all the channel matrices of the proposed scheme is shown in Fig. 3 and Fig. 4 , where the solid line, the dash-dot line and the dot line represent the proposed Comb-ALS scheme, LMMSE scheme and LS scheme, respectively. In Fig. 3 , the system parameters are Ns = 2, N 1 = N 2 = 4, Nd = 4, L 0 = 2 and K = 16. As can be seen from Fig. 3 , the NMSE decreases as SNR increases. As expected, the estimation of H sr 1 , H r 1 r 2 and H r 2 d is improved by carrying out the additional LMMSE estimation. At high SNR level, the estimation of H sr 1 and H r 2 d yields better performance than other links, the reason is that both the channel matrices are involved in all the commutation phases and additional samples can be provided to improve the performance. In addition, compared to the typical LS channel estimation scheme, the proposed algorithm yields a more accurate performance. In fact, the estimation of H sr 1 and H r 2 d in LS scheme has an error floor. The reason is that the estimation of H r 2 d and H r 1 r 2 in the LS scheme presents an error propagation for the estimation of H sr 1 and H sr 2 , thus affecting the total NMSE performance. In Fig. 4 , we investigate the scenario in which the antenna number of the destination node is less than that of destination node, i.e. Nd = 2. In this scenario, the sequential LS-based channel estimation algorithm exploited in [14 , 15 , 21] cannot be used as the channel estimation problem will be a rank-deficient problem when the antenna number at the destination node is less than that of relay nodes. From Fig. 4 , we can also see that the NMSE performance of all links decreases when SNR increases.
PPT Slide
Lager Image
NMSE versus SNR for the antenna number of destination node equals to that of the relay nodes
PPT Slide
Lager Image
NMSE versus SNR for the antenna number of destination node less than that of relay nodes
The impact of antenna number at the destination node on the system BER performance is shown in Fig. 5 . The other system parameters are fixed to Ns = 2, N 1 = N 2 = 4, L 0 = 2, K = 16. The dash-dot line represents Nd = 2 while the solid line represents the scheme of Nd = 4, respectively. It can be seen that the BER performance of proposed Comb-ALS algorithm is considerably improved as the antenna number of destination node increases, especially at high SNR levels. As the proposed communication process consists two additional communication links, i.e. the S - R1 - D link and the S - R2 - D link, a diversity gain can be further obtained compared to the PARATUCK2-based one-way three-hop channel estimation scheme. For instance, when Nd = 4, at target BER of 10 −2 , the SNR gap between the LMMSE case and Comb-ALS case is more than 1dB.
PPT Slide
Lager Image
BER performance versus the antenna number at the destination node
In Fig. 6 , we investigate the number of relay antennas on the BER performance of the ZF detector using the proposed channel estimator. The other system parameters are set to Ns = 2, Nd = 6, L 0 = 2 and K = 20. The dash-dot line represents the number of antenna at relay nodes is N 1 = N 2 = 2 while the solid line represents N 1 = N 2 = 4, respectively. It can be seen that the BER performance is considerably improved as the number of antenna at relay nodes is increased, owing to the higher spatial diversity. As expected, we can also see that additional LMMSE process can further improve the BER performance. But with the number of antenna at relay nodes increasing, the gap between the proposed scheme and the scheme in [21] is narrowing.
PPT Slide
Lager Image
BER performance versus the antenna number at the relay nodes
In Fig. 7 and Fig. 8 , the impact of the distribution of relay nodes on the achievable gain of the proposed communication scheme is investigated in two special communication scenarios. In the best scenario η 1 = η 2 = 1, which means both the first relay node and the second relay node lie in the middle of the SD link, thus has the smallest path loss effect. Obviously, with the quality of the two-hop link increasing, the achievable gain of the system is superior to the scenario when η 1 = η 2 = 2.
PPT Slide
Lager Image
BER performance versus different (η1, η2) in the case that the antenna number at the destination node less than the relays
PPT Slide
Lager Image
BER performance versus different (η1, η2) in the case that the antenna number at the destination node greater than the relays
5. Conclusion
We have proposed a novel channel estimation algorithm for multi-hop relaying communication systems, where both the one-way two-hop communication link and one-way three-hop link exist. The proposed algorithm provides the destination node with full knowledge of all channel matrices involved in the communication, suffering from smaller channel estimation error. Compared to existing one-way three-hop approaches, the proposed scheme is able to make a more efficient use of cooperative diversity by jointly estimating the channel matrices of all links via PARAFAC and PARATUCK2 tensor model in an iterative way. Our simulation results verify the effectiveness of the proposed algorithms in terms of the convergence speed, NMSE and BER performance.
BIO
Shuangzhi Li received his B.E. Degree in Electronic Information Engineering from Zhengzhou University, Zhengzhou, China in 2012. He is currently working toward the Ph. D. Degree with the School of Information Engineering, Zhengzhou University, China. His research interests include signal processing in cooperation communications and MIMO systems.
Shuangzhi Li received his B.E. Degree in Electronic Information Engineering from Zhengzhou University, Zhengzhou, China in 2012. He is currently working toward the Ph. D. Degree with the School of Information Engineering, Zhengzhou University, China. His research interests include signal processing in cooperation communications and MIMO systems.
Xin Guo received her B.E. Degree in Communication Engineering from The PLA Information Engineering University, Zhengzhou, China in 2010. She is currently working toward the Ph. D. Degree with the School of Information Engineering, Zhengzhou, China. Her research interests include image signal processing, pattern recognition and optimization algorithms.
Jing Yang received her Ph.D. Degree from Beijing Institute of Technology, Beijing, China in 2011. Since then, she joined the College of Information Science and Engineering, Henan University of Technology. Now, she is a lecturer. Her research interests include cooperative communication systems and rateless codes.
Jiankang Zhang received the B.Sc. Degree in Mathematics and Applied Mathematics from Beijing University of Posts and Telecommunications in 2006, and the Ph. D. Degree in Communication and Information Systems from Zhengzhou University in 2012. Since then, he has been a lecturer in School of Information Engineering, Zhengzhou University. From September 2009 to December 2011 and from January 2013 to May 2013, Dr. Zhang was a visiting researcher in Electronics and Computer Science, the University of Southampton, UK. His research interests are in the areas of wireless communications and signal processing, including channel estimation, multi-user detection, beamforming/precoding and optimization algorithms.
References
Tehrani M. , Uysal M. , Yanikomeroglu H. 2014 “Device-to-device communication in 5G cellular networks: Challenges, solutions, and future directions,” IEEE Communications Magazine 52 (5) 86 - 92    DOI : 10.1109/MCOM.2014.6815897
Hossain E. , Rasti M. , Tabassum H. , Abdelnasser A. 2014 “Evolution toward 5G multi-tier cellular wireless networks: An interference management perspective,” IEEE Wireless Communications 21 (3) 118 - 127    DOI : 10.1109/MWC.2014.6845056
Xing C. , Gao F. , Zhou Y. 2015 “A framework for transceiver designs for multi-hop communications with covariance shaping constraints,” IEEE Transactions on Signal Processing 63 (15) 3930 - 3945    DOI : 10.1109/TSP.2015.2425800
Rong Y. 2010 “Optimal joint source and relay beamforming for MIMO relays with direct link,” IEEE Communications Letters 14 (5) 390 - 392    DOI : 10.1109/LCOMM.2010.05.092429
Rong Y. , Tang X. , Hua Y. 2009 “A unified framework for optimizing linear non-regenerative multicarrier MIMO relay communication systems,” IEEE Transactions on Signal Processing 57 (12) 4837 - 4851    DOI : 10.1109/TSP.2009.2027779
Behbahani A. S. , Merched R. , Eltaswil A. M. 2007 “Optimizations of MIMO relay network,” IEEE Transactions on Signal Processing 56 (10) 5062 - 5073    DOI : 10.1109/TSP.2008.929120
Héliot F. 2014 “Low-complexity energy-efficient joint resource allocation for two-hop MIMO-AF systems,” IEEE Transactions on Wireless Communications 13 (6) 3088 - 3099    DOI : 10.1109/TWC.2014.042814.130898
Xing C. , Ma S. , Fei Z. , Wu Y. , Poor H. V. 2013 "A general robust linear transceiver design for multi-hop amplify-and-forward MIMO relaying systems," IEEE Transactions on Signal Processing 61 (5) 1196 - 1209    DOI : 10.1109/TSP.2013.2243439
Xing C. , Ma S. , Zhou Y. 2015 “Matrix-monotonic optimization for MIMO systems,” IEEE Transactions on Signal Processing 63 (2) 334 - 348    DOI : 10.1109/TSP.2014.2373332
Wang L. , Cai Y. , Yang W. , Yan W. , Song J. 2015 “Effect of outdated channel estimates on multiple antennas multiple relaying networks,” KSII Transactions on Internet and Information Systems 9 (5) 1682 - 1701
Kong T. , Hua Y. 2011 “Optimal design of source and relay pilots for MIMO relay channel estimation,” IEEE Transactions on Signal Processing 59 (9) 4438 - 4446    DOI : 10.1109/TSP.2011.2158429
Sheu J. S. , Lain J. K. , Wang W. H. 2013 “On Channel estimation of orthogonal frequency-division multiplexing amplify-and-forward cooperative relaying systems,” IET Communications 7 (4) 325 - 334    DOI : 10.1049/iet-com.2012.0091
Amin O. , Gedik B. , Uysal M. 2010 “Channel estimation for amplify-and-forward relaying: cascaded against disintegrated estimators,” IET Communications 4 (10) 1207 - 1216    DOI : 10.1049/iet-com.2009.0435
Rong Y. , Khandaker M. R. A. , Xiang Y. 2012 “Channel estimation of dual-hop MIMO relay system via parallel factor analysis,” IEEE Transactions on Wireless Communications 11 (6) 2224 - 2233    DOI : 10.1109/TWC.2012.032712.111251
Du J. , Yuan C. , Zhang J. 2014 “Low complexity PARAFAC-based channel estimation for non-regenerative MIMO relay systems,” IET Communications 8 (12) 2193 - 2199    DOI : 10.1049/iet-com.2013.1155
Rolim Fernandes C. A. , De Almeida A. L. F. , Benevides Da Costa D. 2012 “Unified tensor modeling for blind receivers in multiuser uplink cooperative systems,” IEEE Signal Processing Letters 19 (5) 247 - 250    DOI : 10.1109/LSP.2012.2188510
Roemer F. , Haardt M. 2010 “Tensor-based channel estimation and iterative refinements for two-way relaying with multiple antennas and spatial reuse,” IEEE Transactions on Signal Processing 58 (11) 5720 - 5735    DOI : 10.1109/TSP.2010.2062179
Harshman R. A. 1970 “Foundations of the PARAFAC procedure: model and conditions for an “explanatory” multi-mode factor analysis,” UCLA Working Papers in Phonetics 16 (1) 1 - 84
Ximenes L. R. , Favier G. , De Almeida A. L. F. , Silva Y. C. B. 2014 “PARAFAC-PARATUCK semi-blind receivers for two-hop cooperative MIMO relay systems,” IEEE Transactions on Signal Processing 62 (14) 3604 - 3615    DOI : 10.1109/TSP.2014.2328323
Cavalcante I. V. , De Almeida A. L. F. , Haardt M. “Tensor-based approach to channel estimation in amplify-and-forward MIMO relaying systems,” in Proc. of 2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop June 22-25, 2014 445 - 448
Han X. , De Almeida A. L. F. , Yang Z. 2014 “Channel estimation for MIMO multi-relay systems using a tensor approach,” Eurasip Journal on Advances in Signal Processing 2014 (1) 1 - 14    DOI : 10.1186/1687-6180-2014-1
Ximenes L. R. , Favier G. , De Almeida A. L. F. 2015 “Semi-blind receivers for non-regenerative cooperative MIMO communications based on nested PARAFAC modeling,” IEEE Transactions on Signal Processing 63 (18) 4985 - 4998    DOI : 10.1109/TSP.2015.2454473
Du J. , Yuan C. , Zhang J. 2015 “Semi-blind parallel factor based receiver for joint symbol and channel estimation in amplify-and-forward multiple-input multiple-output relay systems,” IET Communications 9 (6) 737 - 744    DOI : 10.1049/iet-com.2014.0553
Bro R. , Ph.D. dissertation 1998 “Multi-way analysis in the food industry: Models, algorithms and applications,” Univ. Amsterdam Amsterdam, The Netherlands Ph.D. dissertation
Kolda Tamara G. , Bader Brett W. 2009 Tensor Decompositions and Applications Siam Review 48 - 50
Golub G. H. , Loan V. C. F. 1996 Matrix Computations. Johns Hopkins University Press Baltimore, MD, USA
Zhang J. , Mu X. , Chen E. , Yang S. 2009 “Decision-directed channel estimation based on iterative linear minimum mean square error for orthogonal frequency division multiplexing systems,” IET Communications 3 (7) 1136 - 1143    DOI : 10.1049/iet-com.2008.0166