摘要
针对高斯干扰信道,该文提出一种基于最大最小公平性的译码次序新算法。该算法通过采用速率分裂技术来提高系统和速率。基于该算法,推导出和速率近似最大的速率分裂层数表达式。数值结果表明,在一定干扰强度范围内的两用户对称高斯干扰信道中,采用该译码次序新算法得到的和速率较已有的贪婪算法得到的和速率有明显提高,并随着干扰强度的增加,其和速率逼近Sason给出的和速率内界。
This paper proposes a novel algorithm for determination of decoding order for the Gaussian Interference Channel （GIC） based on max-min fairness. The algorithm is developed using rate-splitting technique to improve the sum-rate of GIC. Based on the proposed algorithm, an expression of the number of rate-splitting is derived to make the stun-rate approach the maximum value in two-user GIC. Numerical results show that, in the two-user symmetric GIC, the proposed decoding order algorithm improves significantly the performance over the greedy algorithm on the two-user symmetrical GIC within a wide range of channel coefficients, and the sum-rate of the proposed scheme can approach the inner bound of Sason as increasing the interference factor on two-user symmetric GIC.
出处
《电子与信息学报》
EI
CSCD
北大核心
2013年第6期1388-1394,共7页
Journal of Electronics & Information Technology
关键词
信号处理
高斯干扰信道
译码次序
速率分裂
和速率
Signal processing
Gaussian Interference Channel （GIC）
Decoding order
Rate-splitting
Sum-rate
