3 problems

Consider a network with users indexed by $i$ and channels indexed by $k$. Let $\xi_i(k)$ denote the bias of the noisy water-filling solution, and let $\mathbf{p}_i$ be user $i$'s p…

Let $\bar{\mathbf{T}}$, $\bar{\mathbf{R}}$, and $\bar{\mathbf{p}}$ (respectively, $\bar{\mathbf{R}}$, $\bar{\mathbf{T}}$, and $\mathbf{\bar{q}}$) denote the variables corresponding…

In a B-MAC or iTree network, let Algorithm PT and Algorithm PP denote the polite water-filling algorithms discussed in the source, and let $\mathbf{\hat{\Omega}}_{l}^{-1/2}$ be the…