English
Related papers

Related papers: Capacity of Underspread Noncoherent WSSUS Fading C…

200 papers

This paper provides new insight into the classical problem of determining both the capacity of the discrete-time channel with uniform output quantization and the capacity achieving input distribution. It builds on earlier work by Gallager…

Information Theory · Computer Science 2009-01-19 Yiyue Wu , Linda M. Davis , Robert Calderbank

Diffuse, multiple-scattered waves can be very efficient for information transfer through disordered media, provided that antenna arrays are used for both transmission and reception of signals. Information capacity C of a communication…

Data Analysis, Statistics and Probability · Physics 2007-05-23 S. E. Skipetrov

We establish an upper bound on the noncoherent capacity pre-log of temporally correlated block-fading single-input multiple-output (SIMO) channels. The upper bound matches the lower bound recently reported in Riegler et al. (2011), and,…

Information Theory · Computer Science 2011-09-14 Wei Yang , Giuseppe Durisi , Veniamin I. Morgenshtern , Erwin Riegler

The rate optimization for wireless networks with low SNR is investigated. While the capacity in the limit of disappearing SNR is known to be linear for fading and non-fading channels, we study the problem of operating in low SNR wireless…

Information Theory · Computer Science 2010-08-03 Mohit Thakur , Muriel Médard

We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels and Additive White Gaussian Noise channels, in which a transmitter attempts to reliably communicate with a legitimate…

Information Theory · Computer Science 2025-07-21 Shi-Yuan Wang , Keerthi S. K. Arumugam , Matthieu R. Bloch

The secrecy capacity of a discrete memoryless Gaussian Wire-Tap Channel when the input is from a finite complex constellation is studied. It is shown that the secrecy capacity curves of a finite constellation plotted against the SNR, for a…

Information Theory · Computer Science 2010-10-07 G. D. Raghava , B. Sundar Rajan

We address the problem of recovering a sparse signal observed by a resource constrained wireless sensor network under channel fading. Sparse random matrices are exploited to reduce the communication cost in forwarding information to a…

Information Theory · Computer Science 2015-04-16 Thakshila Wimalajeewa , Pramod K. Varshney

A wideband fading channel is considered with causal channel state information (CSI) at the transmitter and no receiver CSI. A simple orthogonal code with energy detection rule at the receiver (similar to [6]) is shown to achieve the…

Information Theory · Computer Science 2007-07-13 Shashi Borade , Lizhong Zheng

We compute Shannon capacity of nonlinear channels with regenerative elements. Conditions are found under which capacity of such nonlinear channels is higher than the Shannon capacity of the classical linear additive white Gaussian noise…

Information Theory · Computer Science 2013-05-08 M. A. Sorokina , S. K. Turitsyn

We study the communication capacities of bosonic broadband channels in the presence of different sources of noise. In particular we analyze lossy channels in presence of white noise and thermal bath. In this context, we provide a numerical…

Quantum Physics · Physics 2009-11-10 Vittorio Giovannetti , Seth Lloyd , Lorenzo Maccone , Peter W. Shor

The capacity of a deterministic multiple-input multiple-output (MIMO) channel under the peak and average power constraints is investigated. For the identity channel matrix, the approach of Shamai et al. is generalized to the higher…

Information Theory · Computer Science 2016-09-29 Borzoo Rassouli , Bruno Clerckx

Strong secrecy capacity of compound wiretap channels is studied. The known lower bounds for the secrecy capacity of compound finite-state memoryless channels under discrete alphabets are extended to arbitrary uncertainty sets and continuous…

Information Theory · Computer Science 2015-09-09 Rafael F. Schaefer , Sergey Loyka

In many radar scenarios, the radar target or the medium is assumed to possess randomly varying parts. The properties of a target are described by a random process known as the spreading function. Its second order statistics under the WSSUS…

Information Theory · Computer Science 2015-06-19 Götz E. Pfander , Pavel Zheltov

In this paper we consider the capacity of the cognitive radio channel in different fading environments under a low interference regime. First we derive the probability that the low interference regime holds under shadow fading as well as…

Information Theory · Computer Science 2013-01-03 Muhammad Fainan Hanif , Peter J. Smith

A network of $n$ wireless communication links is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between nodes. The objective is to analyze the achievable throughput of the network when power…

Information Theory · Computer Science 2016-11-17 Masoud Ebrahimi , Mohammad Maddah-Ali , Amir Khandani

Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate capacity for…

Information Theory · Computer Science 2008-01-16 Xiaohu Shang , Gerhard Kramer , Biao Chen

This paper presents a comprehensive analysis of the information-energy capacity region for simultaneous lightwave information and power transfer (SLIPT) systems over lognormal fading channels. Unlike conventional studies that primarily…

Information Theory · Computer Science 2026-04-27 Nizar Khalfet , Kapila W. S. Palitharathna , Symeon Chatzinotas , Ioannis Krikidis

Binary-input memoryless channels with a runlength constrained input are considered. Upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method with Markov test distributions…

Information Theory · Computer Science 2016-11-17 Andrew Thangaraj

We study the determination problem of the channel capacity for the discrete memoryless channels in the finite blocklength regime. We derive explicit lower and upper bounds of the capacity. We shall demonstrate that the information spectrum…

Information Theory · Computer Science 2019-04-11 Yasutada Oohama

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