中文
相关论文

相关论文: Sum-Capacity and the Unique Separability of the Pa…

200 篇论文

It is known that the capacity of parallel (multi-carrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocation across carriers. In…

信息论 · 计算机科学 2016-11-17 Viveck R. Cadambe , Syed A. Jafar

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

信息论 · 计算机科学 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor

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

The sum-rate capacity of the parallel Gaussian interference channel is shown to be achieved by independent transmission across sub-channels and treating interference as noise in each sub-channel if the channel coefficients and power…

信息论 · 计算机科学 2009-03-04 Xiaohu Shang , Biao Chen , Gerhard Kramer , H. Vincent Poor

We study the interaction between two interfering Gaussian 2-user multiple access channels. The capacity region is characterized under mixed strong--extremely strong interference and individually very strong interference. Furthermore, the…

信息论 · 计算机科学 2011-03-15 Anas Chaaban , Aydin Sezgin , Bernd Bandemer , Arogyaswami Paulraj

A two-user symmetric Gaussian Interference Channel (IC) is considered in which a noiseless unidirectional link connects one encoder to the other. Having a constant capacity, the additional link provides partial cooperation between the…

信息论 · 计算机科学 2009-09-16 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

In this paper, we investigate the sum-capacity of the two-user Gaussian interference channel with Gaussian superposition coding and successive decoding. We first examine an approximate deterministic formulation of the problem, and introduce…

信息论 · 计算机科学 2011-03-30 Yue Zhao , Chee Wei Tan , A. Salman Avestimehr , Suhas N. Diggavi , Gregory J. Pottie

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…

信息论 · 计算机科学 2012-07-16 Fangfang Zhu , Biao Chen

Approximate capacity regions are established for a class of interfering multiple access channels consisting of two multiple-access channels (MACs), each with an arbitrary number of transmitters, with one transmitter in each MAC causing…

信息论 · 计算机科学 2018-09-05 Yimin Pang , Mahesh K. Varanasi

The role of cooperation in managing interference - a fundamental feature of the wireless channel - is investigated by studying the two-user Gaussian interference channel where the source nodes can both transmit and receive in full-duplex.…

信息论 · 计算机科学 2011-01-28 Vinod M. Prabhakaran , Pramod Viswanath

The capacity regions of vector, or multiple-input multiple-output, Gaussian interference channels are established for very strong interference and aligned strong interference. Furthermore, the sum-rate capacities are established for Z…

信息论 · 计算机科学 2016-11-17 Xiaohu Shang , Biao Chen , Gerhard Kramer , H. Vincent Poor

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

信息论 · 计算机科学 2013-03-11 Fangfang Zhu , Biao Chen

A two-user Gaussian Z-Interference Channel (GZIC) is considered, in which encoders are connected through noiseless links with finite capacities. In this setting, prior to each transmission block the encoders communicate with each other over…

信息论 · 计算机科学 2010-05-28 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

This paper characterizes the capacity region of Gaussian MIMO broadcast channels (BCs) with per-antenna power constraint (PAPC). While the capacity region of MIMO BCs with a sum power constraint (SPC) was extensively studied, that under…

信息论 · 计算机科学 2017-05-18 Thuy M. Pham , Ronan Farrell , Le-Nam Tran

In this paper, we analyze the Gaussian X channel in the mixed interference regime. In this regime, multiple access transmission to one of the receivers is shown to be close to optimal in terms of sum rate. Three upper bounds are derived for…

信息论 · 计算机科学 2015-05-26 Praneeth Kumar , Srikrishna Bhashyam

In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…

信息论 · 计算机科学 2021-04-29 Zheng Li , Sheng Yang , Shlomo Shamai

A $K$-user cascade Gaussian Z-interference channel is a subclass of the general $K$-user Gaussian interference channel, where each user, except the first one, experiences interference only from the previous user. Under simple Han-Kobayashi…

信息论 · 计算机科学 2011-06-14 Yuanpeng Liu , Elza Erkip

The capacity regions of multiple-input multiple-output Gaussian Z-interference channels are established for the very strong interference and aligned strong interference cases. The sum-rate capacity of such channels is established under…

信息论 · 计算机科学 2009-11-25 Xiaohu Shang , Biao Chen , Gerhard Kramer , H. Vincent Poor

The sum-capacity for specific sub-classes of ergodic fading Gaussian two-user interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the sub-classes of…

信息论 · 计算机科学 2016-11-17 Lalitha Sankar , Xiaohu Shang , Elza Erkip , H. Vincent Poor

We obtain new sum capacity results for the Gaussian many-to-one and one-to-many interference channels in channel parameter regimes where the sum capacity was known only up to a constant gap. Simple Han-Kobayashi (HK) schemes, i.e., HK…

信息论 · 计算机科学 2017-05-04 Abhiram Gnanasambandam , Ragini Chaluvadi , Srikrishna Bhashyam
‹ 上一页 1 2 3 10 下一页 ›