English
Related papers

Related papers: Gaussian Fading Is the Worst Fading

200 papers

Unreliable fading wireless channels are the main challenge for strict performance guarantees in mobile communications. Diversity schemes including massive number of antennas, huge spectrum bands and multi-connectivity links are applied to…

Information Theory · Computer Science 2020-09-21 Karl-Ludwig Besser , Eduard A. Jorswieck

The two-way capacities of quantum channels determine the ultimate entanglement and secret-key distribution rates achievable by two distant parties that are connected by a noisy transmission line, in absence of quantum repeaters. Since…

Quantum Physics · Physics 2025-01-27 Francesco Anna Mele , Ludovico Lami , Vittorio Giovannetti

Optical channels, such as fibers or free-space links, are ubiquitous in today's telecommunication networks. They rely on the electromagnetic field associated with photons to carry information from one point to another in space. As a result,…

Quantum Physics · Physics 2015-06-18 V. Giovannetti , R. Garcia-Patron , N. J. Cerf , A. S. Holevo

We characterize the capacity of the general class of noncoherent underspread wide-sense stationary uncorrelated scattering (WSSUS) time-frequency-selective Rayleigh fading channels, under peak constraints in time and frequency and in time…

Information Theory · Computer Science 2016-11-17 Giuseppe Durisi , Helmut Bölcskei , Shlomo Shamai

This paper studies an $n$-dimensional additive Gaussian noise channel with a peak-power-constrained input. It is well known that, in this case, when $n=1$ the capacity-achieving input distribution is discrete with finitely many mass points,…

Information Theory · Computer Science 2019-11-18 Alex Dytso , Semih Yagli , H. Vincent Poor , Shlomo Shamai

The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined by two parameters: the diversity order and the coding gain.…

Information Theory · Computer Science 2012-10-05 Dieter Duyck , Joseph Jean Boutros , Marc Moeneclaey

It is well known that the problem of computing the feedback capacity of a stationary Gaussian channel can be recast as an infinite-dimensional optimization problem; moreover, necessary and sufficient conditions for the optimality of a…

Information Theory · Computer Science 2018-01-10 Tao Liu , Guangyue Han

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

This paper investigates the limits of information transfer over a fast Rayleigh fading MIMO channel, where neither the transmitter nor the receiver has the knowledge of the channel state information (CSI) except the fading statistics. We…

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

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

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

We consider a spectrum sharing communication scenario in which a primary and a secondary users are communicating, simultaneously, with their respective destinations using the same frequency carrier. Both optimal power profile and ergodic…

Information Theory · Computer Science 2016-11-15 Lokman Sboui , Zouheir Rezki , Mohamed-Slim Alouini

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

We consider a line network of nodes, connected by additive white Gaussian noise channels, equipped with local feedback. We study the velocity at which information spreads over this network. For transmission of a data packet, we give an…

Information Theory · Computer Science 2024-10-28 Elad Domanovitz , Anatoly Khina , Tal Philosof , Yuval Kochman

The feedback capacity of the stationary Gaussian additive noise channel has been open, except for the case where the noise is white. Here we find the feedback capacity of the stationary first-order moving average additive Gaussian noise…

Information Theory · Computer Science 2007-07-16 Young-Han Kim

The Shannon capacity of a graph G is the maximum asymptotic rate at which messages can be sent with zero probability of error through a noisy channel with confusability graph G. This extensively studied graph parameter disregards the fact…

Quantum Physics · Physics 2014-03-05 Jop Briet , Harry Buhrman , Dion Gijswijt

Spectral efficiency of low-density spreading non-orthogonal multiple access channels in the presence of fading is derived for linear detection with independent decoding as well as optimum decoding. The large system limit, where both the…

Information Theory · Computer Science 2018-01-30 Mai T. P. Le , Guido Carlo Ferrante , Tony Q. S. Quek , Maria-Gabriella Di Benedetto

A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that…

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

In non-coherent wideband fading channels where energy rather than spectrum is the limiting resource, peaky and non-peaky signaling schemes have long been considered species apart, as the first approaches asymptotically the capacity of a…

Information Theory · Computer Science 2017-04-04 Felipe Gomez-Cuba , Jinfeng Du , Muriel Médard , Elza Erkip

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
‹ Prev 1 4 5 6 7 8 10 Next ›