English
Related papers

Related papers: Gaussian Fading is the Worst Fading

200 papers

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

We consider the design of a linear sensing system with a fixed energy budget assuming that the sampling noise is the dominant noise source. The energy constraint implies that the signal energy per measurement decreases linearly with the…

Signal Processing · Electrical Eng. & Systems 2019-05-22 Yang Lu , Wei Dai , Yonina C. Eldar

In this paper, fading Gaussian multiuser channels are considered. If the channel is perfectly known to the transmitter, capacity has been established for many cases in which the channels may satisfy certain information theoretic orders such…

Information Theory · Computer Science 2018-10-04 Pin-Hsun Lin , Eduard A. Jorswieck , Rafael F. Schaefer , Martin Mittelbach , Carsten R. Janda

Network life time maximization is becoming an important design goal in wireless sensor networks. Energy harvesting has recently become a preferred choice for achieving this goal as it provides near perpetual operation. We study such a…

Information Theory · Computer Science 2016-11-17 R. Rajesh , Vinod Sharma , Pramod Viswanath

A theorem that describes the high signal-to-noise ratio (SNR) outage behavior of fixed-gain amplify-and-forward (FGAF) relay systems is given. Qualitatively, the theorem states that the outage probability decays according to a power law,…

Information Theory · Computer Science 2016-11-17 Justin P. Coon

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

An encoder, subject to a rate constraint, wishes to describe a Gaussian source under squared error distortion. The decoder, besides receiving the encoder's description, also observes side information consisting of uncompressed source symbol…

Information Theory · Computer Science 2013-05-10 Chris T. K. Ng , Chao Tian , Andrea J. Goldsmith , Shlomo Shamai

Classical Gaussian white noise in communications and signal processing is viewed as the limit of zero mean second order Gaussian processes with a compactly supported flat spectral density as the support goes to infinity. The difficulty of…

Information Theory · Computer Science 2013-11-19 A. V. Balakrishnan , Ravi R. Mazumdar

The mutual information of a discrete time memoryless Rayleigh fading channel is considered, where neither the transmitter nor the receiver has the knowledge of the channel state information except the fading statistics. We present the…

Information Theory · Computer Science 2007-07-13 Rasika Perera , Tony Pollock , Thushara Abhayapala

In this paper, pilot-assisted transmission over Gauss-Markov Rayleigh fading channels is considered. A simple scenario, where a single pilot signal is transmitted every T symbols and T-1 data symbols are transmitted in between the pilots,…

Information Theory · Computer Science 2016-11-17 Sami Akin , Mustafa Cenk Gursoy

The statistical analysis of the fading End to End channel gain of the amplify and forward relaying protocol, however, is well known as extremely complex, and research work to date have only studied the asymptotic behaviour of the outage…

Information Theory · Computer Science 2016-04-22 Quoc Tuan Nguyen , D. T. Nguyen , Cong Lam Sinh

We study the best exponential decay in the blocklength of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an active noisy Gaussian feedback link. We impose an \emph{expected}…

Information Theory · Computer Science 2009-09-24 Young-Han Kim , Amos Lapidoth , Tsachy Weissman

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 support of the fading-process power spectral density (PSD)…

Information Theory · Computer Science 2012-06-29 Giuseppe Durisi , Veniamin I. Morgenshtern , Helmut Bölcskei

The capacity of noncoherent fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the…

Information Theory · Computer Science 2012-12-06 Tobias Koch , Gerhard Kramer

The channel capacity of a nonlinear, dispersive fiber-optic link is revisited. To this end, the popular Gaussian noise (GN) model is extended with a parameter to account for the finite memory of realistic fiber channels. This finite-memory…

Information Theory · Computer Science 2015-01-07 Erik Agrell , Alex Alvarado , Giuseppe Durisi , Magnus Karlsson

On a fading channel with no channel state information at the receiver, calculating true log-likelihood ratios (LLR) is complicated. Existing work assume that the power of the additive noise is known and use the expected value of the fading…

Information Theory · Computer Science 2012-04-17 Raman Yazdani , Masoud Ardakani

We present a novel closed-form lower bound on the Gaussian-input mutual information for noncoherent communication (i.e., in which neither transmitter nor receiver are cognizant of the fading state) over a frequency-flat fading channel with…

Information Theory · Computer Science 2018-04-20 Adriano Pastore

This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under the peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly…

Information Theory · Computer Science 2022-02-02 Antonino Favano , Luca Barletta , Alex Dytso

This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under a peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly…

Information Theory · Computer Science 2023-05-17 Antonino Favano , Luca Barletta , Alex Dytso

Commitment is a key primitive which resides at the heart of several cryptographic protocols. Noisy channels can help realize information-theoretically secure commitment schemes, however, their imprecise statistical characterization can…

Information Theory · Computer Science 2023-05-15 Amitalok J. Budkuley , Pranav Joshi , Manideep Mamindlapally , Anuj Kumar Yadav