中文
相关论文

相关论文: Outer Bounds for Multiple Access Channels with Fee…

200 篇论文

New achievable rate regions are derived for the two-user additive white Gaussian multiple-access channel with noisy feedback. The regions exhibit the following two properties. Irrespective of the (finite) Gaussian feedback-noise variances,…

信息论 · 计算机科学 2010-04-13 Amos Lapidoth , Michele A. Wigger

We study the best known general inner bound[MAR '79] and outer bound[N-EG'07] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bound is identical to a weaker form of the outer…

信息论 · 计算机科学 2008-04-25 Chandra Nair , Vincent Wang Zizhou

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

An outer bound to the two-receiver discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as tight as the existing bounds.

信息论 · 计算机科学 2008-07-24 Chandra Nair

This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…

信息论 · 计算机科学 2011-08-02 Ahmad Abu Al Haija , Mai Vu

A class of diamond networks is studied where the broadcast component is orthogonal and modeled by two independent bit-pipes. New upper and lower bounds on the capacity are derived. The proof technique for the upper bound generalizes…

信息论 · 计算机科学 2015-10-06 Shirin Saeedi Bidokhti , Gerhard Kramer

This paper considers the cognitive interference channel (CIC) with two transmitters and two receivers, in which the cognitive transmitter non-causally knows the message and codeword of the primary transmitter. We first introduce a discrete…

信息论 · 计算机科学 2011-02-08 Mojtaba Vaezi , Mai Vu

The cognitive interference channel is an interference channel in which one transmitter is non-causally provided with the message of the other transmitter. This channel model has been extensively studied in the past years and capacity…

信息论 · 计算机科学 2010-03-24 Stefano Rini , Daniela Tuninetti , Natasha Devroye

This paper provides a numerical framework for computing the achievable rate region of memoryless multiple access channel (MAC) with a continuous alphabet from data. In particular, we use recent results on variational lower bounds on mutual…

信息论 · 计算机科学 2021-11-30 Farhad Mirkarimi , Nariman Farsad

It is well known that the capacity region of an average transmit power constrained Gaussian Broadcast Channel (GBC) with independent noise realizations at the receivers is enlarged by the presence of causal noiseless feedback. Capacity…

信息论 · 计算机科学 2020-09-21 Aditya Narayan Ravi , Sibi Raj B. Pillai , Vinod Prabhakaran , Michèle Wigger

This paper considers the problem of cognitive radios with partial-message information. Here, an interference channel setting is considered where one transmitter (the "cognitive" one) knows the message of the other ("legitimate" user)…

信息论 · 计算机科学 2008-12-31 G. Chung , S. Sridharan , S. Vishwanath , C. S. Hwang

We consider the capacity of memoryless finite-state multiple access channel (FS-MAC) with causal asymmetric noisy state information available at both transmitters and complete state information available at the receiver. Single letter inner…

信息论 · 计算机科学 2011-06-03 Nevroz Şen , Giacomo Como , Serdar Yüksel , Fady Alajaji

The cognitive interference channel (C-IFC) consists of a classical two-user interference channel in which the message of one user (the "primary" user) is non-causally available at the transmitter of the other user (the "cognitive" user). We…

信息论 · 计算机科学 2016-11-18 Stefano Rini , Daniela Tuninetti , Natasha Devroye

This paper studies the two-user Causal Cognitive Interference Channel (CCIC), where two transmitters aim to communicate independent messages to two different receivers via a common channel. One source, referred to as the cognitive, is…

信息论 · 计算机科学 2016-11-15 Martina Cardone , Daniela Tuninetti , Raymond Knopp

This paper studies the two-user interference channel with unilateral source cooperation, which consists of two source-destination pairs that share the same channel and where one full-duplex source can overhear the other source through a…

信息论 · 计算机科学 2016-11-17 Martina Cardone , Daniela Tuninetti , Raymond Knopp , Umer Salim

A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this…

信息论 · 计算机科学 2016-11-18 Xiaohu Shang , Gerhard Kramer , Biao Chen

This paper adds to the understanding of the capacity region of the Gaussian interference channel. To this end, the capacity region of the one-sided Gaussian interference channel is first fully characterized. This is accomplished by…

信息论 · 计算机科学 2015-09-22 Mojtaba Vaezi , H. Vincent Poor

In this paper, we obtain a family of lower bounds for the sum capacity of Code Division Multiple Access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The…

信息论 · 计算机科学 2016-11-18 K. Alishahi , F. Marvasti , V. Aref , P. Pad

We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We develop achievable schemes and derive a new outer bound to…

信息论 · 计算机科学 2010-05-20 Changho Suh , David Tse

This work proposes a novel outer bound for the Gaussian cognitive interference channel in strong interference at the primary receiver based on the capacity of a multi-antenna broadcast channel with degraded message set. It then shows that…

信息论 · 计算机科学 2015-03-19 Stefano Rini , Daniela Tuninetti , Natasha Devroye