arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1905.09486cs.ITmath.IT
收藏

瑞利衰落多址接入信道对称容量的简单界

Simple Bounds for the Symmetric Capacity of the Rayleigh Fading Multiple Access Channel

Elad Domanovitz, Uri Erez

AI总结:

本文研究单天线独立同分布瑞利慢衰落多址接入信道的通信问题,建立了对称速率协议可达速率分布的紧界,给出分集-复用权衡的非渐近对应结果,并提出一种实用有效编码架构。

摘要:

本文研究了所有终端均配备单天线的独立同分布瑞利慢衰落MAC(多址接入信道)上的通信问题。进一步考虑了一种通信协议:所有用户以(略低于)信道的(每用户)对称容量的速率传输,该速率由基站反馈(指定)给用户。本文对该协议所达速率的分布建立了紧界。具体而言,这些界刻画了MAC容量域的支配面包含对称速率点的概率,即所考虑的协议严格达到信道和容量的概率。该分析为多址接入信道的分集-复用权衡提供了非渐近对应结果。最后,本文证明了一种基于integer-forcing(整数强制)和空时预编码的实用方案是适用于该通信场景的有效编码架构。

英文摘要:

Communication over the i.i.d. Rayleigh slow-fading MAC is considered, where all terminals are equipped with a single antenna. Further, a communication protocol is considered where all users transmit at (just below) the symmetric capacity (per user) of the channel, a rate which is fed back (dictated) to the users by the base station. Tight bounds are established on the distribution of the rate attained by the protocol. In particular, these bounds characterize the probability that the dominant face of the MAC capacity region contains a symmetric rate point, i.e., that the considered protocol strictly attains the sum capacity of the channel. The analysis provides a non-asymptotic counterpart to the diversity-multiplexing tradeoff of the multiple access channel. Finally, a practical scheme based on integer-forcing and space-time precoding is shown to be an effective coding architecture for this communication scenario.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