文件名称:Relay-Ordering-in-a-Multi-Hop-Cooperative-Diversi
-
所属分类:
- 标签属性:
- 上传时间:2013-05-13
-
文件大小:224.33kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Relay Ordering in a Multi-Hop Cooperative Diversity Network.pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.