**Open Access**-
**Total Downloads**: 8 -
**Authors :**Prathibha.J.S, M.Kanthimathi -
**Paper ID :**IJERTCONV2IS12013 -
**Volume & Issue :**NCACCT – 2014 (Volume 2 – Issue 12) -
**Published (First Online):**30-07-2018 -
**ISSN (Online) :**2278-0181 -
**Publisher Name :**IJERT -
**License:**This work is licensed under a Creative Commons Attribution 4.0 International License

#### Achievable Rate Maximization in the Decode and Forward MIMO Multi Relay Communication

Prathibha.J.S, ME Communication Systems and M.Kanthimathi, Assistant Professor, Department of ECE, Sri Sai Ram Engineering College, Chennai

E-mail: jsprathi28@gmail.com, kanthimathi.ece@sairam.edu.in.

AbstractPartial information relaying is implemented in a decode and forward based MIMO relay system using the available CSI at the relay. For the broadcast of information between a source and destination with a relay, two transmission phases are considered. During the 1st transmission phase both the forwarding and the non- forwarding streams are broadcasted from the sender to both the relay and the destination and in the 2nd transmission phase the relay forwards only the forwarding streams to the destination. Achievable rate of the system is determined by using the available CSI at the relay. For an indoor wireless communication system with constant distance between the source and the relay the achievable rate in the MIMO relay system is determined.

KeywordsMultiple Input Multiple Output (MIMO), Channel Side Information (CSI), Decode and forward MIMO relay

INTRODUCTION

Relay communication focuses on either reliable communication or coverage extension with low cost and low transmit power. Relays are used to increase data rate. Due to the capacity enhancements in the MIMO communication it has been used extensively in relay communication to achieve high data rate.Several bounds on achievable rate have been derived for MIMO relay communication.

Relays are classified as full duplex and half duplex relays. Full duplex relays transmit and receive data at the same time in a single frequency band and the isolation between transmission and reception on same antenna is difficult to implement. Hence half duplex relays are used.

RELATED WORKS

SD

Partial information relaying is introduced as a solution to the spectral efficiency loss caused by half duplex relaying in which the relay forward only a part of the decoded information to SYSTEM MODEL The destination[1],[2]. The variable slot length with the superposition coding is used in decode and forward based relay system with single antenna nodes [3]. Partial information relaying for single antenna system is first proposed by taking into account interstream interference and power allocation between basic and superposed data [4].Partial DF relaying protocol with multiple antennas is used, where forwarding information is constructed by stream control. Specifically, a source node broadcasts multiple data streams over multiple antennas in the first phase and a relay node forwards only a subset of the received streams in the second phase. A destination node decodes non-forwarded data streams after subtracting the forwarded data streams from the received data streams in the first phase using successive interference cancellation, a simple linear precoding scheme for partial DF relaying using CSI.Consider a system with multiple transmit receive and relay nodes. All nodes are equipped with multiple antennas, and the numbers of antennas at the source, relay, and destination are assumed as M, K, and N. The system adopts the half-duplex DF relaying protocol, as shown in Fig.1. In the first transmission phase, the source broadcasts L data streams, L = min{M,K,N}, over M transmit antennas. The MIMO channels from the source to the relay and from the source to the destination are denoted by HSRCN(0,2SRI) and HSD CN(0,2 I) where CN(0, 2I) represent the matrix follows an independent complex Gaussian distribution with mean 0 and covariance 2I. The total L data streams are composed of L J non forwarding streams not to be forwarded by the relay and J forwarding stream.

SR

the remaining as H(0).The matrixH- SR [1] is a composite matrix of H(1) and H(2)

SR SR

SR

HSR=[H-SR H(0)] (2)

where H(1)=[hSR,1,..hSR,LJ] and H(1)=[hSR,LJ+1,.., hSR,L].

SR SR

B. Mutual Information

Fig 1 System model for 1st transmission phase

The relay node first decodes xN by treating xF as noise. Then, the achievable rate for xN at the relay in terms of the mutual information between xN and ySR is obtained by [1]

|I+SH(1)(H(1)) H+SH(2)(H(1)) H|

I(xN:ySR) =log

SR SR

(2)

SR SR

(1)

(3)

|I+SHSR (HSR ) H|

SR

The matrix H-SR denotes a composite channel of H(1)and

SR

H(2) [1]

|I+S H-SR H-SR H|

I(xN:ySR) =log|I+SH(2)(H(1)) H| (4)

Fig

2 System model for 2nd transmission phase

RD

The channel from the relay to the destination is denoted by HRDCN (0, 2 I), and the additive white Gaussian noise (AWGN) vectors at the SR, SD, and R-D links are represented

SR SR

