English
Related papers

Related papers: Two-User Erasure Interference Channels with Local …

200 papers

We study the discrete memoryless Z-interference channel (ZIC) where the transmitter of the pair that suffers from interference is cognitive. We first provide an upper bound on the capacity of this channel. We then show that, when the…

Information Theory · Computer Science 2012-02-16 Nan Liu , Ivana Maric , Yinghui Cheng , Andrea J. Goldsmith , Shlomo Shamai

This paper derives an outer bound on the capacity region of a general memoryless interference channel with an arbitrary number of users. The derivation follows from a generalization of the techniques developed by Kramer and by Etkin et al…

Information Theory · Computer Science 2016-11-17 Daniela Tuninetti

Interference is a major issue limiting the performance in wireless networks. Cooperation among receivers can help mitigate interference by forming distributed MIMO systems. The rate at which receivers cooperate, however, is limited in most…

Information Theory · Computer Science 2009-11-12 I-Hsiang Wang , David N. C. Tse

In this paper, we investigate the half-duplex cooperative communication scheme of a two user Gaussian interference channel. We develop achievable region and outer bound for the case when the system allow either transmitter or receiver…

Information Theory · Computer Science 2009-01-20 Yong Peng , Dinesh Rajan

We consider the MIMO (multiple-input multiple-output) Gaussian interference channel with i.i.d. fading across antennas and channel uses and with the delayed local channel state information at the transmitters (CSIT). For the two-user case,…

Information Theory · Computer Science 2015-03-19 Akbar Ghasemi , Abolfazl Seyed Motahari , Amir Keyvan Khandani

The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…

Information Theory · Computer Science 2025-08-12 Reza K. Farsani , Wei Yu

We introduce the two user finite state compound Gaussian interference channel and characterize its capacity region to within one bit. The main contributions involve both novel inner and outer bounds. The inner bound is multilevel…

Information Theory · Computer Science 2008-05-01 Adnan Raja , Vinod M. Prabhakaran , Pramod Viswanath

We study the discrete memoryless Z-interference channel (ZIC) where the transmitter of the pair that suffers from interference is cognitive. We first provide upper and lower bounds on the capacity of this channel. We then show that, when…

Information Theory · Computer Science 2008-12-04 Nan Liu , Ivana Maric , Andrea Goldsmith , Shlomo Shamai

In this paper, we consider a two-user multiple access fading channel under quality-of-service (QoS) constraints. We initially formulate the transmission rates for both transmitters, where the transmitters have arbitrarily distributed input…

Information Theory · Computer Science 2016-08-08 Marwan Hammouda , Sami Akin , Jürgen Peissig

Several channels with asynchronous side information are introduced. We first consider single-user state-dependent channels with asynchronous side information at the transmitter. It is assumed that the state information sequence is a…

Information Theory · Computer Science 2016-01-19 Michal Yemini , Anelia Somekh-Baruch , Amir Leshem

This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. A special class of two-user Gaussian interference channels (IFCs) is…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

The capacity region of multi-pair bidirectional relay networks, in which a relay node facilitates the communication between multiple pairs of users, is studied. This problem is first examined in the context of the linear shift deterministic…

Information Theory · Computer Science 2016-11-17 Aydin Sezgin , A. Salman Avestimehr , M. Amin Khajehnejad , Babak Hassibi

In a two-user channel, completion time refers to the number of channel uses spent by each user to transmit a bit pool with some given size. In this paper, the information-theoretic formulation of completion time is based on the concept of…

Information Theory · Computer Science 2015-08-04 Yuanpeng Liu , Elza Erkip

Two-way communication is prevalent and its fundamental limits are first studied in the point-to-point setting by Shannon [1]. One natural extension is a two-way interference channel (IC) with four independent messages: two associated with…

Information Theory · Computer Science 2017-09-05 Changho Suh , Jaewoong Cho , David Tse

We investigate the delay limited secrecy capacity of the flat fading channel under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main…

Information Theory · Computer Science 2016-11-17 Karim Khalil , O. Ozan Koyluoglu , Hesham El Gamal , Moustafa Youssef

We generalize the problem of controlling the interference created to an external observer while communicating over a discrete memoryless channel (DMC) which was studied in \cite{serrano:2014}. In particular, we consider the scenario where…

Information Theory · Computer Science 2021-06-04 Michail Mylonakis , Photios A. Stavrou , Mikael Skoglund

Distribution-preserving integrated sensing and communication with secure reconstruction is investigated in this paper. In addition to the distortion constraint, we impose another constraint on the distance between the reconstructed sequence…

Information Theory · Computer Science 2024-07-11 Yiqi Chen , Tobias Oechtering , Holger Boche , Mikael Skoglund , Yuan Luo

We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Shlomo Shamai , Pablo Piantanida , Luc Vandendorpe

This third part of the paper is related to the study of information flow in networks with strong interference. First, the two-receiver networks are considered. A unified outer bound for the capacity region of these networks is established.…

Information Theory · Computer Science 2013-02-18 Reza K. Farsani

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

Information Theory · Computer Science 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor
‹ Prev 1 4 5 6 7 8 10 Next ›