Title:
Relay-Ordering-in-a-Multi-Hop-Cooperative-Diversi
Download
Description: In this paper, we first propose an optimum relay ordering algorithm for the multi-branch multi-hop cooperative diversity networks. This optimum algorithm has a high complexity that makes it hard to implement. Therefore, a suboptimum relay ordering algorithm, which considerably reduces the complexity, is then developed. Furthermore, for a cooperative network with two relays, we analytically evaluate the performance of the suboptimum algorithm by using an approximate end-toend signal-to-noise ratio expression. Specifically, an approximate probability of wrong selection and an approximate expression of the symbol error rate are derived. The analysis and the numerical results demonstrate that the suboptimum algorithm performs very well as the optimum one at a much lower complexity.
To Search:
File list (Check if you may need any files):
Relay Ordering in a Multi-Hop Cooperative Diversity Network.pdf
