English
Related papers

Related papers: Duality Bounds on the Cut-Off Rate with Applicatio…

200 papers

We consider a three-node half-duplex Gaussian relay network where two nodes (say $a$, $b$) want to communicate with each other and the third node acts as a relay for this twoway communication. Outer bounds and achievable rate regions for…

Information Theory · Computer Science 2012-10-09 Ishaque Ashar K. , Prathyusha V. , Srikrishna Bhashyam , Andrew Thangaraj

We present a new technique to obtain outer-bounds on the capacity region of networks with ultra low-rate feedback. We establish a connection between the achievable rates in the forward channel and the minimum distortion that can be attained…

Information Theory · Computer Science 2021-05-11 Alireza Vahid

This paper derives high-SNR asymptotic average error rates over fading channels by relating them to the outage probability, under mild assumptions. The analysis is based on the Tauberian theorem for Laplace-Stieltjes transforms which is…

Information Theory · Computer Science 2012-01-24 Yuan Zhang , Cihan Tepedelenlioglu

Transmission of information over a discrete-time memoryless Rician fading channel is considered where neither the receiver nor the transmitter knows the fading coefficients. The spectral-efficiency/bit-energy tradeoff in the low-power…

Information Theory · Computer Science 2016-11-17 Mustafa Cenk Gursoy , H. Vincent Poor , Sergio Verdu

This paper focuses on an intelligent reflecting surface (IRS)-assisted lossy communication system with correlated Rayleigh fading. We analyze the correlated channel model and derive the outage probability of the system. Then, we design a…

Networking and Internet Architecture · Computer Science 2024-08-14 Guanchang Li , Wensheng Lin , Lixin Li , Yixuan He , Fucheng Yang , Zhu Han

In this paper, we analyze the capacity of multiple-input multiple-output (MIMO) Rayleigh-fading channels in the presence of spatial fading correlation at both the transmitter and the receiver, assuming that the channel is unknown at the…

Information Theory · Computer Science 2016-11-18 Hyundong Shin , Moe Z. Win , Jae Hong Lee , Marco Chiani

This paper studies the capacity of the peak-and-average-power-limited Gaussian channel when its output is quantized using a dithered, infinite-level, uniform quantizer of step size $\Delta$. It is shown that the capacity of this channel…

Information Theory · Computer Science 2014-04-28 Tobias Koch

Communication over the i.i.d. Rayleigh slow-fading MAC is considered, where all terminals are equipped with a single antenna. Further, a communication protocol is considered where all users transmit at (just below) the symmetric capacity…

Information Theory · Computer Science 2024-10-30 Elad Domanovitz , Uri Erez

We derive bounds on the noncoherent capacity of wide-sense stationary uncorrelated scattering (WSSUS) channels that are selective both in time and frequency, and are underspread, i.e., the product of the channel's delay spread and Doppler…

Information Theory · Computer Science 2016-11-15 Giuseppe Durisi , Ulrich G. Schuster , Helmut Bölcskei , Shlomo Shamai

We address the capacity of a discrete-time memoryless Gaussian channel, where the channel state information (CSI) is neither available at the transmitter nor at the receiver. The optimal capacity-achieving input distribution at low…

Information Theory · Computer Science 2008-05-05 Z. Rezki , David Haccoun , François Gagnon

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

This paper addresses three critical limitations in previous analyses of RIS-aided wireless systems: propagation environments with fixed diversity gain, restricted spatial correlation profiles, and approximation methods that fail to capture…

We study a variant of unequal error protection in channel coding, where the message bit string is divided into a finite number of blocks and the maximization objective is a weighted sum of per-block decoding success probabilities. The…

Information Theory · Computer Science 2026-04-09 Adeel Mahmood

This paper investigates the energy efficiency of massive unsourced random access~(URA) in multiple-input multiple-output quasi-static Rayleigh fading channels. Specifically, we derive achievability and converse bounds on the minimum…

Information Theory · Computer Science 2023-02-07 Junyuan Gao , Yongpeng Wu , Tianya Li , Wenjun Zhang

This paper investigates the outage performance of overhearing amplify-and-forward (AF) cooperative relaying, where a source transmits information to its destination through multiple helping overhearing AF relays with space-time network…

Information Theory · Computer Science 2015-01-06 Yu Zhang , Ke Xiong

We develop a new upper bound on the capacity of the relay channel that is tighter than previously known upper bounds. This upper bound is proved using traditional weak converse techniques involving mutual information inequalities and…

Information Theory · Computer Science 2022-04-01 Abbas El Gamal , Amin Gohari , Chandra Nair

Fundamental limits of secret-key agreement over reciprocal wireless channels are investigated. We consider a two-way block-fading channel where the channel gains in the forward and reverse links between the legitimate terminals are…

Information Theory · Computer Science 2012-11-08 Ashish Khisti

Error probabilities of random codes for memoryless channels are considered in this paper. In the area of communication systems, admissible error probability is very small and it is sometimes more important to discuss the relative gap…

Information Theory · Computer Science 2015-06-11 Junya Honda

This paper establishes the theoretical limits of channel state information (CSI) feedback in frequency-division duplexing (FDD) multi-antenna orthogonal frequency-division multiplexing (OFDM) systems under finite-length training with…

Information Theory · Computer Science 2026-02-09 Shuao Chen , Junyuan Gao , Yuxuan Shi , Yongpeng Wu , Giuseppe Caire , H. Vincent Poor , Wenjun Zhang

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