中文
相关论文

相关论文: A Counterexample to Cover's 2P Conjecture on Gauss…

200 篇论文

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…

信息论 · 计算机科学 2008-01-16 Xiaohu Shang , Gerhard Kramer , Biao Chen

In Shannon information theory the capacity of a memoryless communication channel cannot be increased by the use of feedback. In quantum information theory the no-cloning theorem means that noiseless copying and feedback of quantum…

量子物理 · 物理学 2016-11-17 Garry Bowen

We consider a line with noise in the simplest case. Loss does not add noise. Amplification via phase insensitive amplifiers do add noise. A lower bound of this capacity is the quantum analog to the Shannon capacity of a linear channel with…

量子物理 · 物理学 2013-03-05 Antonio Mecozzi

The purpose of this work is to extend the result of previous papers quant-ph/9611023, quant-ph/9703013 to quantum channels with additive constraints onto the input signal, by showing that the capacity of such channel is equal to the…

量子物理 · 物理学 2007-05-23 A. S. Holevo

We investigate how to exploit intermittent feedback for interference management by studying the two-user Gaussian interference channel (IC). We approximately characterize (within a universal constant) the capacity region for the Gaussian IC…

信息论 · 计算机科学 2016-11-17 Can Karakus , I-Hsiang Wang , Suhas Diggavi

We consider a quantum bosonic channel that couples the input mode via a beam splitter or two-mode squeezer to an environmental mode that is prepared in an arbitrary state. We investigate the classical capacity of this channel, which we call…

量子物理 · 物理学 2026-01-23 Zacharie Van Herstraeten , Saikat Guha , Nicolas J. Cerf

We use the idea of dependence balance to obtain a new outer bound for the capacity region of the discrete memoryless multiple access channel with noiseless feedback (MAC-FB). We consider a binary additive noisy MAC-FB whose feedback…

信息论 · 计算机科学 2016-11-17 Ravi Tandon , Sennur Ulukus

Feedback is shown to increase the sum-rate capacity of K-user Gaussian multiple-access channels by at most a factor of approximately 1.54, improving Thomas' doubling bound (1987). The new bound is the best possible in the sense that it can…

信息论 · 计算机科学 2021-08-24 Gerhard Kramer

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…

In this paper, a channel that is contaminated by two independent Gaussian noises $S ~ N(0,Q)$ and $Z_0 ~ N(0,N_0)$ is considered. The capacity of this channel is computed when independent noisy versions of $S$ are known to the transmitter…

信息论 · 计算机科学 2008-06-18 Yong Peng , Dinesh Rajan

We characterize the capacity region to within log{2(M-1)} bits/s/Hz for the M-transmitter K-receiver Gaussian multicast channel with feedback where each receiver wishes to decode every message from the M transmitters. Extending…

信息论 · 计算机科学 2012-05-21 Changho Suh , Naveen Goela , Michael Gastpar

Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network…

信息论 · 计算机科学 2015-07-16 Ritesh Kolte , Ayfer Özgür , Abbas El Gamal

A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this setup, and we show that this outer bound is achievable in some cases.…

信息论 · 计算机科学 2010-11-01 Anas Chaaban , Aydin Sezgin

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…

信息论 · 计算机科学 2008-01-04 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

The capacity-achieving input distribution of the discrete-time, additive white Gaussian noise (AWGN) channel with an amplitude constraint is discrete and seems difficult to characterize explicitly. A dual capacity expression is used to…

信息论 · 计算机科学 2015-11-30 Andrew Thangaraj , Gerhard Kramer , Georg Bocherer

In the recent paper [1] it is shown, via an application example, that the Cover and Pombra [2] "characterization of the $n-$block or transmission" feedback capacity formula, of additive Gaussian noise (AGN) channels, is the subject of much…

信息论 · 计算机科学 2020-10-14 Charalambos D. Charalambous , Christos Kourtellaris , Stelios Louka

In this paper, we study, information theoretically, the impact of transmitter and or receiver cognition on the channel capacity. The cognition can be described by state information, dependent on the channel noise and or input. Specifically,…

信息论 · 计算机科学 2015-03-19 Nima S. Anzabi-Nezhad , Ghosheh Abed Hodtani , Mohammad Molavi Kakhki

We observe that given two (compatible) classes of functions $\mathcal{F}$ and $\mathcal{H}$ with small capacity as measured by their uniform covering numbers, the capacity of the composition class $\mathcal{H} \circ \mathcal{F}$ can become…

机器学习 · 统计学 2022-06-16 Alireza Fathollah Pour , Hassan Ashtiani

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…

信息论 · 计算机科学 2024-11-19 Shuqin Pang , Wenyi Zhang

We investigate the Peak-Power Limited (PPL) Additive White Gaussian Noise (AWGN) channels in which the signal is band-limited, and its instantaneous power cannot exceed the power P. This model is relevant to many communication systems;…

信息论 · 计算机科学 2024-12-10 Michael Peleg , Shlomo Shamai