End-to-End Performance of Randomized Distributed Space-Time Codes
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. Distributed Space-Time Codes (DSTCs) have remarkably gained interest in the research community due to the possibility of achieving spatial diversity gain through the use of relays. Such code designs require central control to coordinate all the relays in the network. However, in a large-scale distributed network enabling such a central control would require a prohibitive amount of overhead.