2011
DOI: 10.1049/el.2010.7550
|View full text |Cite
|
Sign up to set email alerts
|

Ergodic capacity of decode-and-forward relay strategies over general fast fading channels

Abstract: Proposed is a novel ergodic capacity formula for decode-and-forward (DF) relaying over a very general fast fading channel model, i.e. the channel gains of the links follow independent but non-necessarily identically distributed Nakagami-m distributions. The proposed formula is validated by Monte Carlo simulations and can be computed efficiently. Since the considered channel model is very general, the proposed formula is appropriate for evaluating the performance of DF relaying in a wide variety of realistic wi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 11 publications
0
6
0
Order By: Relevance
“…R depends on h and γ TS D depends on h and g. Note that we need to calculate the ergodic capacities for both source to relay and relay to destination links because the actual ergodic capacity is given by the minimum of C TS r and C TS d [17]. The analytical expressions for the ergodic capacities, C TS r and C TS d , are given in the following theorem.…”
Section: Throughput Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…R depends on h and γ TS D depends on h and g. Note that we need to calculate the ergodic capacities for both source to relay and relay to destination links because the actual ergodic capacity is given by the minimum of C TS r and C TS d [17]. The analytical expressions for the ergodic capacities, C TS r and C TS d , are given in the following theorem.…”
Section: Throughput Analysismentioning
confidence: 99%
“…nc,r is the variance of overall AWGN at the relay node, n PS r (1 − ρ)n a,d (k) + n a,c (k). Using (17), the SNR at the destination, γ PS d , in the PSR scheme is given by…”
Section: Throughput Analysismentioning
confidence: 99%
“…The throughput of the wireless energy harvesting–based DF relaying network shown in Figure can be written as TP=ψ2Cerg, where ψ is defined in Equation and Cerg is the ergodic capacity in bits per second per hertz, which is given as alignleftalign-1scriptCerg=min{scriptC1,scriptC2},align-2 whereby C1 and C2 are the ergodic capacity for the source‐relay link and the relay‐destination link, respectively. The ergodic capacity of the i th hop ( i =1,2, ie, source‐relay link when i =1 and relay‐destination link when i =2) can be found via -59ptCi=double-struckE[]log2(1+normalγi) alignleftalign-1=align-20fnormalγi(z)log2(1+z)dzalign-1=align-21ln(2)0fnormalγi(z)ln(1+z)dz, where double-struckEfalse[·false] is the expectation operation.…”
Section: Throughput Analysismentioning
confidence: 99%
“…Some works in existing literature have studied the performance of MIMO-STBC based DF relaying systems in terms of the end-to-end error rate [1], [2]. In the context of capacity analysis of cooperative communication, the authors in [3] have presented results for the ergodic capacity of DF relaying considering independent Nakagami-m distributed channel gains. The work in [4] presents exact expressions for the ergodic capacity of a two-hop DF cooperative system over dissimilar Rician channels with adaptive modulation.…”
Section: Ultiple-input Multiple-output (Mimo)mentioning
confidence: 99%