English
Related papers

Related papers: Capacity Approximations for Gaussian Relay Network…

200 papers

The capacity of the Gaussian cognitive interference channel, a variation of the classical two-user interference channel where one of the transmitters (referred to as cognitive) has knowledge of both messages, is known in several parameter…

Information Theory · Computer Science 2016-11-17 Stefano Rini , Daniela Tuninetti , Natasha Devroye

Upper bounds for private communication over quantum channels can be derived by adopting channel simulation, protocol stretching, and relative entropy of entanglement. All these ingredients have led to single-letter upper bounds to the…

A long-standing problem on the classical capacity of bosonic Gaussian channels has recently been resolved by proving the minimum output entropy conjecture. It is also known that the ultimate capacity quantified by the Holevo bound can be…

Quantum Physics · Physics 2015-05-07 Jaehak Lee , Se-Wan Ji , Jiyong Park , Hyunchul Nha

A classical result in Information Theory states that the Gaussian noise is the worst-case additive noise in point-to-point channels, meaning that, for a fixed noise variance, the Gaussian noise minimizes the capacity of an additive noise…

Information Theory · Computer Science 2013-01-30 Ilan Shomorony , A. Salman Avestimehr

The study of feedback has been mostly limited to single-hop communication settings. In this paper, we consider Gaussian networks where sources and destinations can communicate with the help of intermediate relays over multiple hops. We…

Information Theory · Computer Science 2014-07-16 Bobbie Chern , Farzan Farnia , Ayfer Özgür

We investigate design and performance of communications over the bandlimited Gaussian channel with one-bit output quantization. A transceiver structure is proposed, which generates the channel input using a finite set of time-limited and…

Information Theory · Computer Science 2020-11-05 Rui Deng , Jing Zhou , Wenyi Zhang

We develop a framework that we call compressive rate estimation. We assume that the composite channel gain matrix (i.e. the matrix of all channel gains between all network nodes) is compressible which means it can be approximated by a…

Information Theory · Computer Science 2015-04-29 Jan Schreck , Peter Jung , Sławomir Stańczak

The ability of overparameterized deep networks to generalize well has been linked to the fact that stochastic gradient descent (SGD) finds solutions that lie in flat, wide minima in the training loss -- minima where the output of the…

Machine Learning · Computer Science 2019-06-03 Vaishnavh Nagarajan , J. Zico Kolter

In this paper, a new and general version of Gaussian channel in presence of two-sided state information correlated to the channel input and noise is considered. Determining a general achievable rate for the channel and obtaining the…

Information Theory · Computer Science 2015-07-20 Nima S. Anzabi-Nezhad , Ghosheh Abed Hodtani , Mohammad Molavi Kakhki

We consider a relay network with two relays and two feedback links from the relays to the sender. To obtain the achievability results, we use the compress-and-forward and the decode-and-forward strategies to superimpose facility and…

Information Theory · Computer Science 2011-11-11 Mohammad Ali Tebbi , Mahtab Mirmohseni , Mahmoud Ahmadian Attari , Mohammad Reza Aref

In some applications, the variance of additive measurement noise depends on the signal that we aim to measure. For instance, additive Gaussian signal-dependent noise (AGSDN) channel models are used in molecular and optical communication.…

Information Theory · Computer Science 2017-06-05 Hamid Ghourchian , Gholamali Aminian , Amin Gohari , Mahtab Mirmohseni , Masoumeh Nasiri-Kenari

New upper bounds on the sum capacity of the two-user Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum capacity if the interference levels are below certain…

Information Theory · Computer Science 2008-01-04 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

In \cite{butman1976} the linear coding scheme is applied, $X_t =g_t\Big(\Theta - {\bf E}\Big\{\Theta\Big|Y^{t-1}, V_0=v_0\Big\}\Big)$, $t=2,\ldots,n$, $X_1=g_1\Theta$, with $\Theta: \Omega \to {\mathbb R}$, a Gaussian random variable, to…

Information Theory · Computer Science 2021-06-17 Charalambos D. Charalambous , Christos Kourtellaris , Themistoklis Charalambous

Information transmission over discrete-time channels with memoryless additive noise obeying a Cauchy, rather than Gaussian, distribution, are studied. The channel input satisfies an average power constraint. Upper and lower bounds to such…

Information Theory · Computer Science 2024-11-19 Shuqin Pang , Wenyi Zhang

The problem of minimizing the total power consumption while satisfying different quality-of-service (QoS) requirements in a two-hop multiple-input multiple-output network with a single non-regenerative relay is considered. As shown by Y.…

Information Theory · Computer Science 2013-03-13 Luca Sanguinetti , Antonio A. D'Amico

The scaling laws of the achievable communication rates and the corresponding upper bounds of distributed reception in the presence of an interfering signal are investigated. The scheme includes one transmitter communicating to a remote…

Information Theory · Computer Science 2009-12-08 Amichai Sanderovich , Michael Peleg , Shlomo Shamai

Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be easily evaluated is not available and an explicit coding scheme which…

Information Theory · Computer Science 2015-11-18 Nikola Zlatanov , Vahid Jamali , Derrick Wing Kwan Ng , Robert

In this paper, we derive UWB version of (i) general best achievable rate for the relay channel with decode-andforward strategy and (ii) max-flow min-cut upper bound, such that the UWB relay channel can be studied considering the obtained…

Information Theory · Computer Science 2011-09-15 Maryam Faramarzi Yazd , Ghosheh Abed Hodtani

Optimization methods aimed at estimating the capacities of a general Gaussian channel are developed. Specifically evaluation of classical capacity as maximum of the Holevo information is pursued over all possible Gaussian encodings for the…

Quantum Physics · Physics 2012-09-12 Oleg V. Pilyavets , Cosmo Lupo , Stefano Mancini

A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than -1, the gap between the sum-rate the scheme achieves and the full-cooperation bound…

Information Theory · Computer Science 2015-03-13 Michael Gastpar , Amos Lapidoth , Yossef Steinberg , Michele Wigger