English
Related papers

Related papers: Resolving Entanglements in Topological Interferenc…

200 papers

Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two user Gaussian interference…

Information Theory · Computer Science 2009-02-15 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

This work presents an analytical framework for characterizing the performance of cooperative and noncooperative spectrum sensing schemes by figuring out the tradeoff between the achieved diversity and coding gains in each scheme. Based on…

Networking and Internet Architecture · Computer Science 2016-11-15 Ahmed M. Alaa , Mahmoud H. Ismail , Hazim Tawfik

We consider the two-hop interference channel (IC), which consists of two source-destination pairs communicating with each other via two relays. We analyze the degrees of freedom (DoF) of this network when the relays are restricted to…

Information Theory · Computer Science 2016-11-18 Ibrahim Issa , Silas L. Fong , A. Salman Avestimehr

Characterizing the capacity region of multi-source wireless relay networks is one of the fundamental issues in network information theory. The problem is, however, quite challenging due to inter-user interference when there exist multiple…

Information Theory · Computer Science 2013-10-29 Sang-Woon Jeon , Sae-Young Chung

This paper studies coordination problem for time-varying networks suffering from antagonistic information, quantified by scaling parameters. By such a manner, interacting property of the participating individuals and antagonistic…

Systems and Control · Electrical Eng. & Systems 2021-08-10 Wentao Zhang

This work considers communication networks where individual links can be described as MIMO channels. Unlike orthogonal modulation methods (such as the singular-value decomposition), we allow interference between sub-channels, which can be…

Information Theory · Computer Science 2016-11-17 Anatoly Khina , Yuval Kochman , Uri Erez

A central problem in the operation of large wireless networks is how to deal with interference -- the unwanted signals being sent by transmitters that a receiver is not interested in. This thesis looks at ways of combating such…

Information Theory · Computer Science 2011-09-07 Matthew Aldridge

A deep understanding of the queuing performance of wireless networks is essential for the advancement of future wireless communications. The stochastic nature of wireless channels in general gives rise to a time varying transmission rate.…

Networking and Internet Architecture · Computer Science 2016-04-05 Sebastian Schiessl , Farshad Naghibi , Hussein Al-Zubaidy , Markus Fidler , James Gross

We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…

Information Theory · Computer Science 2014-01-22 Quan Geng , Tie Liu

We identify the role of equal strength interference links as bottlenecks on the ergodic sum capacity of a $K$ user phase-fading interference network, i.e., an interference network where the fading process is restricted primarily to…

Information Theory · Computer Science 2016-11-17 Syed A. Jafar

We develop a model for a noisy communication channel in which the noise affecting consecutive transmissions is correlated. This model is motivated by fluctuating birefringence of fiber optic links. We analyze the role of entanglement of the…

Quantum Physics · Physics 2009-11-10 Jonathan Ball , Andrzej Dragan , Konrad Banaszek

Controllability of complex networks arises in many technological problems involving social, financial, road, communication, and smart grid networks. In many practical situations, the underlying topology might change randomly with time, due…

Systems and Control · Computer Science 2020-01-08 Fernando Gama , Elvin Isufi , Alejandro Ribeiro , Geert Leus

We consider stationary consensus protocols for networks of dynamic agents with switching topologies. The measure of the neighbors' state is affected by Unknown But Bounded disturbances. Here the main contribution is the formulation and…

Optimization and Control · Mathematics 2007-05-23 Dario Bauso , Laura Giarré , Raffaele Pesenti

The robust principles of treating interference as noise (TIN) when it is sufficiently weak, and avoiding it when it is not, form the background for this work. Combining TIN with the topological interference management (TIM) framework that…

Information Theory · Computer Science 2016-11-17 Chunhua Geng , Hua Sun , Syed A. Jafar

The problem of finding the optimal number of data streams to transmit in a multi-user MIMO scenario, where both the transmitters and receivers are equipped with multiple antennas is considered. Without channel state information at any…

Information Theory · Computer Science 2011-06-01 Rahul Vaze

Interference limits performance in wireless networks, and cooperation among receivers or transmitters can help mitigate interference by forming distributed MIMO systems. Earlier work shows how limited receiver cooperation helps mitigate…

Information Theory · Computer Science 2010-05-03 I-Hsiang Wang , David N. C. Tse

The problem of communication and state estimation is considered in the context of channels with actiondependent states. Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the…

Information Theory · Computer Science 2012-02-07 Chiranjib Choudhuri , Urbashi Mitra

This third part of the paper is related to the study of information flow in networks with strong interference. First, the two-receiver networks are considered. A unified outer bound for the capacity region of these networks is established.…

Information Theory · Computer Science 2013-02-18 Reza K. Farsani

"If we know more, we can achieve more." This adage also applies to communication networks, where more information about the network state translates into higher sumrates. In this paper, we formalize this increase of sum-rate with increased…

Information Theory · Computer Science 2015-03-17 Vaneet Aggarwal , A. Salman Avestimehr , Ashutosh Sabharwal

We determine the optimal achievable rate at which entanglement can be reliably transmitted when the memoryless channel used during transmission is unknown both to sender and receiver. To be more precise, we assume that both of them only…

Quantum Physics · Physics 2009-04-21 Igor Bjelakovic , Holger Boche , Janis Noetzel
‹ Prev 1 3 4 5 6 7 10 Next ›