Monotonicity of proportional fair capacity for Gaussian broadcast channels

From papers

Let CPF(N,PT)C_{PF}(\mathbf{N},P_T) denote the proportional fair capacity of a Gaussian broadcast channel with noise vector N\mathbf{N} and total power PTP_T. Let \preceq denote the componentwise ordering of noise vectors. Monotonicity conjecture. If NN\mathbf{N}\preceq\mathbf{N}', then

CPF(N,PT)CPF(N,PT).C_{PF}(\mathbf{N},P_T)\leq C_{PF}(\mathbf{N}',P_T).

This conjecture was motivated by numerical examples; the supplied text does not establish it in general, so its resolution remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Kenneth W. Shum and Chi Wan Sung, “On the Fairness of Rate Allocation in Gaussian Multiple Access Channel and Broadcast Channel”, arXiv:cs/0611015 (2006).

Solutions 0

No solutions have been posted yet.