Results 231 to 240 of about 437,781 (261)

Mismatched decoding and the multiple-access channel

IEEE Transactions on Information Theory, 1996
An achievable region is derived for the multiple-access channel under decoding mismatch conditions. It is shown that achievable rates higher than the random coding capacity of the single-user mismatched channel can sometimes be demonstrated by treating the single-user channel as a multiple-access channel. Refining these ideas we derive a lower bound on
openaire   +1 more source

The multiple access channel with an untrusted relay

2014 IEEE Information Theory Workshop (ITW 2014), 2014
This paper considers a Gaussian multiple access channel aided by a relay. Specifically, the relay facilitates communication between multiple sources and a destination to which the sources have no direct link. In this set up, the relay node is considered to be untrusted, i.e., honest but curious, from whom the source messages need to be kept secret.
Ahmed A. Zewail, Aylin Yener
openaire   +1 more source

Extending the capacity of multiple access channels

IEEE Communications Magazine, 2000
Multiple access techniques which allow a communication medium to be shared between different users represent one of the most challenging topics in digital communications. In terms of the number of users that can be accommodated on a given channel, there are two distinct classes of multiple access techniques. The first class includes the well-known FDMA,
Hikmet Sari, Frederik Vanhaverbeke, Marc Moeneclaey   +2 more
openaire   +1 more source

On multiple access channels with asymmetric feedback

2008 IEEE International Symposium on Information Theory, 2008
In multiuser systems, the downlink capacity to different users is often different due to the near-far effect. We capture this asymmetry in the feedback link by introducing an asymmetric feedback model where different users get different amount of channel feedback from the base-station.
Vaneet Aggarwal, Ashutosh Sabharwal
openaire   +1 more source

Bitloading for the SIMO multiple access channel

14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003., 2004
In 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, Holger Boche, Gerhard Lehmann   +2 more
openaire   +1 more source

On the capacity of multiplicative multiple access channels with AWGN

2011 IEEE Information Theory Workshop, 2011
We consider a multiplicative multiple access channel in the presence of additive white Gaussian noise. Under individual average power constraints at each of the transmitters, we characterize the capacity region of this channel. The structure of the region reveals some fundamental characteristics related to timesharing, power constraints and the ...
openaire   +1 more source

Jamming in fading Multiple Access Channels

2015 Twenty First National Conference on Communications (NCC), 2015
A 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   +1 more source

Multiple-Access Channels

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

Universal coding for multiple access channels

IEEE Transactions on Information Theory, 1981
The problems of universal coding and decoding for multiple-access channels are examined. The hypothetical mutual information functions are used to prove that rate vectors R=(R_{1},R_{2}) in a subregion \hat{\cal C} of the capacity region \cal C are universally achievable in the sense that there exist codes of rate R that are asymptotically optimum for ...
openaire   +2 more sources

Commitment over Multiple-Access Channels

2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2022
Rémi A. Chou, Matthieu R. Bloch
openaire   +1 more source