Simple Bounds for the Symmetric Capacity of the Rayleigh Fading Multiple Access Channel
Autor: | Elad Domanovitz, Uri Erez |
---|---|
Rok vydání: | 2020 |
Předmět: |
FOS: Computer and information sciences
Computer science business.industry Computer Science - Information Theory Information Theory (cs.IT) Applied Mathematics ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS 020206 networking & telecommunications 02 engineering and technology Topology Precoding Computer Science Applications Base station symbols.namesake Capacity planning Computer Science::Networking and Internet Architecture 0202 electrical engineering electronic engineering information engineering symbols Wireless Electrical and Electronic Engineering Rayleigh scattering business Computer Science::Information Theory Communication channel Rayleigh fading |
Zdroj: | ISIT |
ISSN: | 1558-2248 1536-1276 |
Popis: | 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. Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible |
Databáze: | OpenAIRE |
Externí odkaz: |