基于统计信道信息的并行分集信道功率加载
Power Loading in Parallel Diversity Channels Based on Statistical Channel Information
摘要:
在本文中,我们证明了存在任意数量的功率分配方案,当自由度L(例如,接收天线的数量)趋于无穷大。统计注水量--即,使用信道统计而不是瞬时信道知识的注水就是这样一种方案。我们进一步证明了统计注水算法收敛到最优功率加载方案的时间复杂度至少为O(1/(Llog(L),而其他算法的时间复杂度最差为O(1/log(L)).为了验证和证明我们的研究结果的实际用途,我们评估的互信息的示例SIMO并行信道使用模拟以及新的测量超宽带信道数据。
英文摘要:
In this paper, we show that there exists an arbitrary number of power allocation schemes that achieve capacity in systems operating in parallel channels comprised of single-input multiple-output (SIMO) Nakagami-m fading subchannels when the number of degrees of freedom L (e.g., the number of receive antennas) tends to infinity. Statistical waterfilling -- i.e., waterfilling using channel statistics rather than instantaneous channel knowledge -- is one such scheme. We further prove that the convergence of statistical waterfilling to the optimal power loading scheme is at least O(1/(L log(L))), whereas convergence of other schemes is at worst O(1/log(L)). To validate and demonstrate the practical use of our findings, we evaluate the mutual information of example SIMO parallel channels using simulations as well as new measured ultrawideband channel data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。