English
Related papers

Related papers: Noncoherent Capacity of Underspread Fading Channel…

200 papers

Future wireless communication calls for exploration of more efficient use of wireless channel capacity to meet the increasing demand on higher data rate and less latency. However, while the ergodic capacity and instantaneous capacity of a…

Information Theory · Computer Science 2016-04-06 Fengyou Sun , Yuming Jiang

Accurate fading characterization and channel capacity determination are of paramount importance in both conventional and emerging communication systems. The present work addresses the nonlinearity of the propagation medium and its effects…

Information Theory · Computer Science 2016-12-30 Paschalis C. Sofotasios , Sami Muhaidat , Mikko Valkama , Mounir Ghogho , George K. Karagiannidis

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than…

Information Theory · Computer Science 2017-06-14 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

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

Constellation shaping is a practical and effective technique to improve the performance and the rate adaptivity of optical communication systems. In principle, it could also be used to mitigate the impact of nonlinear effects, possibly…

Information Theory · Computer Science 2022-06-08 Marco Secondini , Stella Civelli , Enrico Forestieri , Lareb Zar Khan

As shown by M\'edard, the capacity of fading channels with imperfect channel-state information (CSI) can be lower-bounded by assuming a Gaussian channel input $X$ with power $P$ and by upper-bounding the conditional entropy $h(X|Y,\hat{H})$…

Information Theory · Computer Science 2016-11-15 Adriano Pastore , Tobias Koch , Javier Rodríguez Fonollosa

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is…

Information Theory · Computer Science 2007-07-16 Praveen Kumar Gopala , Lifeng Lai , Hesham El Gamal

This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length-$n$ delay-limited codes for a quasi-static fading channel is said to be capacity-achieving if the…

Information Theory · Computer Science 2016-11-15 Silas L. Fong , Vincent Y. F. Tan

Fundamental capacity limits are studied for the two-user wireless ergodic fading IC with partial Channel State Information at the Transmitters (CSIT) where each transmitter is equipped with an arbitrary deterministic function of the channel…

Information Theory · Computer Science 2013-02-15 Reza K. Farsani

This paper presents a stochastic geometry model for the investigation of fundamental information theoretic limitations in wireless networks. We derive a new unified multi-parameter cut-set bound on the capacity of networks of arbitrary…

Information Theory · Computer Science 2013-05-02 Georgios Rodolakis

We investigate robust linear consensus over networks under capacity-constrained communication. The capacity of each edge is encoded as an upper bound on the number of state variables that can be communicated instantaneously. When the edge…

Systems and Control · Electrical Eng. & Systems 2021-05-25 Yasin Yazicioglu , Alberto Speranzon

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 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

We consider a multiple-input, multiple-output (MIMO) wideband Rayleigh block fading channel where the channel state is unknown to both the transmitter and the receiver and there is only an average power constraint on the input. We compute…

Information Theory · Computer Science 2007-07-13 Siddharth Ray , Muriel Medard , Lizhong Zheng

We consider a continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. The set of…

Information Theory · Computer Science 2017-09-25 Sandra Bender , Meik Dörpinghaus , Gerhard Fettweis

The capacity of discrete-time, non-coherent, multipath fading channels is considered. It is shown that if the delay spread is large in the sense that the variances of the path gains do not decay faster than geometrically, then capacity is…

Information Theory · Computer Science 2016-11-18 Tobias Koch , Amos Lapidoth

We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we…

Information Theory · Computer Science 2019-04-10 Deekshith P K , K Gautam Shenoy , Vinod Sharma

This paper investigates point-to-point information transmission over a wideband slow-fading channel, modeled as an (asymptotically) large number of independent identically distributed parallel channels, with the random channel fading…

Information Theory · Computer Science 2007-10-02 Wenyi Zhang , Urbashi Mitra

This work studies the secrecy-capacity of a scalar-Gaussian wiretap channel with an amplitude constraint on the input. It is known that for this channel, the secrecy-capacity-achieving distribution is discrete with finitely many points.…

Information Theory · Computer Science 2021-09-06 Luca Barletta , Alex Dytso

In this paper, we characterize the information-theoretic capacity scaling of wireless ad hoc networks with $n$ randomly distributed nodes. By using an exact channel model from Maxwell's equations, we successfully resolve the conflict in the…

Information Theory · Computer Science 2011-10-19 Si-Hyeon Lee , Sae-Young Chung