中文
相关论文

相关论文: Capacity per Unit-Energy of Gaussian Many-Access C…

200 篇论文

We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…

信息论 · 计算机科学 2014-01-22 Quan Geng , Tie Liu

Unlike point-to-point cognitive radio, where the constraint imposed by the primary rigidly curbs the secondary throughput, multiple secondary users have the potential to more efficiently harvest the spectrum and share it among themselves.…

信息论 · 计算机科学 2010-08-24 Yang Li , Aria Nosratinia

This paper derives upper and lower bounds on the capacity of the multiple-input single-output free-space optical intensity channel with signal-independent additive Gaussian noise subject to both an average-intensity and a peak-intensity…

信息论 · 计算机科学 2017-10-26 Stefan M. Moser , Ligong Wang , Michèle Wigger

Conventional multi-user multiple-input multiple-output (MU-MIMO) mainly focused on Gaussian signaling, independent and identically distributed (IID) channels, and a limited number of users. It will be laborious to cope with the…

信息论 · 计算机科学 2022-09-20 Yuhao Chi , Lei Liu , Guanghui Song , Ying Li , Yong Liang Guan , Chau Yuen

We consider the classical AWGN channel where the channel input is constrained to an amplitude constraint that stochastically varies at each channel use, independent of the message. This is an abstraction of an energy harvesting transmitter…

信息论 · 计算机科学 2012-01-24 Omur Ozel , Sennur Ulukus

In this paper, the fundamental limits of decentralized simultaneous information and energy transmission in the $K$-user Gaussian multiple access channel (G-MAC), with an arbitrary $K \geqslant 2$ and one non-colocated energy harvester (EH),…

信息论 · 计算机科学 2017-09-27 Selma Belhadj Amor , Samir M. Perlaza , H. Vincent Poor

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 consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a scheme called Distributed Rate Splitting to achieve the…

信息论 · 计算机科学 2016-11-18 Jian Cao , Edmund M. Yeh

This paper considers a Strongly Asynchronous and Slotted Massive Access Channel (SAS-MAC) where $K_n:=e^{n\nu}$ different users transmit a randomly selected message among $M_n:=e^{nR}$ ones within a strong asynchronous window of length…

信息论 · 计算机科学 2018-07-27 Sara Shahi , Daniela Tuninetti , Natasha Devroye

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

The capacity of the two-user Gaussian cognitive interference channel, a variation of the classical interference channel where one of the transmitters has knowledge of both messages, is known in several parameter regimes but remains unknown…

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

The L-user additive white Gaussian noise multiway relay channel is investigated, where L users exchange information at the same rate through a single relay. A new achievable rate region, based on the functional-decode-forward coding…

信息论 · 计算机科学 2012-09-10 Lawrence Ong , Christopher M. Kellett , Sarah J. Johnson

The use of 1-bit analog-to-digital converters (ADCs) is seen as a promising approach to significantly reduce the power consumption and hardware cost of multiple-input multiple-output (MIMO) receivers. However, the nonlinear distortion due…

信息论 · 计算机科学 2022-10-12 Neil Irwin Bernardo , Jingge Zhu , Yonina C. Eldar , Jamie Evans

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

This paper studies the capacity region of a $K$-user cyclic Gaussian interference channel, where the $k$th user interferes with only the $(k-1)$th user (mod $K$) in the network. Inspired by the work of Etkin, Tse and Wang, who derived a…

信息论 · 计算机科学 2012-09-03 Lei Zhou , Wei Yu

Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to…

信息论 · 计算机科学 2016-11-15 Or Ordentlich , Uri Erez , Bobak Nazer

This paper studies the capacity region of a $K$-user cyclic Gaussian interference channel, where the $k$th user interferes with only the $(k-1)$th user (mod $K$) in the network. Inspired by the work of Etkin, Tse and Wang, which derived a…

信息论 · 计算机科学 2012-05-22 Lei Zhou , Wei Yu

In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the…

信息论 · 计算机科学 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

Quantum communication is an important branch of quantum information science, promising unconditional security to classical communication and providing the building block of a future large-scale quantum network. Noise in realistic quantum…

量子物理 · 物理学 2020-01-24 Kyungjoo Noh , Stefano Pirandola , Liang Jiang

We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set upper bound on the capacity of these networks. This constant…

信息论 · 计算机科学 2016-11-17 Amir Salman Avestimehr , Suhas N. Diggavi , David N C. Tse