English
Related papers

Related papers: Capacity of Fading Channels without Channel Side I…

200 papers

The effective rate is an important performance metric of real-time applications in next generation wireless networks. In this paper, we present an analysis of the effective rate of multiple-input single-output (MISO) systems over…

Information Theory · Computer Science 2015-07-16 Jiayi Zhang , Linglong Dai , Zhaocheng Wang , Derrick Wing Kwan Ng , Wolfgang H. Gerstacker

Recently, Tarokh and others have raised the possibility that a cognitive radio might know the interference signal being transmitted by a strong primary user in a non-causal way, and use this knowledge to increase its data rates. However,…

Information Theory · Computer Science 2007-07-13 Pulkit Grover , Anant Sahai

We develop several lower bounds on the capacity of binary input symmetric output channels with synchronization errors which also suffer from other types of impairments such as substitutions, erasures, additive white Gaussian noise (AWGN)…

Information Theory · Computer Science 2012-03-30 Mojtaba Rahmati , Tolga M. Duman

We establish the classical capacity of optical quantum channels as a sharp transition between two regimes---one which is an error-free regime for communication rates below the capacity, and the other in which the probability of correctly…

Quantum Physics · Physics 2015-03-17 Bhaskar Roy Bardhan , Raul Garcia-Patron , Mark M. Wilde , Andreas Winter

In this paper, we consider the transmission of confidential information over a $\kappa$-$\mu$ fading channel in the presence of an eavesdropper, who also observes $\kappa$-$\mu$ fading. In particular, we obtain novel analytical solutions…

Information Theory · Computer Science 2015-07-27 Nidhi Bhargav , Simon L. Cotton , David E. Simmons

The problem of characterising the zero-error capacity region for multiple access channels even in the noiseless case has remained an open problem for over three decades. Motivated by this challenging question, a recently developed theory of…

Information Theory · Computer Science 2019-10-29 Ghassen Zafzouf , Girish N. Nair , Jamie S. Evans

In a two-user channel, completion time refers to the number of channel uses spent by each user to transmit a bit pool with some given size. In this paper, the information-theoretic formulation of completion time is based on the concept of…

Information Theory · Computer Science 2015-08-04 Yuanpeng Liu , Elza Erkip

The full solution of the optimization problem giving the Gaussian capacity of the single-mode fiducial Gaussian quantum channel is provided. Since it was shown that the Gaussian capacity of an arbitrary (phase-sensitive or insensitive)…

Quantum Physics · Physics 2016-09-19 Joachim Schäfer , Evgueni Karpov , Oleg V. Pilyavets , Nicolas J. Cerf

A deep understanding of the queuing performance of wireless networks is essential for the advancement of future wireless communications. The stochastic nature of wireless channels in general gives rise to a time varying transmission rate.…

Networking and Internet Architecture · Computer Science 2016-04-05 Sebastian Schiessl , Farshad Naghibi , Hussein Al-Zubaidy , Markus Fidler , James Gross

The classical capacity of phase-invariant Gaussian channels has been recently determined under the assumption that such channels are memoryless. In this work we generalize this result by deriving the classical capacity of a model of quantum…

Quantum Physics · Physics 2014-10-17 Giacomo De Palma , Andrea Mari , Vittorio Giovannetti

A formula is derived for the capacity of the Gaussian channel with a benevolent message-cognizant rate-limited helper that provides a noncausal description of the noise to the encoder and decoder. This capacity is strictly larger than when…

Information Theory · Computer Science 2023-10-25 Amos Lapidoth , Ligong Wang , Yiming Yan

In this paper, we investigate the secrecy performance of stochastic MIMO wireless networks over small-scale $\alpha$-$\mu$ fading channels, where both the legitimate receivers and eavesdroppers are distributed with two independent…

Information Theory · Computer Science 2018-10-03 Long Kong , Satyanarayana Vuppala , Georges Kaddoum

We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates on the…

Information Theory · Computer Science 2016-11-15 Ali ParandehGheibi , Atilla Eryilmaz , Asuman Ozdaglar , Muriel Medard

The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined by two parameters: the diversity order and the coding gain.…

Information Theory · Computer Science 2012-10-05 Dieter Duyck , Joseph Jean Boutros , Marc Moeneclaey

The impact of phase fading on the classical Costa dirty paper coding channel is studied. We consider a variation of this channel model in which the amplitude of the interference sequence is known at the transmitter while its phase is known…

Information Theory · Computer Science 2014-01-20 Stefano Rini , Shlomo Shamai

For delay-limited communication over block-fading channels, the difference between the ergodic capacity and the maximum achievable expected rate for coding over a finite number of coherent blocks represents a fundamental measure of the…

Information Theory · Computer Science 2013-01-25 Jae Won Yoo , Tie Liu , Shlomo Shamai , Chao Tian

This study investigates the mean capacity of multiple-input multiple-output (MIMO) systems for spatially semi-correlated flat fading channels. In reality, the capacity degrades dramatic due to the channel covariance (CC) when correlations…

Information Theory · Computer Science 2016-09-27 Md. Abdul Latif Sarker , Moon Ho Lee

We study the fundamental network capacity of a multi-user wireless downlink under two assumptions: (1) Channels are not explicitly measured and thus instantaneous states are unknown, (2) Channels are modeled as ON/OFF Markov chains. This is…

Information Theory · Computer Science 2010-04-23 Chih-ping Li , Michael J. Neely

Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finite-state semi-Markov channels. We show that communication with…

Information Theory · Computer Science 2015-03-24 Lav R. Varshney , Sanjoy K. Mitter , Vivek K Goyal

Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the…

Quantum Physics · Physics 2025-10-03 Adam Taylor , Michael Hanks , Hyukjoon Kwon , M. S. Kim
‹ Prev 1 8 9 10 Next ›