where the transmit signal-to-noise ratio (SNR) at the source is S= (PS/L). After decoding xN at the relay node, the mutual information between xF and ySR conditioned on xN is given by [1]

I(x :y |x )=log|l + p H(2)(H(2)) H| (5)

by nSR, nSD, and nRD, respectively. All AWGN vectors are assumed to follow i.i.d. circularly symmetric complex Gaussian distribution

F SR N

S SR SR

with zero mean and covariance I.

A.MIMO Channel

When the CSI is not available at the source, the source broadcasts data vector x for L streams over randomly selected L transmit

In the second transmission phase, the relay node forwards

xF after appropriate precoding according to the available CSI. Then, the mutual information at the destination is given by [1]

I(x :y )=log|I+H H H| (6)

antennas with uniform power allocation. Without loss assume that

F RD

SR SR

the source broadcasts the data streams x over the first L antennas, i.e., 1st, . . . ,Lth transmit antennas. On the other hand, relay and destination nodes are assumed to perfectly estimate the channel states from other nodes by the received signal. That is, the CSI at the receiver is assumed to be available at all nodes.

Finally, the destination node decodes nonforwarding streams xN by subtracting xF from the received signal ySD received in the first transmission phase. Therefore, the achievable rate for xN at the destination is given by [1]

I(xF:ySD|xF)=log|l + pSH(1)(H(1)) H| (7)

The transmit vector x CLÃ—1 is divided into L -J non-forwarding streams and J forwarding streams, which are denoted by xN and xF, respectively.The KÃ—M MIMO channel matrix from the source to

C.Achievable Rate

SR SR

the relay as HSR and is decomposed into data streams as given in (1)[1]

When the CSI is not available at the source, the relay determines the number of forwarding data streams based on the

HSR=[h

SR,1,h

SR,LJ,h

SR,LJ+1

,…, h

SR,L,.h

SR,M] (1)

amount of available CSI at the relay to maximize the overall data rate. Because the overall achievable rate of the partial stream relaying is bounded by the minimum data rate of non-forwarding

Considering the channel matrix for non-forwarding L-J streams xN at the relay and the destination, the overall achievable

streams as H(1)and the forwarding J streams as H(2)and rate is given by [1]

SR SR

RPDF=min{R1,PDF,R2,PDF} (9)

where HRD=URDS1/2VH and VRD(1:J) denotes a matrix of

RD RD

In the second transmission phase, the relay node forwards only J forwarding data streams xF to the destination node. To maximize the achievable data rate of the proposed partial stream relaying, the relay node determines the number offorwarding streams and forwards only the determined number of data streams. Considering the following three different cases according to the available CSI at the relay.

right singular vectors that corresponds to the largest J eigen values. PRis the average power at the relay. Power allocation is obtained by water filling algorithm and is given by [1]

R=disg[pr,1..pr,J] (14)

1

and pR,i(i=1.J) is obtained by

Case 1: perfect CSI of RD (HRD) and SD (HSD) links at the relay

R,i V

1 +

JRD,i

(15)

p =

Case 2: perfect CSI of the RD link (HRD) and the

where is determined by pR,i=PR and (x)+:=max{x,0}.

covariance matrix of the SD link (2 I) at the relay

SD

Case 3: the covariance matrices of the RD (2RDI) and

C2.Case 2

SD (2 I) links at the relay.

SD

C1. Case 1

Because the perfect CSI of the SD and RD links is available at

When the relay node has the perfect CSI of the RD link (HRD) and knows the channel covariance matrix of the S D link (i.e., 2SDI), the effective channel of the RD link after precoding at the relay is the same given by [1]

the relay, the relay node can exactly calculate both R1,PDF and R2,PDF. Hence the total achievable rate is same as that of the

HRD=HRDF*

(16)

R

general achievable rate from [1]

loglI+H- H- Hllog |I+H- H- H|

As the relay node knows the perfect CSI of the RD link, the relay can calculate R1,PDFwith the available CSI but

R RD RD

SR SR

(10)

cannot calculate R2,PDF due to the absence of the CSI of

1,PDF=loglI+H-RD H-RD Hl+log |I+SH(2)(H(2)) H|

H [1].

SR SR SD

For the determined precoding matrix at the relay, the effective channel of the RD link is given by [1]

C3.Case 3

When the relay node knows only the channel covariance

* matrices of the RD and SD links (i.e., 2

I and 2

I),

HRD=HRDF R (12)

R

where F* is the effective precoding matrix and is given as [1]

RD SD

the effective channel of the RD link after precoding is determined by [1]

F* =V (1:J)1/2 (13)

R RD R

R = T1 min{ I(x :y

)+ I(x :y

|x ) I(x :y

|x )+ I(x :y

|x )} (8)

