English
Related papers

Related papers: Approximate Capacity of Fast Fading Interference C…

200 papers

In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…

Information Theory · Computer Science 2015-12-17 Reza K. Farsani , Amir K. Khandani

The minimum average signal-to-noise ratio (SNR) per bit required for error-free transmission over a fading channel is derived, and is shown to be equal to that of the additive white Gaussian noise (AWGN) channel, which is $-1.6$ dB.…

Information Theory · Computer Science 2017-11-29 K. Vasudevan

Recent investigations have shown sum capacity results within a constant bit-gap for several channel models, e.g. the two-user Gaussian interference channel (G-IC), k-user G-IC or the Gaussian X-channel. This has motivated investigations of…

Information Theory · Computer Science 2017-05-15 Rick Fritschek , Gerhard Wunder

We derive inner and outer bounds on the capacity region for a class of three-user partially connected interference channels. We focus on the impact of topology, interference alignment, and interplay between interference and noise. The…

Information Theory · Computer Science 2017-02-14 Muryong Kim , Yitao Chen , Sriram Vishwanath

In this paper, we study the impact of different channel output feedback architectures on the capacity of the two-user interference channel. For a two-user interference channel, a feedback link can exist between receivers and transmitters in…

Information Theory · Computer Science 2015-03-19 Achaleshwar Sahai , Vaneet Aggarwal , Melda Yuksel , Ashutosh Sabharwal

We study a fading linear finite-field relay network having multiple source-destination pairs. Because of the interference created by different unicast sessions, the problem of finding its capacity region is in general difficult. We observe…

Information Theory · Computer Science 2009-05-12 Sang-Woon Jeon , Sae-Young Chung

Sufficient conditions required to achieve the interference-free capacity region of ergodic fading K-user interference channels (IFCs) are obtained. In particular, this capacity region is shown to be achieved when every receiver decodes all…

Information Theory · Computer Science 2009-10-27 Lalitha Sankar , Jan Vondrak , H. Vincent Poor

Training-based transmission over Rayleigh block-fading multiple-input multiple-output (MIMO) channels is investigated. As a training method a combination of a pilot-assisted scheme and a biased signaling scheme is considered. The achievable…

Information Theory · Computer Science 2016-11-18 Keigo Takeuchi , Ralf R. Mueller , Mikko Vehkaperae , Toshiyuki Tanaka

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

This paper investigates the effective capacity of a point-to-point ultra-reliable low latency communication (URLLC) transmission over multiple parallel sub-channels at finite blocklength (FBL) with imperfect channel state information (CSI).…

Information Theory · Computer Science 2022-10-20 Hongsen Peng , Meixia Tao

This paper studies the capacity scaling of non-coherent Single-Input Multiple-Output (SIMO) independent and identically distributed (i.i.d.) Rayleigh block fading channels versus bandwidth ($B$), number of receive antennas ($N$) and…

Information Theory · Computer Science 2024-10-21 Felipe Gomez-Cuba

We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbor decoding and pilot-aided channel estimation. In particular, we…

Information Theory · Computer Science 2014-04-09 A. Taufiq Asyhari , Tobias Koch , Albert Guillén i Fàbregas

We propose a new method to compute the feedback capacity of unifilar finite state channels (FSCs) with memory using reinforcement learning (RL). The feedback capacity was previously estimated using its formulation as a Markov decision…

Information Theory · Computer Science 2020-08-19 Ziv Aharoni , Oron Sabag , Haim Henri Permuter

In this paper, the capacity and energy efficiency of training-based communication schemes employed for transmission over a-priori unknown Rayleigh block fading channels are studied. In these schemes, periodically transmitted training…

Information Theory · Computer Science 2007-12-20 Mustafa Cenk Gursoy

In this work we extend the setting of communication without power constraint, proposed by Poltyrev, to fast fading channels with channel state information (CSI) at the receiver. The optimal codewords density, or actually the optimal…

Information Theory · Computer Science 2014-04-22 Shlomi Vituri , Meir Feder

In this paper, we consider a general multiple input multiple output (MIMO) system with channel state information (CSI) feedback over time-correlated Rayleigh block-fading channels. Specifically, we first derive the closed-form expression of…

Information Theory · Computer Science 2011-12-01 L. Zhang , Lingyang Song , M. Ma , B. Jiao

This paper develops a unified information-theoretic framework for artificial-intelligence (AI)-aided integrated sensing and communication (ISAC), where a learning component with limited representational capacity is embedded within the…

Information Theory · Computer Science 2025-12-16 Farshad Rostami Ghadi , F. Javier Lopez-Martinez , Kai-Kit Wong , Christos Masouros

We study the ergodic capacity of a frequency-selective Rayleigh fading channel with correlated scattering, which finds application in the area of UWB. Under an average power constraint, we consider a single-user, single-antenna…

Information Theory · Computer Science 2016-11-17 Martin Mittelbach , Christian Mueller , Konrad Schubert

Flat-fading channels that are correlated in time are considered under peak and average power constraints. For discrete-time channels, a new upper bound on the capacity per unit time is derived. A low SNR analysis of a full-scattering vector…

Information Theory · Computer Science 2007-07-13 Vignesh Sethuraman , Bruce Hajek

Both the first-order signal statistics (e.g. the outage probability) and the second-order signal statistics (e.g. the average level crossing rate, LCR, and the average fade duration, AFD) are important design criteria and performance…

Information Theory · Computer Science 2009-08-26 Zoran Hadzi-Velkov
‹ Prev 1 3 4 5 6 7 10 Next ›