The Water Filling Game

by   Uzi Pereg, et al.

We consider the Gaussian arbitrarily varying product channel (GAVPC), and the arbitrarily varying channel (AVC) with colored Gaussian noise. The random code capacity is obtained by solving an optimization min-max problem, which is interpreted as a two-player zero-sum game, played by the user and the jammer, where their strategies are the power allocations. The optimal power allocations are given by a "double" water filling solution, where the jammer performs water filling first, attempting to whiten the overall noise as much as possible, and then the user performs water filling taking into account the total interference power, which is contributed by both the channel noise and the jamming signal. As in the case of the standard Gaussian AVC, the deterministic code capacity is discontinuous in the input constraint, and depends on which of the input or state constraint is higher. As opposed to Shannon's classic water filling solution, it is observed that deterministic coding using independent codes is suboptimal for the GAVPC. We further extend our results to the AVC with colored Gaussian noise, where double water filling is performed in the frequency domain.


The Arbitrarily Varying Gaussian Relay Channel with Sender Frequency Division

We consider the arbitrarily varying Gaussian relay channel with sender f...

New Viewpoint and Algorithms for Water-Filling Solutions in Wireless Communications

Water-filling solutions play an important role in the designs for wirele...

FEAT: Fair Coordinated Iterative Water-Filling Algorithm

In this paper, we consider a perfect coordinated water-filling game, whe...

The Capacity Region of the Arbitrarily Varying MAC: With and Without Constraints

We determine both the random code capacity region and the deterministic ...

The Arbitrarily Varying Relay Channel

We study the arbitrarily varying relay channel, and establish the cutset...

The Variable-Processor Cup Game

The problem of scheduling tasks on p processors so that no task ever get...

The Szegö-Asymptotics for Doubly-Dispersive Gaussian Channels

We consider the time-continuous doubly--dispersive channel with additive...

Please sign up or login with your details

Forgot password? Click here to reset