English
Related papers

Related papers: (n,K)-user Interference Channels: Degrees of Freed…

200 papers

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

This paper extends the literature on interference alignment to more general classes of deterministic channels which incorporate non-linear input-output relationships. It is found that the concept of alignment extends naturally to these…

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

In this paper, we consider the two-user single-input single-output (SISO) X-channel and $K$-user SISO X-network in fast fading environment. It is assumed that the transmitters have access to synergistic alternating channel state information…

Information Theory · Computer Science 2016-05-24 Ahmed Wagdy Shaban , Amr El-Keyi , Tamer Khattab , Mohammed Nafie

In a K-user Gaussian interference channel, it has been shown by Geng et al. that 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-12-09 Chunhua Geng , Syed A. Jafar

Interference management in a three-user interference channel with alternating connectivity with only topological knowledge at the transmitters is considered. The network has a Wyner-type channel flavor, i.e., for each connectivity state the…

Information Theory · Computer Science 2013-10-10 Soheyl Gherekhloo , Anas Chaaban , Aydin Sezgin

We investigate the age-limited capacity of the Gaussian many channel with total $N$ users, out of which a random subset of $K_{a}$ users are active in any transmission period, and a large-scale antenna array at the base station (BS). In an…

Information Theory · Computer Science 2023-08-28 Bamelak Tadele , Volodymyr Shyianov , Faouzi Bellili , Amine Mezghani , Ekram Hossain

We study the interaction between two interfering Gaussian 2-user multiple access channels. The capacity region is characterized under mixed strong--extremely strong interference and individually very strong interference. Furthermore, the…

Information Theory · Computer Science 2011-03-15 Anas Chaaban , Aydin Sezgin , Bernd Bandemer , Arogyaswami Paulraj

A combined technique of interference alignment (IA) and interference cancellation (IC), known as interference alignment and cancellation (IAC) scheme, has been proposed to improve the total achievable degrees of freedom (DoFs) over IA.…

Signal Processing · Electrical Eng. & Systems 2019-08-02 Qu Xin , Chung G. Kang

Approximate capacity regions are established for a class of interfering multiple access channels consisting of two multiple-access channels (MACs), each with an arbitrary number of transmitters, with one transmitter in each MAC causing…

Information Theory · Computer Science 2018-09-05 Yimin Pang , Mahesh K. Varanasi

Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within one bit/s/Hz. A natural goal is to apply this approach to the Gaussian interference channel with an arbitrary number of users.…

Information Theory · Computer Science 2016-11-17 Guy Bresler , Abhay Parekh , David Tse

Dimensionality requirement poses a major challenge for Interference alignment (IA) in practical systems. This work evaluates the necessary and sufficient conditions on channel structure of a fully connected general interference network to…

Information Theory · Computer Science 2016-01-25 Zainalabedin Samadi , Vahid Tabatabavakili , Farzan Haddadi

A network consisting of a point-to-point (P2P) link and a multiple access channel (MAC) sharing the same medium is considered. The resulting interference network, with three transmitters and two receivers is studied from degrees of freedom…

Information Theory · Computer Science 2011-10-05 Anas Chaaban , Aydin Sezgin

We investigate the secure degrees of freedom (SDoF) of a two-transmitter Gaussian multiple access channel with multiple antennas at the transmitters, the legitimate receiver with the existence of an unknown number of eavesdroppers each with…

Information Theory · Computer Science 2016-04-01 Mohamed Amir , Tamer Khattab , Tarek Elfouly , Amr Mohamed

In this paper, we use the linear deterministic approximation model to study a two user multiple access channel mutually interfering with a point to point link, which represents a basic setup of a cellular system. We derive outer bounds on…

Information Theory · Computer Science 2011-05-12 Jörg Bühler , Gerhard Wunder

We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer…

Information Theory · Computer Science 2011-08-09 Urs Niesen

We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their…

Information Theory · Computer Science 2019-06-11 Keerthi Suria Kumar Arumugam , Matthieu R. Bloch

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

In cognitive radio (CR) networks, there are scenarios where the secondary (lower priority) users intend to communicate with each other by opportunistically utilizing the transmit spectrum originally allocated to the existing primary (higher…

Information Theory · Computer Science 2009-11-13 Rui Zhang , Ying Chang Liang

A recent result of the authors shows a so-called I-MMSE-like relationship that, for the two-user Gaussian interference channel, an I-MMSE relationship holds in the limit, as n $\to \infty$, between the interference and the interfered-with…

Information Theory · Computer Science 2018-04-17 Ronit Bustin , H. Vincent Poor , Shlomo Shamai

We consider a single hop interference network with $K$ transmitters and $J$ receivers, all having $M$ antennas. Each transmitter emits an independent message and each receiver requests an arbitrary subset of the messages. This generalizes…

Information Theory · Computer Science 2011-11-01 Lei Ke , Aditya Ramamoorthy , Zhengdao Wang , Huarui Yin
‹ Prev 1 4 5 6 7 8 10 Next ›