相关论文: Capacity of The Discrete-Time Non-Coherent Memoryl…
We investigate the secrecy capacity of an ergodic fading wiretap channel in which the main channel is correlated with the eavesdropper channel. In this study, the full Channel State Information (CSI) is assumed, and thus the transmitter…
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…
In this paper we consider the capacity of the cognitive radio channel in different fading environments under a low interference regime. First we derive the probability that the low interference regime holds under shadow fading as well as…
We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and…
We consider a noncoherent wireless network, where the transmitters and receivers are cognizant of the statistics of the fading coefficients, but are ignorant of their realizations. We demonstrate that if the nodes do not cooperate, if they…
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…
The high-SNR capacity of the noncoherent MIMO channel has been derived for the case of independent and identically distributed (IID) Rayleigh block fading by exploiting the Gaussianity of the channel matrix. This implies the optimal degrees…
This letter studies parallel independent Gaussian channels with uncertain eavesdropper channel state information (CSI). Firstly, we evaluate the probability of zero secrecy rate in this system for (i) given instantaneous channel conditions…
The present paper focuses on the problem of broadcasting information in the most efficient manner in a large two-dimensional ad hoc wireless network at low SNR and under line-of-sight propagation. A new communication scheme is proposed,…
We investigate the delay limited secrecy capacity of the flat fading channel under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main…
Motivated by communication systems with constrained complexity, we consider the problem of input symbol selection for discrete memoryless channels (DMCs). Given a DMC, the goal is to find a subset of its input alphabet, so that the optimal…
We consider general multi-antenna fading channels with coarsely quantized outputs, where the channel is unknown to the transmitter and receiver. This analysis is of interest in the context of sensor network communication where low power and…
Secrecy capacity of a multiple-antenna wiretap channel is studied in the low signal-to-noise ratio (SNR) regime. Expressions for the first and second derivatives of the secrecy capacity with respect to SNR at SNR = 0 are derived.…
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…
The rate optimization for wireless networks with low SNR is investigated. While the capacity in the limit of disappearing SNR is known to be linear for fading and non-fading channels, we study the problem of operating in low SNR wireless…
We analyse the effect of correlation between the forward and backward links on the capacity of backscatter communication systems. To that aim, we obtain an analytical expression for the average capacity under a correlated Rayleigh product…
A spectrum-sharing communication system where the secondary user is aware of the instantaneous channel state information (CSI) of the secondary link, but knows only the statistics and an estimated version of the secondary…
The capacity of a time-varying block-memoryless channel in which the transmitter and the receiver have access to (possibly different) noisy causal channel side information (CSI) is obtained. It is shown that the capacity formula obtained in…
An upper bound on the capacity of a cascade of nonlinear and noisy channels is presented. The cascade mimics the split-step Fourier method for computing waveform propagation governed by the stochastic generalized nonlinear Schroedinger…
This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private…