中文
相关论文

相关论文: On the Optimality of Gaussian Code-books for Signa…

200 篇论文

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…

量子物理 · 物理学 2015-05-07 Jaehak Lee , Se-Wan Ji , Jiyong Park , Hyunchul Nha

This paper studies the achievable rates of Gaussian interference channels with additive white Gaussian noise (AWGN), when improper or circularly asymmetric complex Gaussian signaling is applied. For the Gaussian multiple-input…

信息论 · 计算机科学 2016-11-18 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

The effect of "good", point-to-point capacity achieving, code sequences on an additional signal, of bounded variance, transmitted over the additive Gaussian noise channel is examined. For such code sequences, it is shown that their effect,…

信息论 · 计算机科学 2018-04-18 Ronit Bustin , H. Vincent Poor , Shlomo Shamai

A simple encoding scheme based on Sato's non-na\"ive frequency division is proposed for a class of Gaussian interference channels with mixed interference. The achievable region is shown to be equivalent to that of Costa's noiseberg region…

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

We address single-user data transmission over a channel where the received signal incurs interference from a finite number of users (interfering users) that use single codebooks for transmitting their own messages. The receiver, however, is…

信息论 · 计算机科学 2007-11-21 Abolfazl S. Motahari , Amir K. Khandani

This paper investigates the fundamental performance limits of the two-user interference channel in the presence of an external eavesdropper. In this setting, we construct an inner bound, to the secrecy capacity region, based on the idea of…

信息论 · 计算机科学 2015-03-13 O. Ozan Koyluoglu , Hesham El Gamal

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO…

信息论 · 计算机科学 2009-05-01 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A channel in this class has the property that, for the…

信息论 · 计算机科学 2008-08-07 Nan Liu , Andrea Goldsmith

Gaussian loss channels are of particular importance since they model realistic optical communication channels. Except for special cases, quantum capacity of Gaussian loss channels is not yet known completely. In this paper, we provide…

量子物理 · 物理学 2019-03-19 Kyungjoo Noh , Victor V. Albert , Liang Jiang

Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two user Gaussian interference…

信息论 · 计算机科学 2009-02-15 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

A general time-varying feedback coding scheme is proposed for $M$-user fully connected symmetric Gaussian interference channels. Based on the analysis of the general coding scheme, we prove a theorem which gives a criterion for designing…

信息论 · 计算机科学 2019-10-01 Lan V. Truong , Hirosuke Yamamoto

This paper studies the achievable rate region of the K-user Gaussian multiple-input single-output interference channel (MISO-IC) with the interference treated as noise, when improper or circularly asymmetric complex Gaussian signaling is…

信息论 · 计算机科学 2013-10-10 Yong Zeng , Rui Zhang , Erry Gunawan , Yong Liang Guan

We consider a Gaussian multiple-access channel where the number of transmitters grows with the blocklength $n$. For this setup, the maximum number of bits that can be transmitted reliably per unit-energy is analyzed. We show that if the…

信息论 · 计算机科学 2019-04-29 Jithin Ravi , Tobias Koch

We introduce the two user finite state compound Gaussian interference channel and characterize its capacity region to within one bit. The main contributions involve both novel inner and outer bounds. The inner bound is multilevel…

信息论 · 计算机科学 2008-05-01 Adnan Raja , Vinod M. Prabhakaran , Pramod Viswanath

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

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

In this paper, we propose an achievable rate region for discrete memoryless interference channels with conferencing at the transmitter side. We employ superposition block Markov encoding, combined with simultaneous superposition coding,…

信息论 · 计算机科学 2007-07-13 Yi Cao , Biao Chen

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 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…

信息论 · 计算机科学 2021-03-18 Min Qiu , Yu-Chih Huang , Jinhong Yuan

In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the…

信息论 · 计算机科学 2017-08-04 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

This paper considers a Gaussian broadcast channel with two unmatched degraded components, three particular messages, and a common message that is intended for all three receivers. It is shown that for this channel superposition coding and…

信息论 · 计算机科学 2009-11-04 Ramy H. Gohary , Timothy N. Davidson