Related papers: Capacity Approximations for Gaussian Relay Network…
This paper studies networks with N half-duplex relays assisting the communication between a source and a destination. In ISIT'12 Brahma, \"{O}zg\"{u}r and Fragouli conjectured that in Gaussian half-duplex diamond networks (i.e., without a…
In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network which consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a…
This paper investigates the additive white Gaussian noise two-way relay channel, where two users exchange messages through a relay. Asymmetrical channels are considered where the users can transmit data at different rates and at different…
An additive white Gaussian noise energy-harvesting channel with an infinite-sized battery is considered. The energy arrival process is modeled as a sequence of independent and identically distributed random variables. The channel capacity…
In this paper, we present nontrivial upper and lower bounds on the secrecy capacity of the degraded Gaussian diamond-wiretap channel and identify several ranges of channel parameters where these bounds coincide with useful intuitions.…
Motivated by the design of low-complexity low-power coding solutions for the Gaussian relay channel, this work presents an upper bound on the minimum energy-per-bit achievable on the Gaussian relay channel using rank-1 linear relaying. Our…
The problem of operating a Gaussian Half-Duplex (HD) relay network optimally is challenging due to the exponential number of listen/transmit network states that need to be considered. Recent results have shown that, for the class of…
Channel capacity bounds are derived for a point-to-point indoor visible light communications (VLC) system with signal-dependent Gaussian noise. Considering both illumination and communication, the non-negative input of VLC is constrained by…
The problem of maximum rate achievable with analog network coding for a unicast communication over a layered relay network with directed links is considered. A relay node performing analog network coding scales and forwards the signals…
This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two…
We analyze the achievable rate of the superposition of block Markov encoding (decode-and-forward) and side information encoding (compress-and-forward) for the three-node Gaussian relay channel. It is generally believed that the…
A cache-aided $K$-user Gaussian broadcast channel (BC) is considered. The transmitter has a library of $N$ equal-rate files, from which each user demands one. The impact of the equal-capacity receiver cache memories on the minimum required…
We consider the discrete memoryless symmetric primitive relay channel, where, a source $X$ wants to send information to a destination $Y$ with the help of a relay $Z$ and the relay can communicate to the destination via an error-free…
In this paper, we investigate the optimal precoding scheme for relay networks with finite-alphabet constraints. We show that the previous work utilizing various design criteria to maximize either the diversity order or the transmission rate…
The compute-and-forward framework permits each receiver in a Gaussian network to directly decode a linear combination of the transmitted messages. The resulting linear combinations can then be employed as an end-to-end communication…
In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends…
In this paper, we first present an outer bound for a general interference channel with a cognitive relay, i.e., a relay that has non-causal knowledge of both independent messages transmitted in the interference channel. This outer bound…
We introduce a generalized two-way relay channel where two sources exchange information (not necessarily of the same rate) with help from a relay, and each source additionally sends private information to the relay. We consider the Gaussian…
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…
This paper develops a unified information-theoretic framework for artificial-intelligence (AI)-aided integrated sensing and communication (ISAC), where a learning component with limited representational capacity is embedded within the…