English
Related papers

Related papers: Multipath Channels of Bounded Capacity

200 papers

We derive bounds on the noncoherent capacity of a very general class of multiple-input multiple-output channels that allow for selectivity in time and frequency as well as for spatial correlation. The bounds apply to peak-constrained…

Information Theory · Computer Science 2008-01-29 Ulrich G. Schuster , Giuseppe Durisi , Helmut Bölcskei , H. Vincent Poor

Motivated by results in optical communications, where the performance can degrade dramatically if the transmit power is sufficiently increased, the channel capacity is characterized for various kinds of memoryless vector channels. It is…

Information Theory · Computer Science 2015-03-20 Erik Agrell

Discrete-time Rayleigh fading single-input single-output (SISO) and multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter or the receiver. The fading is assumed to be stationary…

Information Theory · Computer Science 2016-11-17 Vignesh Sethuraman , Ligong Wang , Bruce Hajek , Amos Lapidoth

In this paper, we analyze the capacity of multiple-input multiple-output (MIMO) Rayleigh-fading channels in the presence of spatial fading correlation at both the transmitter and the receiver, assuming that the channel is unknown at the…

Information Theory · Computer Science 2016-11-18 Hyundong Shin , Moe Z. Win , Jae Hong Lee , Marco Chiani

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

We investigate the multipath fading relay channel in the limit of a large bandwidth, and in the non-coherent setting, where the channel state is unknown to all terminals, including the relay and the destination. We propose a hypergraph…

Information Theory · Computer Science 2016-11-17 Nadia Fawaz , Muriel Medard

This work introduces capacity limits for molecular timing (MT) channels, where information is modulated on the release timing of small information particles, and decoded from the time of arrival at the receiver. It is shown that the random…

Information Theory · Computer Science 2016-11-15 Nariman Farsad , Yonathan Murin , Andrew Eckford , Andrea Goldsmith

We characterize the capacity of the general class of noncoherent underspread wide-sense stationary uncorrelated scattering (WSSUS) time-frequency-selective Rayleigh fading channels, under peak constraints in time and frequency and in time…

Information Theory · Computer Science 2016-11-17 Giuseppe Durisi , Helmut Bölcskei , Shlomo Shamai

We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Tsachy Weissman , Andrea Goldsmith

The fundamental phenomenon widely known as multipath is unavoidable in wireless communication, and affects almost every element of modern wireless communication systems. The impact of multipath on the received signal depends on whether the…

Information Theory · Computer Science 2022-12-13 Dushyantha A Basnayaka

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

We derive a criterion on the measurability / identifiability of Multiple--Input Multiple--Output (MIMO) channels based on the size of the so-called spreading support of its subchannels. Novel MIMO transmission techniques provide…

Functional Analysis · Mathematics 2007-05-23 Goetz E. Pfander

In this paper, the delay limited secrecy capacity of the flat fading channel is investigated under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of…

Information Theory · Computer Science 2016-11-15 Karim Khalil , Moustafa Youssef , O. Ozan Koyluoglu , Hesham El Gamal

We consider a multiple-input, multiple-output (MIMO) wideband Rayleigh block fading channel where the channel state is unknown to both the transmitter and the receiver and there is only an average power constraint on the input. We compute…

Information Theory · Computer Science 2007-07-13 Siddharth Ray , Muriel Medard , Lizhong Zheng

The noncoherent capacity of stationary discrete-time fading channels is known to be very sensitive to the fine details of the channel model. More specifically, the measure of the set of harmonics where the power spectral density of the…

Information Theory · Computer Science 2016-11-15 Giuseppe Durisi , Veniamin I. Morgenshtern , Helmut Bölcskei

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

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

Information Theory · Computer Science 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor

A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. In…

Information Theory · Computer Science 2015-01-06 Lóránt Farkas , Tamás Kói

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

In this paper we deal with a single-antenna discrete-time flat-fading channel. The fading process is assumed to be stationary for the duration of a single data block. From block to block the fading process is allowed to be non-stationary.…

Information Theory · Computer Science 2007-07-13 Thomas Zemen , Stefan M. Moser