English
Related papers

Related papers: Approximate Capacity of Fast Fading Interference C…

200 papers

This is the second part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading. In the first part, we studied the scenario with a fast fading channel, and found Nash equilibria of mixed…

Information Theory · Computer Science 2008-08-27 George T. Amariucai , Shuangqing Wei , Rajgopal Kannan

The sum-capacity for specific sub-classes of ergodic fading Gaussian two-user interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the sub-classes of…

Information Theory · Computer Science 2016-11-17 Lalitha Sankar , Xiaohu Shang , Elza Erkip , H. Vincent Poor

The noncoherent capacity of stationary discrete-time fading channels is known to be very sensitive to the fine details of the channel model. More specifically, the measure of the set of harmonics where the power spectral density of the…

Information Theory · Computer Science 2016-11-15 Giuseppe Durisi , Veniamin I. Morgenshtern , Helmut Bölcskei

This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. A design criterion based on the normalized minimum determinant is proposed…

Information Theory · Computer Science 2015-07-28 Laura Luzzi , Roope Vehkalahti

In this research report, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output feedback (G-IC-NOF) are presented. The achievability region is obtained using a random coding…

Information Theory · Computer Science 2016-11-16 Victor Quintero , Samir M. Perlaza , Iñaki Esnaola , Jean-Marie Gorce

In this paper, we introduce the Causal Cognitive Interference Channel With Delay (CC-IFC-WD) in which the cognitive user transmission can depend on $L$ future received symbols as well as the past ones. Taking the effect of the link delays…

Information Theory · Computer Science 2012-02-06 Mahtab Mirmohseni , Bahareh Akhbari , Mohammad Reza Aref

Several information-theoretic studies on channels with output quantization have identified the capacity-achieving input distributions for different fading channels with 1-bit in-phase and quadrature (I/Q) output quantization. However, an…

Information Theory · Computer Science 2022-05-31 Neil Irwin Bernardo , Jingge Zhu , Jamie Evans

The memoryless noncoherent single-input single-output (SISO) Rayleigh-fading channel is considered. Closed-form expressions for the mutual information between the output and the input of this channel when the input magnitude distribution is…

Information Theory · Computer Science 2007-07-16 Sebastien de la Kethulle de Ryhove , Ninoslav Marina , Geir E. Oien

This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length-$n$ delay-limited codes for a quasi-static fading channel is said to be capacity-achieving if the…

Information Theory · Computer Science 2016-11-15 Silas L. Fong , Vincent Y. F. Tan

Motivated by recent high bandwidth communication systems, Inter-Symbol Interference (ISI) channels with 1-bit quantized output are considered under an average-power-constrained continuous input. While the exact capacity is difficult to…

Information Theory · Computer Science 2015-05-05 Radha Krishna Ganti , Andrew Thangaraj , Arijit Mondal

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

The InterFerence Channel with a Cognitive Relay (IFC-CR) consists of a classical two-user interference channel in which the two independent messages are also non-causally known at a cognitive relay node. In this work a special class of…

Information Theory · Computer Science 2011-02-17 Stefano Rini , Daniela Tuninetti , Natasha Devroye

Consider several source nodes communicating across a wireless network to a destination node with the help of several layers of relay nodes. Recent work by Avestimehr et al. has approximated the capacity of this network up to an additive…

Information Theory · Computer Science 2013-06-05 Urs Niesen , Bobak Nazer , Phil Whiting

The randomized fixe-composition with optimal decoding error exponents are studied \cite{Raul_ISIT,Raul_journal} for the finite alphabet interference channel (IFC) with two transmitter-receiver pairs. In this paper we investigate the…

Information Theory · Computer Science 2016-11-15 Cheng Chang

The high-SNR capacity of the noncoherent MIMO channel has been derived for the case of independent and identically distributed (IID) Rayleigh block fading by exploiting the Gaussianity of the channel matrix. This implies the optimal degrees…

Information Theory · Computer Science 2021-01-12 Khac-Hoang Ngo , Sheng Yang , Maxime Guillaud

In this paper, we propose capacity-achieving communication schemes for Gaussian finite-state Markov channels (FSMCs) subject to an average channel input power constraint, under the assumption that the transmitters can have access to delayed…

Information Theory · Computer Science 2016-11-18 Jialing Liu , Nicola Elia , Sekhar Tatikonda

This study investigates the mean capacity of multiple-input multiple-output (MIMO) systems for spatially semi-correlated flat fading channels. In reality, the capacity degrades dramatic due to the channel covariance (CC) when correlations…

Information Theory · Computer Science 2016-09-27 Md. Abdul Latif Sarker , Moon Ho Lee

In this paper we consider the capacity of the cognitive radio channel in different fading environments under a low interference regime. First we derive the probability that the low interference regime holds under shadow fading as well as…

Information Theory · Computer Science 2013-01-03 Muhammad Fainan Hanif , Peter J. Smith

The classical writing on dirty paper capacity result establishes that full interference pre-cancellation can be attained in Gelfand-Pinsker problem with additive state and additive white Gaussian noise. This result holds under the idealized…

Information Theory · Computer Science 2014-05-12 Stefano Rini , Shlomo Shamai

The capacity region of the 2-user multi-input multi-output (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary…

Information Theory · Computer Science 2015-03-18 Sanjay Karmakar , Mahesh K. Varanasi