End-to-end performance of randomized distributed space-time codes

Abstract

The exact expressions for symbol error probability and outage probability of randomized distributed space-time codes (RDSTC) under Rayleigh fading are derived. The diversity gain derived in the literature uses the Chernoff bound which may not be achievable in general. Utilizing the exact expression, the achievable diversity gain of RDSTCs is validated. The analytical expressions are verified by Monte-Carlo simulations.

Performance Analysis of Randomized Distributed Space-Time Codes over Composite Gamma/Lognormal Fading Channels

“…In the following sections we will employ the approximated expression for the CDF of the channel gain g j provided by (8) to determine both the SEP e2e and the OP e2e of the transmission system under consideration.…”

“…Recalling [8], we can therefore express the probability of a symbol error or of an outage event X as follows…”

“…To evaluate P e2 , we have to analyze the statistical behavior of ξ, the instantaneous received SNR. If we assume as in [8] an orthogonal design of the space-time code, then ξ is given by…”

“…Following the approach undertaken in [8], we provide an approximated expression for it, that replaced in (11) allows to write the OP e2e as…”

“…In [6] and [7] approximated expressions for the outage probability are derived for uniform phase RDSTC. In [8], some of the authors of the current work began to explore the performance of relay networks employing RDSTC in the presence of Rayleigh fading: such an investigation was further extended in [9] to the case of Nakagami fading. The current work generalizes the previous findings, considering the simultaneous presence of Nakagami distributed fast fading and lognormal shadowing.…”