Combinatorial Resource Allocation Using Submodularity of Waterfilling.

We show that the maximum mutual information (capacity) of parallel Gaussian channels obtained by the optimal water-filling algorithm for power allocation under a sum-power constraint is submodular. For a given power allocation, mutual information is known to be submodular. However, establishing the submodularity of the capacity, which additionally involves maximization of the mutual information ov...