Related papers: Upper Bound on the Capacity of a Cascade of Nonlin…
While the channel capacity reflects a theoretical upper bound on the achievable information transmission rate in the limit of infinitely many bits, it does not characterise the information transfer of a given encoding routine with finitely…
Motivated by the looming "capacity crunch" in fiber-optic networks, information transmission over such systems is revisited. Among numerous distortions, inter-channel interference in multiuser wavelength-division multiplexing (WDM) is…
Fundamental capacity limits are studied for the two-user wireless ergodic fading IC with partial Channel State Information at the Transmitters (CSIT) where each transmitter is equipped with an arbitrary deterministic function of the channel…
We consider the problem of estimating an upper bound on the capacity of a memoryless channel with unknown channel law and continuous output alphabet. A novel data-driven algorithm is proposed that exploits the dual representation of…
This work considers a discrete-time Poisson noise channel with an input amplitude constraint $\mathsf{A}$ and a dark current parameter $\lambda$. It is known that the capacity-achieving distribution for this channel is discrete with…
We obtain a new upper bound on the capacity of a class of discrete memoryless relay channels. For this class of relay channels, the relay observes an i.i.d. sequence $T$, which is independent of the channel input $X$. The channel is…
A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this setup, and we show that this outer bound is achievable in some cases.…
Information transfer through electromagnetic waves is an important problem that touches a variety of technologically relevant applications, including computing and telecommunications. Prior attempts to establish limits on optical…
In slow fading scenarios, cooperation between nodes can increase the amount of diversity for communication. We study the performance limit in such scenarios by analyzing the outage capacity of slow fading relay channels. Our focus is on the…
We characterize the capacity region of noiseless X-Channels with intermittent connectivity and delayed channel state information at the transmitters. We consider the general case in which each transmitter has a common message for both…
We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we…
Under which condition is quantization optimal? We address this question in the context of the additive uniform noise channel under peak amplitude and power constraints. We compute analytically the capacity-achieving input distribution as a…
The L-user additive white Gaussian noise multi-way relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing coding strategies, i.e., complete-decode-forward and…
Scaled Relative Graphs (SRGs) provide a novel graphical frequency-domain method for the analysis of Nonlinear (NL) systems. In this paper, we restrict the SRG to particular input spaces to compute frequency-dependent incremental gain bounds…
This work considers the smart repeater network where a single source $s$ wants to send two independent packet streams to destinations $\{d_1,d_2\}$ with the help of relay $r$. The transmission from $s$ or $r$ is modeled by packet erasure…
The cognitive interference channel is an interference channel in which one transmitter is non-causally provided with the message of the other transmitter. This channel model has been extensively studied in the past years and capacity…
Throughput capacity is a critical parameter for the design and evaluation of ad-hoc wireless networks. Consider n identical randomly located nodes, on a unit area, forming an ad-hoc wireless network. Assuming a fixed per node transmission…
This paper studies the capacity of the peak-and-average-power-limited Gaussian channel when its output is quantized using a dithered, infinite-level, uniform quantizer of step size $\Delta$. It is shown that the capacity of this channel…
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…
This paper slightly improves the upper bound in Thangaraj et al. for the capacity of the amplitude-constrained scalar AWGN channel. This improvement makes the upper bound within 0.002 bits of the capacity for $\frac{E_b}{N_0}\leq 2.5$ dB.