English
Related papers

Related papers: Rank Matching for Multihop Multiflow

200 papers

The problem of interference management is considered in the context of a linear interference network that is subject to long term channel fluctuations due to shadow fading. The fading model used is one where each link in the network is…

Information Theory · Computer Science 2018-07-18 Tolunay Seyfi , Yasemin Karacora , Aly El Gamal

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

Multi-antenna relays and intelligent reflecting surfaces (IRSs) have been utilized to construct favorable channels to improve the performance of wireless systems. A common feature between relay systems and IRS-aided systems is the two-hop…

Information Theory · Computer Science 2024-02-07 Zeyan Zhuang , Xin Zhang , Dongfang Xu , Shenghui Song

Capacity-achieving signaling strategies for the Gaussian wiretap MIMO channel are investigated without the degradedness assumption. In addition to known solutions, a number of new rank-deficient solutions for the optimal transmit covariance…

Information Theory · Computer Science 2016-11-15 Sergey Loyka , Charalambos D. Charalambous

In this paper, we study the degrees of freedom (DoF) of the frequency-selective K-user interference channel in the presence of an instantaneous relay (IR) with multiple receive and transmit antennas. We investigate two scenarios based on…

Information Theory · Computer Science 2021-09-21 Ali H. Abdollahi Bafghi , Mahtab Mirmohseni , Masoumeh Nasiri-Kenari

The transmission capacity of an ad-hoc network is the maximum density of active transmitters per unit area, given an outage constraint at each receiver for a fixed rate of transmission. Assuming that the transmitter locations are…

Information Theory · Computer Science 2016-11-15 Rahul Vaze , Robert W. Heath

This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower…

Information Theory · Computer Science 2013-02-08 Yuxin Chen , Jeffrey G. Andrews

While interference alignment schemes have been employed to realize the full multiplexing gain of $K$-user interference channels, the analyses performed so far have predominantly focused on the case when global channel knowledge is available…

Information Theory · Computer Science 2009-12-01 Rajesh T Krishnamachari , Mahesh K Varanasi

We consider slow fading relay channels with a single multi-antenna source-destination terminal pair. The source signal arrives at the destination via N hops through N-1 layers of relays. We analyze the diversity of such channels with fixed…

Information Theory · Computer Science 2007-08-03 Sheng Yang , Jean-Claude Belfiore

Interference networks with no channel state information at the transmitter (CSIT) except for the knowledge of the connectivity graph have been recently studied under the topological interference management (TIM) framework. In this paper, we…

Information Theory · Computer Science 2014-12-03 Xinping Yi , David Gesbert

The growing demand for broadband communications anytime, anywhere has paved the way to the usage of Unmanned Aerial Vehicles (UAVs) for providing Internet access in areas without network infrastructure and enhancing the performance of…

Networking and Internet Architecture · Computer Science 2019-12-18 André Coelho , Eduardo Nuno Almeida , José Ruela , Rui Campos , Manuel Ricardo

A general open problem in networking is: what are the fundamental limits to the performance that is achievable with some given amount of resources? More specifically, if each node in the network has information about only its $1$-hop…

Information Theory · Computer Science 2020-07-17 Ashwin Ganesan

The sum degrees of freedom (DoF) of the two-user MIMO X-channel is characterized in the presence of output feedback and delayed channel state information (CSI). The number of antennas at each transmitters is assumed to be M and the number…

Information Theory · Computer Science 2016-11-15 Ravi Tandon , Soheil Mohajer , H. Vincent Poor , Shlomo Shamai

We study the generalized degrees of freedom (gDoF) of the block-fading noncoherent diamond (parallel relay) wireless network with asymmetric distributions of link strengths, and a coherence time of T symbol duration. We first derive an…

Information Theory · Computer Science 2020-02-20 Joyson Sebastian , Suhas Diggavi

The Generalized Degrees of Freedom (GDoF) of the two user interference channel are characterized for all parameter regimes under the assumption of finite precision channel state information at the transmitters (CSIT), when a limited amount…

Information Theory · Computer Science 2019-08-05 Junge Wang , Bofeng Yuan , Lexiang Huang , Syed A. Jafar

We study a wiretap channel model where the sender has $M$ transmit antennas and there are two groups consisting of $J_1$ and $J_2$ receivers respectively. Each receiver has a single antenna. We consider two scenarios. First we consider the…

Information Theory · Computer Science 2010-03-09 Ashish Khisti

We study the sum degrees of freedom (DoF) of interference channels with hybrid beam-forming in which hybrid beam-forming composed of analog and digital precodings is employed at each node. For the two-user case, we completely characterize…

Information Theory · Computer Science 2015-04-28 Sung Ho Chae , Cheol Jeong

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

Caching is an effective technique to improve user perceived experience for content delivery in wireless networks. Wireless caching differs from traditional web caching in that it can exploit the broadcast nature of wireless medium and hence…

Information Theory · Computer Science 2017-05-16 Youlong Cao , Meixia Tao , Fan Xu , Kangqi Liu

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

Information Theory · Computer Science 2016-11-18 Jeffrey G. Andrews , Steven Weber , Marios Kountouris , Martin Haenggi