English
Related papers

Related papers: Capacity Bounds for Peak-Constrained Multiantenna …

200 papers

We consider a peak-power-limited single-antenna block-stationary Gaussian fading channel where neither the transmitter nor the receiver knows the channel state information, but both know the channel statistics. This model subsumes most…

Information Theory · Computer Science 2016-11-17 Jun Chen , Venugopal V. Veeravalli

We consider the problem of estimating the states of weakly coupled linear systems from sampled measurements. We assume that the total capacity available to the sensors to transmit their samples to a network manager in charge of the…

Systems and Control · Computer Science 2016-10-25 Xudong Chen , M. -A. Belabbas , Tamer Basar

We introduce a new analysis technique to derive a single-letter upper bound on the mismatch capacity of a stationary, single-user, memoryless channel with a decoding metric $q$. Our bound is obtained by considering a multicast transmission…

Information Theory · Computer Science 2021-03-29 Anelia Somekh-Baruch

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

Information Theory · Computer Science 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

We investigate the capacity of the $Q$-frequency $S$-user vector adder channel (channel with intensity information) introduced by Chang and Wolf. Both coordinated and uncoordinated types of transmission are considered. Asymptotic (under the…

Information Theory · Computer Science 2014-01-10 Alexey Frolov , Pavel Rybin , Victor Zyablov

We investigate the maximum rates for transmitting quantum information, distilling entanglement, and distributing secret keys between a sender and a receiver in a multipoint communication scenario, with the assistance of unlimited two-way…

Quantum Physics · Physics 2017-11-30 Riccardo Laurenza , Stefano Pirandola

We determine the capacity-achieving input covariance matrices for coherent block-fading correlated MIMO Rician channels. In contrast with the Rayleigh and uncorrelated Rician cases, no closed-form expressions for the eigenvectors of the…

Information Theory · Computer Science 2007-07-13 Julien Dumont , Philippe Loubaton , Samson Lasaulce

Information must take up space, must weigh, and its flux must be limited. Quantum limits on communication and information storage leading to these conclusions are here described. Quantum channel capacity theory is reviewed for both steady…

Quantum Physics · Physics 2015-06-26 Jacob D. Bekenstein , Marcelo Schiffer

The study of degrees of freedom of signals observed within spatially diverse broadband multipath fields is an area of ongoing investigation and has a wide range of applications, including characterising broadband MIMO and cooperative…

Information Theory · Computer Science 2014-05-12 Farhana Bashar , S. M. Akramus Salehin , Thushara D. Abhayapala

We derive inner and outer bounds on the capacity region for a class of three-user partially connected interference channels. We focus on the impact of topology, interference alignment, and interplay between interference and noise. The…

Information Theory · Computer Science 2017-02-14 Muryong Kim , Yitao Chen , Sriram Vishwanath

The capacity of a Multiple-Input Multiple-Output (MIMO) channel in which the antenna outputs are processed by an analog linear combining network and quantized by a set of threshold quantizers is studied. The linear combining weights and…

Information Theory · Computer Science 2018-06-06 Abbas Khalili , Stefano Rini , Luca Barletta , Elza Erkip , Yonina C. Eldar

We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…

Information Theory · Computer Science 2011-08-10 Igor Bjelaković , Holger Boche , Jochen Sommerfeld

This work studies the capacity of multipath fading channels. A noncoherent channel model is considered, where neither the transmitter nor the receiver is cognizant of the realization of the path gains, but both are cognizant of their…

Information Theory · Computer Science 2009-01-06 Tobias Koch , Amos Lapidoth

Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic model for wireless random networks. We prove that the capacity of…

Information Theory · Computer Science 2008-11-11 Salah A. Aly , Vishal Kapoor , Jie Meng , Andreas Klappenecker

Contrary to the vast majority of works on simultaneous wireless information and power transfer that provide information-theoretic limits for the separate receiver architecture, in this work we focus on the integrated receiver and provide a…

Information Theory · Computer Science 2026-04-22 Konstantinos Ntontin , Symeon Chatzinotas

Recently, the secrecy capacity of the multi-antenna wiretap channel was characterized by Khisti and Wornell [1] using a Sato-like argument. This note presents an alternative characterization using a channel enhancement argument. This…

Information Theory · Computer Science 2007-10-23 Tie Liu , Shlomo Shamai

Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station.…

Quantum Physics · Physics 2020-04-01 Felix Leditzky , Mohammad A. Alhejji , Joshua Levin , Graeme Smith

The linear shift deterministic Y-channel is studied. That is, we have three users and one relay, where each user wishes to broadcast one message to each other user via the relay, resulting in a multi-way relaying setup. The cut-set bounds…

Information Theory · Computer Science 2015-03-19 Anas Chaaban , Aydin Sezgin

The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Anne Savard , Matthieu R. Bloch

Wideband communications are impossible with signals that are spread over a very large band and are transmitted over multipath channels unknown ahead of time. This work exploits the I-mmse connection to bound the achievable data-rate of…

Information Theory · Computer Science 2008-04-09 Elchanan Zwecher , Dana Porrat