English
Related papers

Related papers: Capacity of Underspread Noncoherent WSSUS Fading C…

200 papers

This paper investigates the capacity scaling of multicell massive MIMO systems in the presence of spatially correlated fading. In particular, we focus on the strong spatial correlation regimes where the covariance matrix of each user…

Information Theory · Computer Science 2019-12-10 Junyoung Nam , Giuseppe Caire , Merouane Debbah , H. Vincent Poor

In this work, we obtain lower and upper bounds on the maximal transmission rate at a given codeword length $n$, average probability of error $\epsilon$ and power constraint $\bar{P}$, over a finite valued, block fading additive white…

Information Theory · Computer Science 2017-11-15 Deekshith P K , Vinod Sharma

We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the…

Quantum Physics · Physics 2010-03-19 Francesco Buscemi , Nilanjana Datta

In this work we extend the setting of communication without power constraint, proposed by Poltyrev, to fast fading channels with channel state information (CSI) at the receiver. The optimal codewords density, or actually the optimal…

Information Theory · Computer Science 2014-04-22 Shlomi Vituri , Meir Feder

In this paper, the fading broadcast channel with confidential messages is studied in the presence of statistical quality of service (QoS) constraints in the form of limitations on the buffer length. We employ the effective capacity…

Information Theory · Computer Science 2010-04-07 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

We propose a technique to derive upper bounds on Gallager's cost-constrained random coding exponent function. Applying this technique to the non-coherent peak-power or average-power limited discrete time memoryless Ricean fading channel, we…

Information Theory · Computer Science 2007-07-13 Amos Lapidoth , Natalia Miliou

We obtain the first term in the high signal-to-noise ratio (SNR) expansion of the capacity of fading networks where the transmitters and receivers--while fully cognizant of the fading \emph{law}--have no access to the fading…

Information Theory · Computer Science 2007-07-13 Amos Lapidoth

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

In optical wireless communications, a broadcast channel (BC) employing intensity modulation and direct detection (IM/DD) is often modelled as a peak-constrained BC. A closed-form expression for its capacity region of the peak-constrained BC…

Information Theory · Computer Science 2022-08-25 Zhenyu Charlus Zhang , Anas Chaaban

We consider a continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. The set of…

Information Theory · Computer Science 2017-09-25 Sandra Bender , Meik Dörpinghaus , Gerhard Fettweis

The two-user wireless ergodic fading Broadcast Channel (BC) with partial Channel State Information at the Transmitter (CSIT) is considered. The CSIT is given by an arbitrary deterministic function of the channel state. This characteristic…

Information Theory · Computer Science 2013-02-25 Reza K. Farsani

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

A framework is developed for analyzing capacity gains from user cooperation in slow fading wireless networks when the number of nodes (network size) is large. The framework is illustrated for the case of a simple multipath-rich Rayleigh…

Information Theory · Computer Science 2009-09-29 Ashish Khisti , Uri Erez , Gregory Wornell

This paper studies the computability of the secrecy capacity of fast-fading wiretap channels from an algorithmic perspective, examining whether it can be computed algorithmically or not. To address this question, the concept of Turing…

Information Theory · Computer Science 2025-01-22 Holger Boche , Andrea Grigorescu , Rafael F. Schaefer , H. Vincent Poor

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

In the spectrum-sharing technology, a secondary user may utilize the primary user's licensed band as long as its interference to the primary user is below a tolerable value. In this paper, we consider a scenario in which a secondary user is…

Information Theory · Computer Science 2010-10-01 Junwei Zhang , Mustafa Cenk Gursoy

Handling interference is one of the main challenges in the design of wireless networks. One of the key approaches to interference management is node cooperation, which can be classified into two main types: relaying and feedback. In this…

Information Theory · Computer Science 2015-03-19 Daniel Zahavi , Ron Dabora

We present the \epsilon-outage capacity of incremental relaying at low signal-to-noise ratios (SNR) in a wireless cooperative network with slow Rayleigh fading channels. The relay performs decode-and-forward and repetition coding is…

Information Theory · Computer Science 2009-08-07 Tobias Renk , Holger Jaekel , Friedrich K. Jondral , Deniz Gunduz , Andrea Goldsmith

In this paper, we investigate effective capacity by modeling a cognitive radio broadcast channel with one secondary transmitter (ST) and two secondary receivers (SRs) under quality-of-service constraints and interference power limitations.…

Information Theory · Computer Science 2016-11-17 Marwan Hammouda , Sami Akin , Jürgen Peissig

Classically, communication systems are designed assuming perfect channel state information at the receiver and/or transmitter. However, in many practical situations, only an estimate of the channel is available that differs from the true…

Information Theory · Computer Science 2007-07-13 Pablo Piantanida , Gerald Matz , Pierre Duhamel