Capacity Analysis for Path Selection Based DF MIMO-OSTBC Cooperative Wireless Systems

Abstract

In this paper, we analyze the ergodic capacity of a path selection based Decode-and-Forward (DF) MIMO-OSTBC cooperative wireless system. Closed form expressions are derived for the ergodic capacity considering the availability of full as well as partial CSI at the source. Simulation results are presented to demonstrate the ergodic capacity of the MIMO-OSTBC DF cooperative relaying system and verify the analytical expressions derived. Interestingly, it is observed that while the availability of full CSI at the source generally leads to a higher capacity, its performance gain over the scenario with partial CSI is only marginal when either the source-destination or source-relay link is relatively strong.Index Terms-Cooperative communication, decode-andforward (DF), ergodic capacity, multiple-input multiple-output (MIMO), path selection, OSTBC.

PEP and OP examination of relaying network over time-selective fading channel

“…Applying expectation operator E {.} over the SNR along with the assumption that fading links are i.n.i.d., the average PEP of the erroneous event B s (t) → B i (t) at the receiving terminal can be expressed as [48,49], (26)…”

“…Since we consider that the source-to-bth relay fading links are i.n.i.d., expression given in (27) can be further simplified as where E P b ( t j (b)∕ ) denotes the expected probability of bth relay being in the state t j (b) and can be shown in relations of expected PEP of erroneous event B s (t) → B l (t) is expressed as [48,49],…”

“…Substituting 29into (28), the average error probability expression for the relaying network being in the state t j (b) is given as The set b ∈ t j and b ∈̄t j includes all the relays, which decodes the code word matrix B s (t) successfully and unsuccessfully, respectively. Let us consider each relay is transmitted from set t j , at the destination node, instantaneous PEP of the erroneous event B s (t) → B i (t), when the system is in state t j is given as [48],…”

Optimal Routing for Multi-User Multi-Hop Relay Networks Via Dynamic Programming

“…In [16], Meijer's function is used to derive an analytical expression for the achievable rate of a dual-hop relay network with a single relay node under the Rician fading distribution. This was later extended to a multiple antenna dualhop relay network in [17] and to a relay network with multiple relay nodes in [18]. In [18], the authors use Marcum Q-function to analyze the ergodic capacity of a single-user, dual hop relay network with multiple relay nodes under the Rician fading environment.…”