^{1}

^{*}

^{1}

A multi-antenna multiple relay (MAMR) network is considered and a variation of two-hop zero-forcing amplify-forward relaying method is proposed. Deploying ZF method together with application of diagonal power allocation matrices at the relays, it is shown that the overall MAMR network is simplified to M independent single antenna multiple relay (SAMR) networks, where M is the number of source and destination antennas. This enables to incorporate network beamforming proposed for SAMR networks. Accordingly, using the BER as the performance metric, we present simulation results to show the proposed approach outperforms the common ZF method addressed in the literature.

It is well established that in most cases relaying techniques provide considerable advantages over direct transmission, provided that the source and relay cooperate efficiently. The choice of relay function is especially important as it directly affects the potential capacity benefits of node cooperation [1-5]. In this regard, two relaying methods, Amplify-Forward (AF) [6,7] and estimate-forward (EF) [8,9], are extensively addressed in the literature. As the names imply, the former just amplifies the received signal but the latter estimates the signal with errors and then forwards it to the destination.

It has been shown that increasing the number of relays has the advantage of increasing the diversity gain and flexibility of the network. However, it renders some new issues to arise [

The capacity and reliability of the relay channel can be further improved by using multiple antennas at each node. The use of relays together with multiple antennas has made it a versatile technique to be used in emerging wireless technologies [15-20]. Relaying strategies for the multi-antenna multiple relay (MAMR) network are more challenging than single antenna network.

AF Multi-Input Multi-Output (MIMO) relay systems have drawn considerable attention in the literature due to their simplicity and ease of implementation. In this regard, a plethora of works are devoted to finding a proper relaying strategy for AF MAMR networks. In [

In [

In [

In [

Latest developments are mentioned as the LDMRB to enhance its performance i.e. in [

In this paper, the idea of LDMRB is used where ZF algorithm is utilized in both reception and transmission. It is shown that using this method the overall MAMR network can be transformed into M independent SAMR networks. Then the idea of network beamforming that is suggested in [

Notations: means the ith element of vector a, means the ith row of matrix A, means the entry corresponding to the jth column and ith row of matrix A.

We consider x as a M × 1 vector whose elements are independent zero mean random variables with covariance matrix. Thus, the received signal vector at the ith relay can be represented as,

where n_{i} is a noise vector, representing the received noise vector at the ith relay with the covariance

matrix where denotes the identity matrix and N_{0} is the noise power associated with each entry. is matrix to represent the channel gain matrix between the transmitter and the ith relay. It is assumed that the entries of H_{i} are zero mean unit variance drawn from an independent complex Gaussian distribution. But H_{i}’s are known at all relays. Moreover, (.)^{H} is a Hermitian operation. Assuming the ith relay multiplies its received signal by a weight matrix and forwards the resulting vector to the destination, it follows that:

where is the average transmit power which is assumed to be lower than, considering is frobenius norm. Thus, referring to

where is the ith channel gain matrix between the ith relay and the destination whose entries are zero mean unit variance complex Gaussian random variables.’s are known at all relays. Also, n is a M × 1 zero-mean noise vector whose entries are of power N_{0}. Finally, n_{i} for and n are assumed to be statistically independent. Moreover, in this work it is assumed that no processing is performed at the receiver. In other words, the weight matrices W_{i} for are computed such that the received vector y is a scaled unbiased estimate of the transmitted vector x.

Suppose a linear MAMR relay in which the relay performs linear operations at both reception and transmission. One can decompose the relay weight matrix to three sub-matrices namely; reception, power control and transmission matrices as:

where the superscripts (t), (p) and (r) indicate transmission, power allocation and receiving operations, respectively. Moreover, is a diagonal matrix with positive fractional diagonal elements. This matrix is used to control the power assigned to each symbol stream.

Considering the estimated transmitted vector at the ith relay as:

Thus, one can rewrite the transmitted symbol of the ith relay as:

In [

where is the pseudo inverse operation. The denominator ascertains the output power normalization. In this case, the receiving matrix in (5) can be considered as:

and similarly, we have:

So the estimated or demodulated vector of the ith relay becomes:

Here it is assumed that the number of relay antennas is larger than that of source and destination antennas i.e. N_{i} > M. Moreover, the resulting noise vector at the ith relay is. As a result, the jth element of the estimated vector at ith relay becomes:

Note that, the jth entry of the resulting noise vector at the ith relay is, thus one can readily compute its power () as:

If the receiving matrix is redefined as, where is a diagonal matrix whose diagonal entries are, then the receiving matrix can be written as:

The demodulated symbol at the ith relay can now be written as:

Thus the jth^{ }entry of is obtained as:

where N_{0} is the power of

Substituting from (15) into (7), the transmitted vector of the ith relay can be written as:

where.

Thus, substituting from (17) into (4), the received signal at the destination becomes:

As a result, the jth element of the received vector at destination or the received symbol at the jth destination antenna can be represented as:

It can be seen that all interferences are canceled using zero forcing scheme and the symbol received in the jth destination antenna just depends on the symbol transmitted by the jth source antenna. This resembles to a SAMR network. Therefore, we have M independent SAMR network and hence the so called network beamforming can be applied.

The SNR of the received symbol at the jth destination antenna can be computed as,

It is desired to find to maximize SNR for all data streams. As noted earlier, is a diagonal matrix whose diagonal entries are positive number taking values less than one. identifies the fraction of power that is allocated by the ith relay to the jth data stream. As noted in [

N_{0} is a constant term and thus, can be discarded from optimization. We define the following vectors and matrix associated with the jth symbol stream as follows,

The SNR can now be written as:

This relation is similar to the network beamforming problem for single antenna network [

where,

where is the inverse of the transpose of matrix A.

The Jing algorithm [

These are also computed at destination. They are sorted in descending order as follows:

And is defined to be. Then the parameter is also defined as:

Then the optimal power allocation is obtained as:

where k_{0} is the smallest k such that [

This procedure is performed for all SAMR networks and for is obtained.

The proposed method can be briefly explained as follows. At first, the receiving and transmission matrices at each relay is computed from (14) and (10) respectively. This transforms the overall channel matrix from source to destination to a diagonal matrix. Power allocation matrix for can be then obtained from (28). Finally, Relay matrices are computed by multiplication of the given matrices as for. The algorithm that presented here can be summarized as follows. In each relay the transmitted vector is estimated using ZF method. The using network beamforming the power of each element of the estimated vector is controlled. Not all elements can be transmitted with full power. The element that have SNR more that a threshold is transmitted with full power and remaining symbols are transmitted with a fraction of full power that have direct relation to their SNR. The power control values are obtained using network beamforming algorithm [

In the simulation of a MAMR network here, the large scale fading experienced by the relays is assumed to be the same. The channel matrices are generated independently during subsequent iterations. It is also assumed that the first and second hop channels for all relays are known to all nodes. Furthermore, an uncoded QPSK modulation is used and independent symbol sequences is transmitted by each source antennas.

In

A new signaling method for Multi-antenna Multiple Relay networks (MAMR) with the aid of ZF-ZF method at

the relays is proposed to transform the original network into several single-antenna relay networks. This helps to mitigate the interference term between individual data streams transmitted from the individual source antennas. Accordingly, the network beamforming which is proved to be the optimal power allocation method for SAMR network [

Simulation results indicate that the proposed method improves the BER comparing with the naive ZF-ZF method in the absence of power allocation.

Future works: the amount of power that is not used for one data stream in a relay can be used by other data stream. This is not considered in this paper and can be the subject for a future work. Also this method can be generalized to MMSE-MMSE and QR-QR schemes.

The authors thank ITRC (Iran Telecommunication Research Center) for supporting this project financially.