English
Related papers

Related papers: On Multipath Fading Channels at High SNR

200 papers

Unlike the AWGN (additive white gaussian noise) channel, fading channels suffer from random channel gains besides the additive Gaussian noise. As a result, the instantaneous channel capacity varies randomly along time, which makes it…

Information Theory · Computer Science 2014-07-18 Yunquan Dong , Pingyi Fan

We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for the setup where a priori channel state information is not available. The upper bound relies on a dual formula for…

Information Theory · Computer Science 2016-11-17 Rahul Devassy , Giuseppe Durisi , Johan Östman , Wei Yang , Tome Eftimov , Zoran Utkovski

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

A fading broadcast channel is considered where the transmitter employs two antennas and each of the two receivers employs a single receive antenna. It is demonstrated that even if the realization of the fading is precisely known to the…

Information Theory · Computer Science 2007-07-13 Amos Lapidoth , Shlomo Shamai , Michele Wigger

The capacity of peak-power limited, single-antenna, non-coherent, flat-fading channels with memory is considered. The emphasis is on the capacity pre-log, i.e., on the limiting ratio of channel capacity to the logarithm of the…

Information Theory · Computer Science 2008-04-14 Tobias Koch , Amos Lapidoth

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

Information Theory · Computer Science 2016-11-15 A. Taufiq Asyhari , Tobias Koch , Albert Guillén i Fàbregas

We study a noncoherent multiple-input multiple-output (MIMO) fading multiple-access channel (MAC), where the transmitters and the receiver are aware of the statistics of the fading, but not of its realisation. We analyse the rate region…

Information Theory · Computer Science 2012-01-17 A. Taufiq Asyhari , Tobias Koch , Albert Guillén i Fàbregas

In slow fading scenarios, cooperation between nodes can increase the amount of diversity for communication. We study the performance limit in such scenarios by analyzing the outage capacity of slow fading relay channels. Our focus is on the…

Information Theory · Computer Science 2007-07-13 Salman Avestimehr , David N. C. Tse

The capacity of a fading channel can be substantially increased by feeding back channel state information from the receiver to the transmitter. With limited-rate feedback what state information to feed back and how to encode it are…

Information Theory · Computer Science 2016-11-15 Manish Agarwal , Dongning Guo , Michael Honig

We study the high-SNR capacity of MIMO Rayleigh block-fading channels in the noncoherent setting where neither transmitter nor receiver has a priori channel state information. We show that when the number of receive antennas is sufficiently…

Information Theory · Computer Science 2016-11-17 Günther Koliander , Erwin Riegler , Giuseppe Durisi , Franz Hlawatsch

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

The scaling of coherent and non-coherent channel capacity is studied in a single-input multiple-output (SIMO) block Rayleigh fading channel as both the bandwidth and the number of receiver antennas go to infinity jointly with the transmit…

Information Theory · Computer Science 2020-02-21 Felipe Gomez-Cuba , Mainak Chowdhury , Alexandros Manolakos , Elza Erkip , Andrea J. Goldsmith

An upper bound on the capacity of a cascade of nonlinear and noisy channels is presented. The cascade mimics the split-step Fourier method for computing waveform propagation governed by the stochastic generalized nonlinear Schroedinger…

Information Theory · Computer Science 2015-04-24 Gerhard Kramer , Mansoor I. Yousefi , Frank R. Kschischang

We investigate the multipath fading relay channel in the limit of a large bandwidth, and in the non-coherent setting, where the channel state is unknown to all terminals, including the relay and the destination. We propose a hypergraph…

Information Theory · Computer Science 2016-11-17 Nadia Fawaz , Muriel Medard

This paper derives upper and lower bounds on the capacity of the multiple-input single-output free-space optical intensity channel with signal-independent additive Gaussian noise subject to both an average-intensity and a peak-intensity…

Information Theory · Computer Science 2017-10-26 Stefan M. Moser , Ligong Wang , Michèle Wigger

Transmission of information over a discrete-time memoryless Rician fading channel is considered where neither the receiver nor the transmitter knows the fading coefficients. First the structure of the capacity-achieving input signals is…

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

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

The capacity of peak-power limited, single-antenna, noncoherent, flat-fading channels with memory is considered. The emphasis is on the capacity pre-log, i.e., on the limiting ratio of channel capacity to the logarithm of the…

Information Theory · Computer Science 2009-02-20 Tobias Koch , Amos Lapidoth

We establish a lower bound on the noncoherent capacity pre-log of a temporally correlated Rayleigh block-fading single-input multiple-output (SIMO) channel. Our result holds for arbitrary rank Q of the channel correlation matrix, arbitrary…

Information Theory · Computer Science 2016-11-18 Erwin Riegler , Veniamin I. Morgenshtern , Giuseppe Durisi , Shaowei Lin , Bernd Sturmfels , Helmut Bölcskei

In this paper, we obtain asymptotic expressions for the ergodic capacity of the keyhole multiple-input multiple-output (MIMO) channel at low signal-to-noise ratio (SNR) in independent and identically distributed Nakagami-$m$ fading…

Information Theory · Computer Science 2022-06-07 Kamal Singh , Chandradeep Singh , Kuang-Hao Liu