English
Related papers

Related papers: The two-user Gaussian interference channel: a dete…

200 papers

In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Costa entropy power inequality (EPI) along with an…

Information Theory · Computer Science 2009-01-01 Amin Jafarian , Sriram Vishwanath

A new problem formulation is presented for the Gaussian interference channels (GIFC) with two pairs of users, which are distinguished as primary users and secondary users, respectively. The primary users employ a pair of encoder and decoder…

Information Theory · Computer Science 2016-11-17 Xiujie Huang , Xiao Ma , Lei Lin , Baoming Bai

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

Information Theory · Computer Science 2013-03-11 Fangfang Zhu , Biao Chen

Gaussian quantum channels are well understood and have many applications, e.g., in Quantum Information Theory and in Quantum Optics. For more general quantum channels one can in general use semiclassical approximations or perturbation…

Quantum Physics · Physics 2023-05-16 Daniel Speed , Wenyang Lyu , Roman Schubert

Deterministic identification (DI) is addressed for Gaussian channels with fast and slow fading, where channel side information is available at the decoder. In particular, it is established that the number of messages scales as…

Information Theory · Computer Science 2021-10-12 Mohammad J. Salariseddigh , Uzi Pereg , Holger Boche , Christian Deppe

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 this paper, the capacity region of the linear deterministic interference channel with noisy channel-output feedback (LD-IC-NF) is fully characterized. The proof of achievability is based on random coding arguments and rate splitting;…

Information Theory · Computer Science 2018-05-22 Victor Quintero , Samir M. Perlaza , Iñaki Esnaola , Jean-Marie Gorce

Many communication applications incorporate event-triggered behavior, where the conventional Shannon capacity may not effectively gauge performance. Consequently, we advocate for the concept of identification capacity as a more suitable…

Information Theory · Computer Science 2025-02-04 Ilya Vorobyev , Christian Deppe , Holger Boche

This paper investigates the capacity of a communications channel that, in addition to additive white Gaussian noise, also suffers from interference caused by a co-existing radar transmission. The radar interference (of short duty-cycle and…

Information Theory · Computer Science 2018-10-16 Sara Shahi , Daniela Tuninetti , Natasha Devroye

The paper establishes the optimal generalized degrees of freedom (GDOF) of 3-user $M \times N$ multiple-input multiple-output (MIMO) Gaussian interference channel (GIC) in which each transmitter has $M$ antennas and each receiver has $N$…

Information Theory · Computer Science 2012-08-29 Jung Hyun Bae , Jungwon Lee , Inyup Kang

A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for…

Information Theory · Computer Science 2007-08-22 Yingbin Liang , H. Vincent Poor

It is common practice to collect observations of feature and response pairs from different environments. A natural question is how to identify features that have consistent prediction power across environments. The invariant causal…

Information Theory · Computer Science 2022-07-01 Austin Goddard , Yu Xiang , Ilya Soloveychik

A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this…

Information Theory · Computer Science 2016-11-18 Xiaohu Shang , Gerhard Kramer , Biao Chen

A two-user Gaussian Z-Interference Channel (GZIC) is considered, in which encoders are connected through noiseless links with finite capacities. In this setting, prior to each transmission block the encoders communicate with each other over…

Information Theory · Computer Science 2010-05-28 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

We consider a state-dependent parallel Gaussian channel with independent states and a common cognitive helper, in which two transmitters wish to send independent information to their corresponding receivers over two parallel subchannels.…

Information Theory · Computer Science 2018-10-30 Michael Dikshtein , Ruchen Duan , Yingbin Liang , Shlomo Shamai

The capacity of a class of Interference Relay Channels (IRC) -the Injective Semideterministic IRC where the relay can only observe one of the sources- is investigated. We first derive a novel outer bound and two inner bounds which are based…

Information Theory · Computer Science 2016-09-28 Germán Bassi , Pablo Piantanida , Sheng Yang

This paper considers the minimization of transmit power in Gaussian parallel interference channels, subject to a rate constraint for each user. To derive decentralized solutions that do not require any cooperation among the users, we…

Information Theory · Computer Science 2011-11-09 Jong-Shi Pang , Gesualdo Scutari , Francisco Facchinei , Chaoxiong Wang

We establish lower and upper bounds for the identification capacity of discrete-time Gaussian channels subject to inter-symbol interference (ISI), a canonical model in wireless communication. Our analysis accounts for deterministic encoders…

Information Theory · Computer Science 2026-05-04 Mohammad Javad Salariseddigh , Christian Deppe

The additivity of the minimal output entropy and that of the $\chi$-capacity are known to be equivalent for finite-dimensional irreducibly covariant channels. In this paper we formulate a list of conditions allowing to establish similar…

Quantum Physics · Physics 2018-12-12 A. S. Holevo

This paper studies the two-user interference channel with unilateral source cooperation, which consists of two source-destination pairs that share the same channel and where one full-duplex source can overhear the other source through a…

Information Theory · Computer Science 2016-11-17 Martina Cardone , Daniela Tuninetti , Raymond Knopp , Umer Salim