English
Related papers

Related papers: A Simple Capacity Lower Bound for Communication wi…

200 papers

We propose a new covert communication scheme that operates without pre-sharing side information and channel estimation, utilizing a Gaussian-distributed Grassmann constellation for noncoherent detection. By designing constant-amplitude…

Signal Processing · Electrical Eng. & Systems 2025-02-20 Hiroki Fukada , Hiroki Iimori , Chandan Pradhan , Szabolcs Malomsoky , Naoki Ishikawa

Upper bounds on the capacity of vector Gaussian channels affected by fading are derived under peak amplitude constraints at the input. The focus is on constraint regions that can be decomposed in a Cartesian product of sub-regions. This…

Information Theory · Computer Science 2022-07-05 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

The minimum average signal-to-noise ratio (SNR) per bit required for error-free transmission over a fading channel is derived, and is shown to be equal to that of the additive white Gaussian noise (AWGN) channel, which is $-1.6$ dB.…

Information Theory · Computer Science 2017-11-29 K. Vasudevan

Large-scale multiple-input multiple-output (MIMO) with high spectrum and energy efficiency is a very promising key technology for future 5G wireless communications. For large-scale MIMO systems, accurate channel state information (CSI)…

Information Theory · Computer Science 2015-11-30 Zhen Gao , Linglong Dai , Zhaocheng Wang

In this work, we investigate the capacity of multi-antenna fading channels with 1-bit quantized output per receive antenna. Specifically, leveraging Bayesian statistical tools, we analyze the asymptotic regime with a large number of receive…

Information Theory · Computer Science 2024-07-24 Sheng Yang , Richard Combes

In this paper, we investigate the downlink throughput performance of a massive multiple-input multiple-output (MIMO) system that employs superimposed pilots for channel estimation. The component of downlink (DL) interference that results…

Information Theory · Computer Science 2019-04-16 Karthik Upadhya , Sergiy A. Vorobyov , Mikko Vehkapera

We propose an approach where each user independently seeks to minimize the amount of time that they occupy the channel. Essentially, we seek to minimize the number of transmitted symbols required to communicate a packet assuming…

Information Theory · Computer Science 2014-10-14 Chung-Yu Lou , Babak Daneshrad , Richard D. Wesel

We investigate the constrained capacity of multiple-antenna fading coherent channels, where the receiver knows the channel state but the transmitter knows only the channel distribution, driven by arbitrary equiprobable discrete inputs in a…

Information Theory · Computer Science 2012-10-26 Miguel Rodrigues

Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network…

Information Theory · Computer Science 2015-07-16 Ritesh Kolte , Ayfer Özgür , Abbas El Gamal

The capacity and optimal signaling over a fixed Gaussian MIMO channel are considered under the joint total and per-antenna power constraints (TPC and PAC). While the general case remains an open problem, a closed-form full-rank solution is…

Information Theory · Computer Science 2018-09-05 Sergey Loyka

The capacity of a discrete-time memoryless channel, in which successive symbols fade independently, and where the channel state information (CSI) is neither available at the transmitter nor at the receiver, is considered at low SNR. We…

Information Theory · Computer Science 2008-01-04 Z. Rezki , David Haccoun , François Gagnon

We derive a lower bound on the capacity pre-log of a temporally correlated Rayleigh block-fading multiple-input multiple-output (MIMO) channel with T transmit antennas and R receive antennas in the noncoherent setting (no a priori channel…

Information Theory · Computer Science 2013-02-12 Günther Koliander , Erwin Riegler , Giuseppe Durisi , Veniamin I. Morgenshtern , Franz Hlawatsch

In this work, we consider a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver. The law of the channel is presumed to be known to the receiver. In addition, we assume the…

Information Theory · Computer Science 2011-03-03 Meik Dörpinghaus , Heinrich Meyr

Transmission of information over a discrete-time memoryless Rician fading channel is considered where neither the receiver nor the transmitter knows the fading coefficients. The spectral-efficiency/bit-energy tradeoff in the low-power…

Information Theory · Computer Science 2016-11-17 Mustafa Cenk Gursoy , H. Vincent Poor , Sergio Verdu

In this paper, superimposed pilots are introduced as an alternative to time-multiplexed pilot and data symbols for mitigating pilot contamination in massive multiple-input multiple-output (MIMO) systems. We propose a non-iterative scheme…

Information Theory · Computer Science 2017-08-09 Karthik Upadhya , Sergiy A. Vorobyov , Mikko Vehkapera

This paper investigates the maximal achievable rate for a given blocklength and error probability over quasi-static multiple-input multiple-output (MIMO) fading channels, with and without channel state information (CSI) at the transmitter…

Information Theory · Computer Science 2014-04-17 Wei Yang , Giuseppe Durisi , Tobias Koch , Yury Polyanskiy

The capacity of the Gaussian cognitive interference channel, a variation of the classical two-user interference channel where one of the transmitters (referred to as cognitive) has knowledge of both messages, is known in several parameter…

Information Theory · Computer Science 2016-11-17 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We study the capacity region of the two-user Binary Fading (or Erasure) Interference Channel where the transmitters have no knowledge of the channel state information. We develop new inner-bounds and outer-bounds for this problem. We…

Information Theory · Computer Science 2017-03-28 Alireza Vahid , Mohammad Ali Maddah-Ali , Amir Salman Avestimehr , Yan Zhu

Many communication applications incorporate event-triggered behavior, where the conventional Shannon capacity may not effectively gauge performance. Consequently, we advocate for the concept of identification capacity as a more suitable…

Information Theory · Computer Science 2025-02-04 Ilya Vorobyev , Christian Deppe , Holger Boche

Consider a pair of terminals connected by two independent additive white Gaussian noise channels, and limited by individual power constraints. The first terminal would like to reliably send information to the second terminal, within a given…

Information Theory · Computer Science 2014-12-16 Assaf Ben-Yishai , Ofer Shayevitz