English
Related papers

Related papers: The Capacity of Memoryless Channels with Sampled C…

200 papers

This work introduces capacity limits for molecular timing (MT) channels, where information is modulated on the release timing of small information particles, and decoded from the time of arrival at the receiver. It is shown that the random…

Information Theory · Computer Science 2016-11-15 Nariman Farsad , Yonathan Murin , Andrew Eckford , Andrea Goldsmith

The K-user cyclic Z-interference channel models a situation in which the kth transmitter causes interference only to the (k-1)th receiver in a cyclic manner, e.g., the first transmitter causes interference only to the Kth receiver. The…

Information Theory · Computer Science 2016-11-17 Ravi Tandon , Soheil Mohajer , H. Vincent Poor

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

In this paper, the capacity of continuous-space electromagnetic channels, where transceivers are confined in given lossy regions, is analyzed. First of all, the regions confining the transceivers are assumed to be filled with dielectric,…

Information Theory · Computer Science 2016-06-21 Wonseok Jeon , Sae-Young Chung

A class of cognitive interference channel with state is investigated, in which two transmitters (transmitters 1 and 2) communicate with two receivers (receivers 1 and 2) over an interference channel. The two transmitters jointly transmit a…

Information Theory · Computer Science 2012-07-10 Ruchen Duan Yingbin Liang

In this paper the study of the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers. We derive the capacity for the…

Information Theory · Computer Science 2012-02-07 Stefano Rini , Carolin Huppert

The capacity region of the interference channel in which one transmitter non-causally knows the message of the other, termed the cognitive interference channel, has remained open since its inception in 2005. A number of subtly differing…

Information Theory · Computer Science 2015-03-13 Stefano Rini , Daniela Tuninetti , Natasha Devroye

In this paper, we revisit the problem of finding the average capacity of the Gaussian feedback channel. First, we consider the problem of finding the average capacity of the analog Gaussian noise channel where the noise has an arbitrary…

Information Theory · Computer Science 2019-01-24 Ather Gattami

The two-user Gaussian interference channel (G-IC) is revisited, with a particular focus on practically amenable discrete input signalling and treating interference as noise (TIN) receivers. The corresponding deterministic interference…

Information Theory · Computer Science 2021-03-18 Min Qiu , Yu-Chih Huang , Jinhong Yuan

To study the effect of lack of up-to-date channel state information at the transmitters (CSIT), we consider two-user binary fading interference channels with Delayed-CSIT. We characterize the capacity region for such channels under…

Information Theory · Computer Science 2016-11-17 Alireza Vahid , Mohammad Ali Maddah-Ali , Amir Salman Avestimehr

Calculating the capacity (with or without feedback) of channels with memory and continuous alphabets is a challenging task. It requires optimizing the directed information (DI) rate over all channel input distributions. The objective is a…

Information Theory · Computer Science 2020-05-19 Ziv Aharoni , Dor Tsur , Ziv Goldfeld , Haim Henry Permuter

The capacity of a complex and discrete-time memoryless additive white Gaussian noise (AWGN) channel under three constraints, namely, input average power, input amplitude and output delivered power is studied. The output delivered power…

Information Theory · Computer Science 2020-04-27 Morteza Varasteh , Borzoo Rassouli , Bruno Clerckx

We explore two fundamental questions at the intersection of sampling theory and information theory: how channel capacity is affected by sampling below the channel's Nyquist rate, and what sub-Nyquist sampling strategy should be employed to…

Information Theory · Computer Science 2015-03-19 Yuxin Chen , Yonina C. Eldar , Andrea J. Goldsmith

A continuous-time Wiener phase noise channel with an integrate-and-dump multi-sample receiver is studied. A lower bound to the capacity with an average input power constraint is derived, and a high signal-to-noise ratio (SNR) analysis is…

Information Theory · Computer Science 2015-03-12 Luca Barletta , Gerhard Kramer

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

We investigate the capacity of noisy frequency-based channels, motivated by DNA data storage in the short-molecule regime, where information is encoded in the frequency of items types rather than their order. The channel output is a…

Information Theory · Computer Science 2026-01-16 Yuval Gerzon , Ilan Shomorony , Nir Weinberger

This paper deals with the phase noise affecting communication systems, where local oscillators are employed to obtain reference signals for carrier and timing synchronizations. The most common discrete-time phase noise channel model is…

Information Theory · Computer Science 2024-06-21 Amina Piemontese , Giulio Colavolpe , Thomas Eriksson

We study memoryless, discrete time, matrix channels with additive white Gaussian noise and input power constraints of the form $Y_i = \sum_j H_{ij} X_j + Z_i$, where $Y_i$ ,$X_j$ and $Z_i$ are complex, $i=1..m$, $j=1..n$, and $H$ is a…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Anirvan Mayukh Sengupta , Partha Pratim Mitra

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

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