Simple note on the water-filling solution for capacity of parallel Gaussian channels

It is well known that the capacity of parallel Gaussian channels subject to total power constraint can be achieved by water-filling procedure. This paper first derives three modified water-filling solutions when individual channel power constraints are combined with the total power constraint, and then find their application to multiple-input multiple-output wireless communications.