English
Related papers

Related papers: On Multipath Fading Channels at High SNR

200 papers

The analysis of the channel capacity in the absence of prior channel knowledge (noncoherent channel) has gained increasing interest in recent years, but it is still unknown for the general case. In this paper we derive bounds on the…

Information Theory · Computer Science 2011-07-05 Itsik Bergel , Sergio Benedetto

We characterize the capacity of a low-rank wireless channel with varying fading severity at low signal-to-noise ratios (SNRs). The channel rank deficiency is achieved by incorporating pinhole condition. The capacity degradation with fading…

Information Theory · Computer Science 2024-02-12 Kamal Singh

The capacity of a discrete-time memoryless channel, in which successive symbols fade independently, and where the channel state information (CSI) is neither available at the transmitter nor at the receiver, is considered at low SNR. We…

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

Discrete-time Rayleigh fading single-input single-output (SISO) and multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter or the receiver. The fading is assumed to be stationary…

Information Theory · Computer Science 2016-11-17 Vignesh Sethuraman , Ligong Wang , Bruce Hajek , Amos Lapidoth

In this work, we investigate the capacity of multi-antenna fading channels with 1-bit quantized output per receive antenna. Specifically, leveraging Bayesian statistical tools, we analyze the asymptotic regime with a large number of receive…

Information Theory · Computer Science 2024-07-24 Sheng Yang , Richard Combes

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

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

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

Asymptotic comparisons of ergodic channel capacity at high and low signal-to-noise ratios (SNRs) are provided for several adaptive transmission schemes over fading channels with general distributions, including optimal power and rate…

Information Theory · Computer Science 2012-02-07 Yuan Zhang , Cihan Tepedelenlioglu

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

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

A discrete-time Wiener phase noise channel with an integrate-and-dump multi-sample receiver is studied. An upper bound to the capacity with an average input power constraint is derived, and a high signal-to-noise ratio (SNR) analysis is…

Information Theory · Computer Science 2016-11-17 Luca Barletta , Gerhard Kramer

In this paper, the delay limited secrecy capacity of the flat fading channel is investigated under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of…

Information Theory · Computer Science 2016-11-15 Karim Khalil , Moustafa Youssef , O. Ozan Koyluoglu , Hesham El Gamal

This paper studies the capacity of massive random-access cellular networks, modeled as a MIMO fading channel with an infinite number of interfering cells. To characterize the symmetric sum rate of the network, a random-coding argument is…

Information Theory · Computer Science 2025-09-26 Grace Villacrés , Tobias Koch , Gonzalo Vazquez-Vilar

We characterize the capacity of Rayleigh block-fading multiple-input multiple-output (MIMO) channels in the noncoherent setting where transmitter and receiver have no a priori knowledge of the realizations of the fading channel. We prove…

Information Theory · Computer Science 2012-10-02 Wei Yang , Giuseppe Durisi , Erwin Riegler

Any physical channel of communication offers two potential reasons why its capacity (the number of bits it can transmit in a unit of time) might be unbounded: (1) Infinitely many choices of signal strength at any given instant of time, and…

Information Theory · Computer Science 2011-05-18 Sanjeev Khanna , Madhu Sudan

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

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

Motivated by MIMO broad-band fading channel model, in this section we deals with the capacity behaviour of wireless MIMO and OFDM based spatial multiplexing systems in broad-band fading environments for the case where the channel is unknown…

Networking and Internet Architecture · Computer Science 2010-06-07 Nirmalendu Bikas Sinha , Prosenjit kumar , M. Mitra

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