English
Related papers

Related papers: Robust Uplink Communications over Fading Channels …

200 papers

In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Costa entropy power inequality (EPI) along with an…

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

We address a decentralized wireless communication network with a fixed number $u$ of frequency sub-bands to be shared among $N$ transmitter-receiver pairs. It is assumed that the number of users $N$ is a random variable with a given…

Information Theory · Computer Science 2009-12-01 Kamyar Moshksar , Alireza Bayesteh , Amir K. Khandani

Our traditional notion of a cell is changing dramatically given the increasing degree of heterogeneity in 4G and emerging 5G systems. Rather than belonging to a specific cell, a device would choose the most suitable connection from the…

Networking and Internet Architecture · Computer Science 2014-10-28 Katerina Smiljkovikj , Hisham Elshaer , Petar Popovski , Federico Boccardi , Mischa Dohler , Liljana Gavrilovska , Ralf Irmer

This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. We consider a special class of two-user Gaussian interference channels…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

We investigate the constrained capacity of multiple-antenna fading coherent channels, where the receiver knows the channel state but the transmitter knows only the channel distribution, driven by arbitrary equiprobable discrete inputs in a…

Information Theory · Computer Science 2012-10-26 Miguel Rodrigues

Wireless cellular networks evolve towards a heterogeneous infrastructure, featuring multiple types of Base Stations (BSs), such as Femto BSs (FBSs) and Macro BSs (MBSs). A wireless device observes multiple points (BSs) through which it can…

Networking and Internet Architecture · Computer Science 2016-11-17 Katerina Smiljkovikj , Petar Popovski , Liljana Gavrilovska

A network of $n$ wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power $P$ or remain silent. The objective is to maximize the number of…

Information Theory · Computer Science 2007-10-30 Masoud Ebrahimi , Amir K. Khandani

There have been a bulk of analytic results about the performance of cellular networks where base stations are regularly located on a hexagonal or square lattice. This regular model cannot reflect the reality, and tends to overestimate the…

Networking and Internet Architecture · Computer Science 2015-03-19 Seung Min Yu , Seong-Lyun Kim

The reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with…

Information Theory · Computer Science 2017-07-13 Achilleas Anastasopoulos , Jui Wu

Ambient backscatter is an intriguing wireless communication paradigm that allows small devices to compute and communicate by using only the power they harvest from radio-frequency (RF) signals in the air. Ambient backscattering devices…

Information Theory · Computer Science 2016-05-17 Donatella Darsena , Giacinto Gelli , Francesco Verde

This paper investigates the compress-and-forward scheme for an uplink cloud radio access network (C-RAN) model, where multi-antenna base-stations (BSs) are connected to a cloud-computing based central processor (CP) via capacity-limited…

Information Theory · Computer Science 2016-11-18 Yuhan Zhou , Yinfei Xu , Wei Yu , Jun Chen

The topic of this paper is achieving finite-time max-consensus in a multi-agent system that communicates over a fading wireless channel and exploits its interference property. This phenomenon corrupts the desired information when data is…

Systems and Control · Electrical Eng. & Systems 2020-05-13 Fabio Molinari , Navneet Agrawal , Sławomir Stanczak , Jörg Raisch

We consider that a transmitter covertly communicates with multiple receivers under the help of a friendly jammer. The messages intended for different receivers are transmitted in mutually orthogonal frequency bands. An adversary observes…

Information Theory · Computer Science 2021-03-03 Ke-Wen Huang , Hao Deng , Hui-Ming Wang

We derive upper and lower bounds on the reliability function for the common-message discrete memoryless broadcast channel with variable-length feedback. We show that the bounds are tight when the broadcast channel is stochastically…

Information Theory · Computer Science 2017-01-13 Lan V. Truong , Vincent Y. F. Tan

We investigate the problem of message transmission and the problem of common randomness (CR) generation over single-user multiple-input multiple-output (MIMO) slow fading channels with average input power constraint, additive white Gaussian…

Information Theory · Computer Science 2022-10-24 Rami Ezzine , Moritz Wiese , Christian Deppe , Holger Boche

The millimeter-wave bands have been attracting significant interest as a means to achieve major improvements in data rates and network efficiencies. One significant limitation for use of the millimeter-wave bands for cellular communication…

Networking and Internet Architecture · Computer Science 2015-12-10 Murali Narasimha , Hossein Bagheri

This work concerns minimizing the achievable distortion of a Gaussian source over a two-hop block fading channel under mean square-error criterion. It is assumed that there is not a direct link between transmission ends and the…

Information Theory · Computer Science 2016-05-31 Sayed Ali Khodam Hoseini , Soroush Akhlaghi , Mina Baghani

This paper investigates point-to-point information transmission over a wideband slow-fading channel, modeled as an (asymptotically) large number of independent identically distributed parallel channels, with the random channel fading…

Information Theory · Computer Science 2007-10-02 Wenyi Zhang , Urbashi Mitra

This paper studies reliability-guaranteed decoding for variable-length stop-feedback (VLSF) codes over correlated noncoherent fading channels. The decoding rule is based on the evolution of the information density associated with a given…

Information Theory · Computer Science 2026-04-20 Guodong Sun , Samir M. Perlaza , Philippe Mary , Jean-Marie Gorce

We study the capacity region of two-user erasure interference channels with local delayed channel state information at the transmitters. In our model, transmitters have local mismatched outdated knowledge of the channel gains. We propose a…

Information Theory · Computer Science 2016-07-26 Alireza Vahid , Robert Calderbank