T1+T2

N SR

F SR N

N SD F

F SR N

H

R2,PDF=log l1 + HRDHRD

loglI+pSH(1)(H(1)) Hl+log |I+pSH(2)(H(2)) H|

l * SR SR SR SR (11)

loglI+H-RDH-RDHl+log |I+pSH(2)(H(2)) H|

SR SR

H EH [ loglI+pSH(1)(H(1)) Hl ]+log |I+pSH(2)(H(2)) H|

EHSD

[R2,PDF]=log l1 + HRDHRDl SD SR SR SR SR (17)

loglI+H-RDH-RDHl+log |I+pSH(2)(H(2)) H|

(L-J)SD+loglI+SH(2)(H(2)) Hl

SR SR

(2) (2) H

EHRD,HSD[R2,PDF] J Ã— So SR SR (19)

JSD+loglI+SH (H ) l

HRD=HRD R

(18)

SR SR

Approximate upper bounds of EHRD[R1,PDF] and EHRD,HSD[R2,PDF] for determining the number of forwarding data streams as

J

where R= PR [1JÃ—J0JÃ—(K-J)]T is the effective precoding

matrix [1]

JSD loglI+H-RDH-RDHl

EHRD[R1,PDF] JSD+log |I+SH(2)(H(2)) H| (20)

SR SR

D.RELAY SELECTION IN MULTIPLE RELAY USING ACHIEVABLE RATE

Consider a set of relay nodes S={s1, s2, , s|S|} in the MIMO system the power at the relay node varies accordingly of the distance between the source and the relay and is given by [8]

d

Pr = Ps + K 10ylog10 ( d ) (21)

o

where K=20log10(/4d0), is the wavelength of the signal that is being transmitted, Pr is the power atthe relay, Ps the average power at the source , y is the path loss exponent for free space its value is equal to 2, d0 is the reference distance and d the distance

between the source and the relay. This Pr is used for the estimation of the HRD which in turn is used in achievable rate estimation.

II. SIMULATED RESULT

Fig 3 Achievable rate Vs. SNR

The figure3 compares the achievable rate of the 3 cases of the relay system with the CSI unknown at the source. The achievable rate for the direct transmission (ie. without the relay) is compared with the system with relay. From the graph it is interpreted that if both the channel matrix are known the achievable rate is substantially high compared to the other cases where the channel matrix is unknown.

Fig 4 Achievable rate Vs. distance for SNR=10

From the fig.4 for an indoor wireless system the reference distance d0 is taken ad 10m and distance between the transmitter and relay is taken as 40m with constant SNR as10dB then the achievable rate of the system is 4.784 bps/Hz.

VII .CONCLUSION

The scenario of CSI is not available at the source is considered and the achievable rate of the data transmissions using partial information relaying scheme is estimated. The achievable rate is analyzed for the various ranges of SNR values. Although the CSI is unknown at the source the CSI information and the link covariance information available at the relay is used for evaluating the achievable rate. Achievable rate of all the three cases of the CSI available at the relay is estimated and is plotted against various values of SNR. The optimal relay selection for multiple relay nodes can be analyzed by evaluating the power at the relay for varying distances between source and relay.

REFERENCE

J.Y.Ryu, W.Choi, D.I.KimPartial stream relaying in MIMO relay communication, IEEE trans. on vehicular technology,vol. 62,no.1, pp 205-218 Jan 2013.

M. Yusel and E,Erkip, Broadcast Strategies for the fading relay channel in Proc. MILCOM, Monterey, CA, Oct./Nov. 2004 in Proc. MILCOM, Monterey, CA, Oct./Nov. 2004, pp 1060-1065..

P.Popovski and E. de Carvaloh, Improving the rates in wireless relay system through superposition coding IEEE Trans. Wireless Commun., vol. 7, no. 12,pp 4831-4836, Dec. 2008.

J.Y.Ryu , H. Seo, W.Choi, and B.H.Kim,Partial- Information relaying with per antenna superposition coding, IEEE Trans. Commun., vol. 58, no. 12, pp. 34233427, Dec. 2010.

J.Y.Ryu, and W.Choi,Balanced linear precoding in decode-and-forward based MIMO relay Communication IEEE Trans. Wireless Commun., vol.10, no 7,pp 2390-2400, Jul 2011.

A.Dembo, T.M.Cover and J.A.Thomas,Information theoretic in-equalities IEEE Trans. Information Theory vol 37, no 10, pp 1501-1518, Nov 1991.

T.Cover and J.A.Thomas, Elements of Information Theory , Second Edition.New York: Wiley 1991.

Andrea Goldsmith, Wireless communication, Cambridge University Press, 2005.