pith. sign in

arxiv: 1510.08202 · v3 · pith:XRJJ6XGDnew · submitted 2015-10-28 · 💻 cs.IT · math.IT

Oblivious Fronthaul-Constrained Relay for a Gaussian Channel

classification 💻 cs.IT math.IT
keywords gaussianrelaychanneltransmitterassumedfrequencyinformationoblivious
0
0 comments X
read the original abstract

We consider systems in which the transmitter conveys messages to the receiver through a capacity-limited relay station. The channel between the transmitter and the relay-station is assumed to be a frequency selective additive Gaussian noise channel. It is assumed that the transmitter can shape the spectrum and adapt the coding technique so as to optimize performance. The relay operation is oblivious (nomadic transmitters), that is, the specific codebooks used are unknown. We find the reliable information rate that can be achieved with Gaussian signaling in this setting, and to that end, employ Gaussian bottleneck results combined with Shannon's incremental frequency approach. We also prove that, unlike classical water-pouring, the allocated spectrum (power and bit-rate) of the optimal solution could frequently be discontinuous. These results can be applied to a MIMO transmission scheme. We also investigate the case of an entropy limited relay. We present lower and upper bounds on the optimal performance (in terms of mutual information), and derive an analytical approximation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.