English
Related papers

Related papers: Conditions for a Monotonic Channel Capacity

200 papers

It is proved that for memoryless vector channels, maximizing the mutual information over all source distributions with a certain average power or over the larger set of source distributions with upperbounded average power yields the same…

Information Theory · Computer Science 2015-03-20 Erik Agrell

This paper studies the capacity of a general multiple-input multiple-output (MIMO) free-space optical intensity channel under a per-input-antenna peak-power constraint and a total average-power constraint over all input antennas. The focus…

Information Theory · Computer Science 2020-02-04 Longguang Li , Stefan M. Moser , Ligong Wang , Michèle Wigger

Most communication channels are subjected to noise. One of the goals of Information Theory is to add redundancy in the transmission of information so that the information is transmitted reliably and the amount of information transmitted…

Information Theory · Computer Science 2018-03-21 David Elkouss , David Pérez-García

New upper and lower bounds are presented on the capacity of the free-space optical intensity channel. This channel is characterized by inputs that are nonnegative (representing the transmitted optical intensity) and by outputs that are…

Information Theory · Computer Science 2009-03-11 Amos Lapidoth , Stefan M. Moser , Michele A. Wigger

New upper and lower bounds are presented on the capacity of the free-space optical intensity channel. This channel is characterized by inputs that are nonnegative (representing the transmitted optical intensity) and by outputs that are…

Information Theory · Computer Science 2008-05-06 Amos Lapidoth , Stefan M. Moser , Michele A. Wigger

The capacity of discrete-time, noncoherent, multipath fading channels is considered. It is shown that if the variances of the path gains decay faster than exponentially, then capacity is unbounded in the transmit power.

Information Theory · Computer Science 2008-10-14 Tobias Koch , Amos Lapidoth

Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…

Information Theory · Computer Science 2015-12-18 Jihad Fahs , Ibrahim Abou-Faycal

We consider the communication channel given by a fiber optical transmission line. We develop a method to perturbatively calculate the information capacity of a nonlinear channel, given the corresponding evolution equation. Using this…

Optics · Physics 2007-05-23 Evgenii Narimanov , Partha Mitra

Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…

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

The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Mohammad Ali Maddah-Ali , Amir K. Khandani

Classical communication capacity of a channel can be enhanced either through a device called a 'quantum switch' or by putting the channel in a quantum superposition. The gains in the two cases, although different, have their origin in the…

Quantum Physics · Physics 2020-01-27 Nicolas Loizeau , Alexei Grinbaum

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

In diffusion-based molecular communications, messages can be conveyed via the variation in the concentration of molecules in the medium. In this paper, we intend to analyze the achievable capacity in transmission of information from one…

Information Theory · Computer Science 2011-05-11 Arash Einolghozati , Mohsen Sardari , Ahmad Beirami , Faramarz Fekri

Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about…

Information Theory · Computer Science 2013-03-21 Yuval Lomnitz , Meir Feder

In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver.…

Information Theory · Computer Science 2018-05-08 Yanru Tang , Faeze Heydaryan , Jie Luo

A wide variety of communication channels employ the quantized electromagnetic field to convey information. Their communication capacity crucially depends on losses associated to spatial characteristics of the channel such as diffraction and…

Quantum Physics · Physics 2012-06-21 Cosmo Lupo , Vittorio Giovannetti , Stefano Pirandola , Stefano Mancini , Seth Lloyd

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 capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Tsachy Weissman , Andrea Goldsmith

The sum capacity of a class of discrete memoryless interference channels is determined. This class of channels is defined analogous to the Gaussian Z-interference channel with weak interference; as a result, the sum capacity is achieved by…

Information Theory · Computer Science 2012-07-16 Fangfang Zhu , Biao Chen
‹ Prev 1 2 3 10 Next ›