English
Related papers

Related papers: On the Minimax Capacity Loss under Sub-Nyquist Uni…

200 papers

Cognitive Radio requires efficient and reliable spectrum sensing of wideband signals. In order to cope with the sampling rate bottleneck, new sampling methods have been proposed that sample below the Nyquist rate. However, such techniques…

Information Theory · Computer Science 2017-04-26 Deborah Cohen , Yonina C. Eldar

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

An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal…

Information Theory · Computer Science 2026-04-14 Amin Gohari , Gerhard Kramer

Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the…

Quantum Physics · Physics 2025-10-03 Adam Taylor , Michael Hanks , Hyukjoon Kwon , M. S. Kim

This paper addresses an interference channel consisting of $\mathbf{n}$ active users sharing $u$ frequency sub-bands. Users are asynchronous meaning there exists a mutual delay between their transmitted codes. A stationary model for…

Information Theory · Computer Science 2010-06-17 Kamyar Moshksar , Amir K. Khandani

The minimization of Gibbs free energy is based on the changes in work and free energy that occur in a physical or chemical system. The maximization of mutual information, the capacity, of a noisy channel is determined based on the marginal…

Statistical Mechanics · Physics 2008-09-23 David Ford

Frequency estimation of multiple sinusoids is significant in both theory and application. In some application scenarios, only sub-Nyquist samples are available to estimate the frequencies. A conventional approach is to sample the signals at…

Information Theory · Computer Science 2017-03-21 Shan Huang , Haijian Zhang , Hong Sun , Lei Yu , Liwen Chen

One of the basic tenets in information theory, the data processing inequality states that output divergence does not exceed the input divergence for any channel. For channels without input constraints, various estimates on the amount of…

Information Theory · Computer Science 2015-08-14 Yury Polyanskiy , Yihong Wu

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

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

A bound on the maximum information transmission rate through a cascade of Gaussian links is presented. The network model consists of a source node attempting to send a message drawn from a finite alphabet to a sink, through a cascade of…

Information Theory · Computer Science 2013-01-29 Ramanan Subramanian , Badri Vellambi , Ingmar Land

This paper adresses the behaviour of the mutual information of correlated MIMO Rayleigh channels when the numbers of transmit and receive antennas converge to infinity at the same rate. Using a new and simple approach based on…

Information Theory · Computer Science 2007-07-13 Walid Hachem , Oleksiy Khorunzhiy , Philippe Loubaton , Jamal Najim , Leonid Pastur

In this part, we consider the capacity analysis for wireless mobile systems with multiple antenna architectures. We apply the results of the first part to a commonly known baseband, discrete-time multiple antenna system where both the…

Information Theory · Computer Science 2007-07-13 Majid Fozunbal , Steven W. McLaughlin , Ronald W. Schafer

This paper discusses sample allocation problem (SAP) in frequency-domain Compressive Sampling (CS) of time-domain signals. An analysis that is relied on two fundamental CS principles; the Uniform Random Sampling (URS) and the Uncertainty…

Information Theory · Computer Science 2014-12-22 Andriyan B. Suksmono

In wireless networks, communication links may be subject to random fatal impacts: for example, sensor networks under sudden power losses or cognitive radio networks with unpredictable primary user spectrum occupancy. Under such…

Information Theory · Computer Science 2016-11-15 Meng Zeng , Rui Zhang , Shuguang Cui

We study the information loss of a class of inference strategies that is solely based on time averaging. For an array of independent binary sensors (e.g., receptors, single electron transistors) measuring a weak random signal (e.g., ligand…

Statistical Mechanics · Physics 2016-10-25 David Hartich , Udo Seifert

The present paper is devoted to investigation of the entropy reduction and entanglement-assisted classical capacity (information gain) of continuous variable quantum measurements. These quantities are computed explicitly for multimode…

Quantum Physics · Physics 2020-08-31 A. S. Holevo , A. A. Kuznetsova

A methodology is developed to realized optimal channel input conditional distributions, which maximize the finite-time horizon directed information, for channels with memory and feedback, by information lossless randomized strategies. The…

Information Theory · Computer Science 2016-04-06 Charalambos D. Charalambous , Christos K. Kourtellaris , Sergey Loyka

For a continuous-time additive white Gaussian noise (AWGN) channel with possible feedback, it has been shown that as sampling gets infinitesimally fine, the mutual information of the associative discrete-time channels converges to that of…

Information Theory · Computer Science 2020-08-26 Guangyue Han , Shlomo Shamai

Consider a Gaussian relay network where a number of sources communicate to a destination with the help of several layers of relays. Recent work has shown that a compress-and-forward based strategy at the relays can achieve the capacity of…

Information Theory · Computer Science 2013-04-30 Ritesh Kolte , Ayfer Özgür