English
Related papers

Related papers: Interference Alignment for the Multi-Antenna Compo…

200 papers

The degrees of freedom (DoF) available for communication provides an analytically tractable way to characterize the information-theoretic capacity of interference channels. In this paper, the DoF of a K-user interference channel is studied…

Information Theory · Computer Science 2016-11-15 Aly El Gamal , V. Sreekanth Annapureddy , Venugopal V. Veeravalli

We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a discrete memoryless wiretap channel with a memoryless state…

Information Theory · Computer Science 2016-11-18 Ashish Khisti , Suhas Diggavi , Gregory Wornell

We study the Degrees of Freedom (DoF) of the K-user interference channel with coordinated multi-point (CoMP) transmission and reception. Each message is jointly transmitted by M_t successive transmitters, and is jointly received by M_r…

Information Theory · Computer Science 2016-11-18 V. Sreekanth Annapureddy , Aly El Gamal , Venugopal V. Veeravalli

In this paper, we characterize the degrees of freedom (DoF) for $K $-user $M \times 1 $ multiple-input single-output interference channels with reconfigurable antennas which have multiple preset modes at the receivers, assuming linear…

Information Theory · Computer Science 2016-02-15 Heecheol Yang , Wonjae Shin , Jungwoo Lee

We study the degrees of freedom (DOF) of a multiple-input multiple-output (MIMO) two-way X relay channel, where there are two groups of source nodes and one relay node, each equipped with multiple antennas, and each of the two source nodes…

Information Theory · Computer Science 2015-06-11 Zhengzheng Xiang , Meixia Tao , Jianhua Mo , Xiaodong Wang

The $K\times 2$ and $2\times K$, Multiple-Input Multiple-Output (MIMO) X channel with constant channel coefficients available at all transmitters and receivers is considered. A new alignment scheme, named \emph{layered interference…

Information Theory · Computer Science 2014-12-24 Seyyed Hassan Mahboubi , Mumtaz Hussain , Abolfazl Seyed Motahari , Amir Keyvan Khandani

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 consider the $K$-user Multiple Input Multiple Output (MIMO) Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver. It is assumed that channel coefficients are constant and are available at…

Information Theory · Computer Science 2016-11-15 Akbar Ghasemi , Abolfazl Seyed Motahari , Amir Keyvan Khandani

We investigate the secure degrees of freedom (SDoF) of the K-user MIMO multiple access (MAC) and the two user MIMO interference channel. An unknown number of eavesdroppers are trying to decode the messages sent by the transmitters. Each…

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

We explore the degrees of freedom of $M\times N$ user wireless $X$ networks, i.e. networks of $M$ transmitters and $N$ receivers where every transmitter has an independent message for every receiver. We derive a general outerbound on the…

Information Theory · Computer Science 2007-11-20 Viveck R. Cadambe , Syed A. Jafar

This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be…

Information Theory · Computer Science 2011-06-21 Yeow-Khiang Chia , Abbas El Gamal

We study the Gaussian MIMOME wiretap channel where a transmitter wishes to communicate a confidential message to a legitimate receiver in the presence of eavesdroppers, while the eavesdroppers should not be able to decode the confidential…

Information Theory · Computer Science 2016-03-08 Sina Lashgari , Amir Salman Avestimehr

In this paper, the 3-user multiple-input multiple-output Gaussian interference channel with M antennas at each transmitter and N antennas at each receiver is considered. It is assumed that the channel coefficients are constant and known to…

Information Theory · Computer Science 2011-05-23 Mohamed Amir , Amr El-Keyi , Mohammed Nafie

The degrees of freedom (DoF) of an X-network with M transmit and N receive nodes utilizing interference alignment with the support of $J$ relays each equipped with $L_j$ antennas operating in a half-duplex non-regenerative mode is…

Information Theory · Computer Science 2013-09-16 Daniel Frank , Karlheinz Ochs , Aydin Sezgin

This paper investigates the downlink channels in multi-cell multi-user interfering networks. The goal is to propose close-form designs to obtain degrees of freedom (DoF) in high SNR region for the network composed of base stations (BS) as…

Information Theory · Computer Science 2012-11-20 Haichuan Zhou , Tharm Ratnarajah

In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state…

Cryptography and Security · Computer Science 2013-05-17 Mohsen Bahrami , Ali Bereyhi , Sadaf Salehkalaibar , Mohammad Reza Aref

We consider vector space interference alignment strategies over the $K$-user interference channel and derive an upper bound on the achievable degrees of freedom as a function of the channel diversity $L$, where the channel diversity is…

Information Theory · Computer Science 2016-09-08 Cheuk Ting Li , Ayfer Özgür

We provide innerbound and outerbound for the total number of degrees of freedom of the $K$ user multiple input multiple output (MIMO) Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver if…

Information Theory · Computer Science 2008-09-02 Tiangao Gou , Syed A. Jafar

An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound…

Information Theory · Computer Science 2023-06-27 Johannes Rosenberger , Abdalla Ibrahim , Boulat A. Bash , Christian Deppe , Roberto Ferrara , Uzi Pereg

In this paper, we consider the K-user interference channel with partial cooperation, where a strict subset of the K users cooperate. For the K-user interference channel with cooperating subsets of length M, the outer bound of the total…

Information Theory · Computer Science 2011-06-02 Ahmed A. Naguib , Khaled Elsayed , Mohammed Nafie