Results 261 to 270 of about 17,499,756 (289)
Some of the next articles are maybe not open access.
Bitloading for the SIMO multiple access channel
14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003., 2004In this paper we investigate the multi-user SIMO multiple access channel. We derive the functions describing the achievable sum rule in a given channel. The mathematical behavior with and without successive interference cancellation is discussed. Furthermore we show that a practical rate prediction based on the well known SNR gap concept might be ...
Thomas Haustein +2 more
openaire +2 more sources
1998
In the preceding three chapters, we develop and apply the compressed-error-cancellation framework to the single-user case, i.e., the situation in which a single transmitter must send data to a single receiver. But often in practice, multiple transmitters must simultaneously send data to multiple receivers.
openaire +1 more source
In the preceding three chapters, we develop and apply the compressed-error-cancellation framework to the single-user case, i.e., the situation in which a single transmitter must send data to a single receiver. But often in practice, multiple transmitters must simultaneously send data to multiple receivers.
openaire +1 more source
Variations on the Gaussian Multiple-Access Channel
2007 IEEE International Symposium on Information Theory, 2007This paper studies two models derived from the Gaussian Multiple-Access Channel. In each, information is sent by energy modulation, rather than on the complex signal amplitude. For continuous energy, the model is the additive exponential noise (AEN) channel, whose capacity region equals that of the equivalent Gaussian channel at identical noise and ...
openaire +1 more source
Resolvability theory for the multiple-access channel
IEEE Transactions on Information Theory, 1998Summary: We study the randomness needed for approximating the output distribution of a multiple-access channel, where the original input processes are independent of each other. The approximation is achieved by simulating (possibly alternative) input processes at each of the entries, where the sources of randomness available for the simulators are ...
openaire +1 more source
Jamming in fading Multiple Access Channels
2015 Twenty First National Conference on Communications (NCC), 2015A fading Multiple Access Channel with a jammer is considered and a non-cooperative game between the two users and the jammer is formulated. Here, both the user-receiver links as well as the jammer-receiver link are time-varying fading links. The decoder employed is a successive cancellation decoder.
openaire +2 more sources
Commitment over Multiple-Access Channels
2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2022Rémi A. Chou, Matthieu R. Bloch
openaire +2 more sources
A rate-splitting approach to the Gaussian multiple-access channel
IEEE Transactions on Information Theory, 1996Rüdiger Urbanke
exaly
Channel Capacity Analysis of Non-Orthogonal Multiple Access With OAM-MIMO System
IEEE Wireless Communications Letters, 2020Soo Young Shin, Ahmed Al Amin
exaly

