Relay ordering in a multi-hop cooperative diversity network
Relay ordering in a multi-hop cooperative diversity network
复制标题
DOI：
10.1109/tcomm.2009.09.070595
复制
发表时间：
2009-09
影响因子：
8.3
通讯作者：
Z. Yi;Il Kim
中科院分区：
文献类型：
--
作者：
Z. Yi;Il Kim
在本文中，我们首先提出了一个最佳中继排序算法的多分支多跳合作分集网络。该优化算法复杂度高，难以实现。因此，一个次优中继排序算法，这大大降低了复杂性，然后开发。此外，对于具有两个中继的协作网络，我们通过使用近似的端到端信噪比表达式来解析评估次优算法的性能。具体地，错误选择的近似概率和符号错误率的近似表达式被导出。分析和数值结果表明，次优算法在复杂度较低的情况下，性能优于最优算法。
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-to-end 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.