English
Related papers

Related papers: Proof of the outage probability conjecture for MIS…

200 papers

This paper considers multi-cell Massive MIMO (multiple-input multiple-output) systems where the channels are spatially correlated Rician fading. The channel model is composed of a deterministic line-of-sight (LoS) path and a stochastic…

Information Theory · Computer Science 2019-06-14 Özgecan Özdogan , Emil Björnson , Erik G. Larsson

In this paper we consider the robust secure beamformer design for MISO wiretap channels. Assume that the eavesdroppers' channels are only partially available at the transmitter, we seek to maximize the secrecy rate under the transmit power…

Information Theory · Computer Science 2013-10-29 Shuai Ma , Mingyi Hong , Enbin Song , Xiangfeng Wang , Dechun Sun

The information that can be transmitted through a wireless channel, with multiple-antenna equipped transmitter and receiver, is crucially influenced by the channel behavior as well as by the structure of the input signal. We characterize in…

Information Theory · Computer Science 2014-10-22 Giuseppa Alfano , Carla-Fabiana Chiasserini , Alessandro Nordio , Siyuan Zhou

We study analogue source transmission over MIMO block-fading channels with receiver-only channel state information. Unlike previous work which considers the end-to-end expected distortion as a figure of merit, we study the distortion outage…

Information Theory · Computer Science 2016-11-15 Li Peng , Albert Guillen i Fabregas

The mutual information (MI) of Gaussian multi-input multi-output (MIMO) channels has been evaluated by utilizing random matrix theory (RMT) and shown to asymptotically follow Gaussian distribution, where the ergodic mutual information (EMI)…

Information Theory · Computer Science 2021-12-30 Xin Zhang , S. H. Song

A Gaussian multiple-input single-output (MISO) wiretap channel model is considered, where there exists a transmitter equipped with multiple antennas, a legitimate receiver and an eavesdropper each equipped with a single antenna. We study…

Information Theory · Computer Science 2010-03-12 Jiangyuan Li , Athina P. Petropulu

Approximate random matrix models for $\kappa-\mu$ and $\eta-\mu$ faded multiple input multiple output (MIMO) communication channels are derived in terms of a complex Wishart matrix. The proposed approximation has the least Kullback-Leibler…

Information Theory · Computer Science 2019-10-23 Muralikrishnan Srinivasan , Sheetal Kalyani

We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and temporal memory. The fading number is the second term, after…

Information Theory · Computer Science 2007-07-16 Stefan M. Moser

This paper considers a multiple-input multiple-output (MIMO) Gaussian wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each equipped with multiple antennas. In this paper, we first revisit…

Information Theory · Computer Science 2015-06-11 S. Ali A. Fakoorian , A. Lee Swindlehurst

We study the Gaussian MIMO wiretap channel with a transmitter, a legitimate receiver, an eavesdropper and an external helper, each equipped with multiple antennas. The transmitter sends confidential messages to its intended receiver, while…

Information Theory · Computer Science 2015-05-27 S. Ali. A. Fakoorian , A. Lee Swindlehurst

The extremal inequality approach plays a key role in network information theory problems. In this paper, we propose a novel monotone path construction in product probability space. The optimality of Gaussian distribution is then established…

Information Theory · Computer Science 2021-09-02 Yinfei Xu , Guojun Chen

We consider the problem of detecting (testing) Gaussian stochastic sequences (signals) with imprecisely known means and covariance matrices. The alternative is independent identically distributed zero-mean Gaussian random variables with…

Information Theory · Computer Science 2023-02-28 Marat V. Burnashev

A longstanding open problem in quantum information theory is to find the classical capacity of an optical communication link, modeled as a Gaussian bosonic channel. It has been conjectured that this capacity is achieved by a random coding…

In this paper we consider the computation of channel capacity for ergodic multiple-input multiple-output channels with additive white Gaussian noise. Two scenarios are considered. Firstly, a time-varying channel is considered in which both…

Information Theory · Computer Science 2007-07-13 Leif W Hanlen , Alex J Grant

The capacity of a deterministic multiple-input multiple-output (MIMO) channel under the peak and average power constraints is investigated. For the identity channel matrix, the approach of Shamai et al. is generalized to the higher…

Information Theory · Computer Science 2016-09-29 Borzoo Rassouli , Bruno Clerckx

We consider the problem of finding secrecy rate of a multiple-input multiple-output (MIMO) wire-tap channel. A transmitter, a legitimate receiver, and an eavesdropper are all equipped with multiple antennas. The channel states from the…

Information Theory · Computer Science 2014-11-04 Arash Khabbazibasmenj , Maksym A. Girnyk , Sergiy A. Vorobyov , Mikko Vehkaperä , Lars K. Rasmussen

In this paper, we study the secrecy rate and outage probability in Multiple-Input-Single-Output (MISO) Gaussian wiretap channels at the limit of a large number of legitimate users and eavesdroppers. In particular, we analyze the asymptotic…

Information Theory · Computer Science 2016-05-10 Joseph Kampeas , Asaf Cohen , Omer Gurewitz

Multiple input multiple output (MIMO) approach in fiber optical communication has emerged as an effective proposition to address the ever increasing demand for information exchange. In the ergodic case, the multiple channels, associated…

Information Theory · Computer Science 2022-11-28 Aritra Laha , Santosh Kumar

Optimal signaling for secrecy rate maximization in Gaussian MIMO wiretap channels is considered. While this channel has attracted a significant attention recently and a number of results have been obtained, including the proof of the…

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

Gaussian boson sampling (GBS) is a promising protocol for demonstrating quantum computational advantage. One of the key steps for proving classical hardness of GBS is the so-called ``hiding conjecture'', which asserts that one can ``hide''…

Quantum Physics · Physics 2025-09-03 Laura Shou , Sarah H. Miller , Victor Galitski