English
Related papers

Related papers: Approximate Sum-Capacity of K-user Cognitive Inter…

200 papers

While the best known outerbound for the K user interference channel states that there cannot be more than K/2 degrees of freedom, it has been conjectured that in general the constant interference channel with any number of users has only…

Information Theory · Computer Science 2007-07-13 Viveck R. Cadambe , Syed A. Jafar

In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…

Information Theory · Computer Science 2021-04-29 Zheng Li , Sheng Yang , Shlomo Shamai

The degrees-of-freedom of a K-user Gaussian interference channel (GIFC) has been defined to be the multiple of (1/2)log_2(P) at which the maximum sum of achievable rates grows with increasing P. In this paper, we establish that the…

Information Theory · Computer Science 2009-01-14 Raul Etkin , Erik Ordentlich

Gaussian channels with memory and with noiseless feedback have been widely studied in the information theory literature. However, a coding scheme to achieve the feedback capacity is not available. In this paper, a coding scheme is proposed…

Information Theory · Computer Science 2007-07-13 Jialing Liu , Nicola Elia

Feedback is shown to increase the sum-rate capacity of K-user Gaussian multiple-access channels by at most a factor of approximately 1.54, improving Thomas' doubling bound (1987). The new bound is the best possible in the sense that it can…

Information Theory · Computer Science 2021-08-24 Gerhard Kramer

We investigate message identification over a K-sender Gaussian multiple access channel (K-GMAC). Unlike conventional Shannon transmission codes, the size of randomized identification (ID) codes experiences a doubly exponential growth in the…

Information Theory · Computer Science 2024-08-20 Yaning Zhao , Wafa Labidi , Holger Boche , Eduard Jorswieck , Christian Deppe

This paper studies the capacity of the two-user intensity-modulation/direct-detection (IM/DD) interference channel (IC), which is relevant in the context of multi-user optical wireless communications. Despite some known single-letter…

Information Theory · Computer Science 2022-07-05 Zhenyu Zhang , Anas Chaaban

We consider a $K$-user multiple-input single-output (MISO) broadcast channel (BC) where the channel state information (CSI) of user $i(i=1,2,\ldots,K)$ may be instantaneously perfect (P), delayed (D) or not known (N) at the transmitter with…

Information Theory · Computer Science 2016-01-28 Borzoo Rassouli , Chenxi Hao , Bruno Clerckx

In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of…

Information Theory · Computer Science 2011-02-23 K. G. Nagananda , Chandra R. Murthy

The feedback capacity of the stationary Gaussian additive noise channel has been open, except for the case where the noise is white. Here we find the feedback capacity of the stationary first-order moving average additive Gaussian noise…

Information Theory · Computer Science 2007-07-16 Young-Han Kim

The capacity region of the interference channel in which one transmitter non-causally knows the message of the other, termed the cognitive interference channel, has remained open since its inception in 2005. A number of subtly differing…

Information Theory · Computer Science 2015-03-13 Stefano Rini , Daniela Tuninetti , Natasha Devroye

The InterFerence Channel with a Cognitive Relay (IFC-CR) consists of a classical two-user interference channel in which the two independent messages are also non-causally known at a cognitive relay node. In this work a special class of…

Information Theory · Computer Science 2011-02-17 Stefano Rini , Daniela Tuninetti , Natasha Devroye

This study investigates the capacity region of a three-user cognitive radio network with two primary users and one cognitive user. A three-user Cognitive Interference Channel (C-IFC) is proposed by considering a three-user Interference…

Information Theory · Computer Science 2012-06-20 Mahtab Mirmohseni , Bahareh Akhbari , Mohammad Reza Aref

It has been shown recently by Geng et al. that in a $K$ user Gaussian interference network, if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest…

Information Theory · Computer Science 2014-01-14 Hua Sun , Syed A. Jafar

The interference channel with common information (IC-CI) consists of two transmit-receive pairs that communicate over a common noisy medium. Each transmitter has an individual message for its paired receiver, and additionally, both…

Information Theory · Computer Science 2012-03-01 Chinmay S. Vaze , Mahesh K. Varanasi

In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…

Information Theory · Computer Science 2015-12-17 Reza K. Farsani , Amir K. Khandani

This paper studies the achievable rate region of the K-user Gaussian multiple-input single-output interference channel (MISO-IC) with the interference treated as noise, when improper or circularly asymmetric complex Gaussian signaling is…

Information Theory · Computer Science 2013-10-10 Yong Zeng , Rui Zhang , Erry Gunawan , Yong Liang Guan

We consider the communication scenario where multiple cognitive users wish to communicate to the same receiver, in the presence of primary transmission. The cognitive transmitters are assumed to have the side information about the primary…

Information Theory · Computer Science 2007-07-13 Peng Cheng , Guanding Yu , Zhaoyang Zhang , Hsiao-Hwa Chen , Peiliang Qiu

This paper investigates the linear precoder design for $K$-user interference channels of multiple-input multiple-output (MIMO) transceivers under finite alphabet inputs. We first obtain general explicit expressions of the achievable rate…

Information Theory · Computer Science 2016-11-18 Yongpeng Wu , Chengshan Xiao , Xiqi Gao , John D. Matyjas , Zhi Ding

We consider the $N$-user broadcast erasure channel with $N$ unicast sessions (one for each user) where receiver feedback is regularly sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the…

Information Theory · Computer Science 2016-11-17 Marios Gatzianas , Leonidas Georgiadis , Leandros Tassiulas