Performance Analysis for Multi-Way Relaying in Rician Fading Channels
Performance Analysis for Multi-Way Relaying in Rician Fading Channels
复制标题
DOI：
10.1109/tcomm.2015.2477085
复制
发表时间：
2015-09
影响因子：
8.3
通讯作者：
J. Xue;M. Sellathurai;T. Ratnarajah;Zhiguo Ding
中科院分区：
文献类型：
--
作者：
J. Xue;M. Sellathurai;T. Ratnarajah;Zhiguo Ding
在本文中，多路中继的情况下，考虑与M个用户谁想要交换他们的信息与彼此的帮助下，N个中继（N M）。任何两个用户之间都没有直接的传输通道。特别地，所有用户在第一时隙中向所有中继站发送它们的信号，并且随后选择M - 1个中继站在随后的M - 1个时隙期间向所有用户广播它们的混合信号。与单个中继的传输相比，多路中继场景将传输时间从2 M时隙显著减少到M时隙。随机和半正交继电器的选择。在用户和中继之间考虑了Rician衰落信道，首先分析了基于随机中继选择的有效信道增益的统计特性，得到了该中继协议的中断概率和遍历和速率的解析表达式.此外，遍历和速率的近似在高信噪比政权的推导。此外，系统的分集阶数的随机和半正交中继选择进行了研究。同时，当中继节点被随机分成L组（每组M - 1个中继节点）时，平均信道增益最大的中继节点组可以获得分集阶数L，并且随着中继节点数目的增加，分集阶数L会增加。此外，当采用半正交选择（SS）算法来选择具有半正交信道的中继时，该系统将保证所有用户都能成功地解码其他信息。利用极值理论研究了半正交中继选择后信道增益的最大值，得到了严格的上下界。仿真结果表明，推导的表达式是准确的。
In this paper, the multi-way relaying scenario is considered with M users who want to exchange their information with each other with the help of N relays (N ≫ M) among them. There are no direct transmission channels between any two users. Particularly, all users transmit their signals to all relays in the first time slot and M - 1 relays are selected later to broadcast their mixture signals during the following M - 1 time slots to all users. Compared to the transmission with the help of single relay, the multi-way relaying scenario reduces the transmit time significantly from 2M to M time slots. Random and semiorthogonal relays selections are applied. Rician fading channels are considered between the users and relays, and analytical expressions for the outage probability and ergodic sum rate for the proposed relaying protocol are developed by first characterizing the statistical property of the effective channel gain based on random relays selection. Also, the approximation of ergodic sum rate at high signal-to-noise ratio regime is derived. In addition, the diversity order of the system is investigated for both random and semiorthogonal relay selections. Meanwhile, it is shown that when the relays are randomly separated into L groups of M - 1 relays, the group with maximum average channel gain can achieve the diversity order L, which will increase when more relays considered in the scheme. Furthermore, when semiorthogonal selection (SS) algorithm is applied to select the relays with semiorthogonal channels, it is shown that the system will guarantee that all the users can decode the others information successfully. Moreover, the maximum of channel gain after semiorthogonal relays selection is investigated by using extreme value theory, and tight lower and upper bounds are derived. Simulation results demonstrate that the derived expressions are accurate.