English
Related papers

Related papers: On the Symmetric $K$-user Interference Channels wi…

200 papers

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

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

This paper studies the achievable rates of Gaussian interference channels with additive white Gaussian noise (AWGN), when improper or circularly asymmetric complex Gaussian signaling is applied. For the Gaussian multiple-input…

Information Theory · Computer Science 2016-11-18 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

We study deterministic approximations of the Gaussian two-user multiple access wiretap channel (G-MAC-WT) and the Gaussian wiretap channel with a helper (G-WT-H). These approximations enable results beyond the recently shown 2/3 and 1/2…

Information Theory · Computer Science 2018-04-24 Rick Fritschek , Gerhard Wunder

A coding scheme with scalar lattices is applied to K-receiver, Gaussian, vector broadcast channels with K independent messages, one for each receiver. The method decomposes each receiver channel into parallel scalar channels with known…

Information Theory · Computer Science 2024-04-25 M. Yusuf Şener , Gerhard Kramer , Shlomo Shamai , Ronald Böhnke , Wen Xu

This paper considers the two-user Gaussian Causal Cognitive Interference Channel (GCCIC), which consists of two source-destination pairs that share the same channel and where one full-duplex cognitive source can causally learn the message…

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

In this paper, we study the achievable rate region of Gaussian multiuser channels with the messages transmitted being from finite input alphabets and the outputs being {\em quantized at the receiver}. In particular, we focus on the…

Information Theory · Computer Science 2011-02-15 Suresh Chandrasekaran , Saif K. Mohammed , A. Chockalingam

The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop…

Information Theory · Computer Science 2015-02-17 Ritesh Kolte , Ayfer Özgür , Haim Permuter

Interference alignment is degree of freedom optimal in K -user MIMO interference channels and many previous works have studied the transceiver designs. However, these works predominantly focus on networks with perfect channel state…

Information Theory · Computer Science 2015-06-15 Xiongbin Rao , Liangzhong Ruan , Vincent K. N. Lau

We characterize the capacity region of the symmetric injective K-user Deterministic Interference Channel (DIC) for all channel parameters. The achievable rate region is derived by first projecting the achievable rate region of Han-Kobayashi…

Information Theory · Computer Science 2017-05-02 Mehrdad Kiamari , A. Salman Avestimehr

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

In this paper, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output feedback (G-IC-NOF) are presented. The achievability region is obtained using a random coding argument and…

Information Theory · Computer Science 2016-11-18 Victor Quintero , Samir M. Perlaza , Iñaki Esnaola , Jean-Marie Gorce

In this paper, we focus on the two-user Gaussian interference channel (GIC), and study the Han-Kobayashi (HK) coding/decoding strategy with the objective of designing low-density parity-check (LDPC) codes. A code optimization algorithm is…

Information Theory · Computer Science 2014-05-27 Shahrouz Sharifi , A. Korhan Tanc , Tolga M. Duman

In interference channels, channel state information (CSI) can be exploited to reduce the interference signal dimensions and thus achieve the optimal capacity scaling, i.e. degrees of freedom, promised by the interference alignment…

Information Theory · Computer Science 2017-01-03 Zhinan Xu , Markus Hofer , Thomas Zemen

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra

Interference alignment is a key technique for communication scenarios with multiple interfering links. In several such scenarios, interference alignment was used to characterize the degrees-of-freedom of the channel. However, these…

Information Theory · Computer Science 2015-03-19 Urs Niesen , Mohammad Maddah-Ali

In this paper, we revisit the problem of finding the average capacity of the Gaussian feedback channel. First, we consider the problem of finding the average capacity of the analog Gaussian noise channel where the noise has an arbitrary…

Information Theory · Computer Science 2019-01-24 Ather Gattami

The capacity of the two-user Gaussian interference channel has been open for thirty years. The understanding on this problem has been limited. The best known achievable region is due to Han-Kobayashi but its characterization is very…

Information Theory · Computer Science 2007-07-13 Raul Etkin , David Tse , Hua Wang

We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a scheme called Distributed Rate Splitting to achieve the…

Information Theory · Computer Science 2016-11-18 Jian Cao , Edmund M. Yeh

The cognitive interference channel (C-IFC) consists of a classical two-user interference channel in which the message of one user (the "primary" user) is non-causally available at the transmitter of the other user (the "cognitive" user). We…

Information Theory · Computer Science 2016-11-18 Stefano Rini , Daniela Tuninetti , Natasha Devroye

The energy-optimal scheme is found for communicating one bit over a memoryless Gaussian channel with an ideal feedback channel. It is assumed that the channel is allowed to be used at most N times before decoding. The optimal…

Information Theory · Computer Science 2016-05-17 Bo Bernhardsson , Ather Gattami
‹ Prev 1 3 4 5 6 7 10 Next ›