English
Related papers

Related papers: Capacity Bounds for Peak-Constrained Multiantenna …

200 papers

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number…

Information Theory · Computer Science 2008-03-11 Satish Babu Korada , Nicolas Macris

Transmit signal and bandwidth optimization is considered in multiple-antenna relay channels. Assuming all terminals have channel state information, the cut-set capacity upper bound and decode-and-forward rate under full-duplex relaying are…

Information Theory · Computer Science 2011-11-30 Chris T. K. Ng , Gerard J. Foschini

The performance of continuous aperture array (CAPA)-based wireless communications is analyzed in an uplink scenario. An analytical framework is proposed to characterize uplink CAPA-based transmission using electromagnetic field theories. On…

Signal Processing · Electrical Eng. & Systems 2024-05-28 Chongjun Ouyang , Yuanwei Liu , Xingqi Zhang

This paper provides an explicit expression for the capacity region of the two-user broadcast Z channel and proves that the optimal boundary can be achieved by independent encoding of each user. Specifically, the information messages…

Information Theory · Computer Science 2008-10-20 Bike Xie , Miguel Griot , Andres I. Vila Casado , Richard D. Wesel

In this paper, capacity inner and outer bounds are established for the multiuser channels with Channel State Information (CSI) known non-causally at the transmitters: The Multiple Access Channel (MAC), the Broadcast Channel (BC) with common…

Information Theory · Computer Science 2013-02-17 Reza K. Farsani , Farokh Marvasti

Unlike conventional systems using a fixed-location antenna, the channel capacity of the pinching-antenna system (PASS) is determined by the activated positions of pinching antennas. This article characterizes the capacity region of…

Information Theory · Computer Science 2025-06-18 Chongjun Ouyang , Zhaolin Wang , Yuanwei Liu , Zhiguo Ding

We determine the secrecy capacity of the compound channel with quantum wiretapper and channel state information at the transmitter. Moreover, we derive a lower bound on the secrecy capacity of this channel without channel state information…

Information Theory · Computer Science 2015-06-15 Holger Boche , Minglai Cai , Ning Cai , Christian Deppe

Optimal signalling over the Gaussian MIMO wire-tap channel is studied under the total transmit power constraint. A closed-form solution for an optimal transmit covariance matrix is obtained when the channel is strictly degraded. In…

Information Theory · Computer Science 2016-11-02 Sergey Loyka , Charalambos D. Charalambous

Constellation shaping is a practical and effective technique to improve the performance and the rate adaptivity of optical communication systems. In principle, it could also be used to mitigate the impact of nonlinear effects, possibly…

Information Theory · Computer Science 2022-06-08 Marco Secondini , Stella Civelli , Enrico Forestieri , Lareb Zar Khan

Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…

The problem of identification over a discrete memoryless wiretap channel is examined under the criterion of semantic effective secrecy. This secrecy criterion guarantees both the requirement of semantic secrecy and of stealthy…

Information Theory · Computer Science 2025-02-27 Abdalla Ibrahim , Johannes Rosenberger , Boulat A. Bash , Christian Deppe , Roberto Ferrara , Uzi Pereg

Densifying networks and deploying more antennas at each access point are two principal ways to boost the capacity of wireless networks. However, the complicated distributions of the signal power and the accumulated interference power,…

Information Theory · Computer Science 2018-09-25 Xianghao Yu , Chang Li , Jun Zhang , Martin Haenggi , Khaled B. Letaief

We determine the capacity of the classical compound quantum wiretapper channel with channel state information at the transmitter. Moreover we derive a lower bound on the capacity of this channel without channel state information and…

Quantum Physics · Physics 2012-02-06 Minglai Cai , Ning Cai , Christian Deppe

A discrete-time Wiener phase noise channel with an integrate-and-dump multi-sample receiver is studied. An upper bound to the capacity with an average input power constraint is derived, and a high signal-to-noise ratio (SNR) analysis is…

Information Theory · Computer Science 2016-11-17 Luca Barletta , Gerhard Kramer

Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…

Information Theory · Computer Science 2015-12-18 Jihad Fahs , Ibrahim Abou-Faycal

Recent results establish the optimality of interference alignment to approach the Shannon capacity of interference networks at high SNR. However, the extent to which interference can be aligned over a finite number of signalling dimensions…

Information Theory · Computer Science 2016-11-17 Krishna Gomadam , Viveck R. Cadambe , Syed A. Jafar

A well-known lower bound widely used in the massive MIMO literature hinges on channel hardening, i.e., the phenomenon for which, thanks to the large number of antennas, the effective channel coefficients resulting from beamforming tend to…

Information Theory · Computer Science 2017-10-27 Giuseppe Caire

Quantum communication channels differ from their classical counterparts because their capacities can be superadditive. The principle of monogamy of entanglement suggests that superadditive improvements in the transmission capacity of a…

Quantum Physics · Physics 2025-11-06 Satvik Singh , Sergii Strelchuk

We consider a wireless network in which a single source node located at the center of a unit area having $m$ antennas transmits messages to $n$ randomly located destination nodes in the same area having a single antenna each. To achieve the…

Information Theory · Computer Science 2013-10-29 Sang-Woon Jeon , Sae-Young Chung

This paper gives the approximate capacity region of a two-user MIMO interference channel with limited receiver cooperation, where the gap between the inner and outer bounds is in terms of the total number of receive antennas at the two…

Information Theory · Computer Science 2014-07-08 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang