English
Related papers

Related papers: Achievable Rates for the Multiple Access Channel w…

200 papers

This paper investigates achievable information rates and error exponents of mismatched decoding when the channel belongs to the class of channels that are close to the decoding metric in terms of relative entropy. For both discrete- and…

Information Theory · Computer Science 2025-05-28 Priyanka Patel , Francesc Molina , Albert Guillén i Fàbregas

This paper investigates the achievable sum rate of multiple-input multiple-output (MIMO) wireless systems employing linear minimum mean-squared error (MMSE) receivers. We present a new analytic framework which unveils an interesting…

Information Theory · Computer Science 2009-03-05 Matthew R. McKay , Iain B. Collings , Antonia M. Tulino

We consider a wireless network composed of three nodes and limited by the half-duplex and total power constraints. This formulation encompasses many of the special cases studied in the literature and allows for capturing the common features…

Information Theory · Computer Science 2007-07-13 Lifeng Lai , Ke Liu , Hesham El Gamal

In this paper we consider the achievable rate region of the Gaussian Multiple Access Channel (MAC) when suboptimal transmission schemes are employed. Focusing on the two-user MAC and assuming uncoded Pulse Amplitude Modulation (PAM), we…

Information Theory · Computer Science 2011-02-25 Rizwan Ghaffar , Dimitris Toumpakaris , Jungwon Lee

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

The problem of multicasting multiple messages with the help of a relay, which may also have an independent message of its own to multicast, is considered. As a first step to address this general model, referred to as the compound multiple…

Information Theory · Computer Science 2016-11-17 D. Gunduz , O. Simeone , A. Goldsmith , H. V. Poor , S. Shamai

Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station.…

Quantum Physics · Physics 2020-04-01 Felix Leditzky , Mohammad A. Alhejji , Joshua Levin , Graeme Smith

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

Information Theory · Computer Science 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore

In this paper, an achievable error exponent for the multiple-access channel with two independent sources is derived. For each user, the source messages are partitioned into two classes and codebooks are generated by drawing codewords from…

Information Theory · Computer Science 2018-09-06 Arezou Rezazadeh , Josep Font-Segura , Alfonso Martinez , Albert Guillén i Fàbregas

In this report, the fundamental limits of simultaneous information and energy transmission in the two-user Gaussian multiple access channel (G-MAC) with and without feedback are fully characterized. More specifically, all the achievable…

Information Theory · Computer Science 2017-03-14 Selma Belhadj Amor , Samir M. Perlaza , Ioannis Krikidis , H. Vincent Poor

We study the problem of simulating a two-user multiple-access channel (MAC) over a multiple access network of noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies of a source random variable each,…

Information Theory · Computer Science 2023-12-08 Gowtham R. Kurri , Viswanathan Ramachandran , Sibi Raj B. Pillai , Vinod M. Prabhakaran

The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless…

Information Theory · Computer Science 2023-06-13 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

Reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs) is considered. In MARCs, only the destination is interested in a reconstruction of the…

Information Theory · Computer Science 2012-07-04 Yonathan Murin , Ron Dabora , Deniz Gündüz

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

In a premier paper on the information-theoretic analysis of a two-user cognitive interference channel(CIC), Devroye et al. presented an achievable rate region for the two-user discrete memoryless CIC. The coding scheme proposed by Devroye…

Information Theory · Computer Science 2015-09-22 Mostafa Monemizadeh

In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of a relay. In this paper, we derive achievable rate regions for four new half-duplex protocols and…

Information Theory · Computer Science 2009-05-16 Sang Joon Kim , Natasha Devroye , Patrick Mitran , Vahid Tarokh

This paper provides a numerical framework for computing the achievable rate region of memoryless multiple access channel (MAC) with a continuous alphabet from data. In particular, we use recent results on variational lower bounds on mutual…

Information Theory · Computer Science 2021-11-30 Farhad Mirkarimi , Nariman Farsad

This paper studies the capacity region of asynchronous multiple access channel (MAC) with faster-thanNyquist (FTN) signaling. We first express the capacity region in the frequency domain. Next, we calculate an achievable rate region in time…

Information Theory · Computer Science 2023-04-04 Zichao Zhang , Melda Yuksel , Gokhan M. Guvensen , Halim Yanikomeroglu

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, we study the achievable…

Information Theory · Computer Science 2009-10-22 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

We consider the transmission of a common message from a transmitter to three receivers over a broadcast channel, referred to as a multicast channel in this case. All the receivers are allowed to cooperate with each other over full-duplex…

Information Theory · Computer Science 2017-02-20 Victor Exposito , Sheng Yang , Nicolas Gresset