Algorithm 1: The Proposed Novel Resource Allocation Algorithm

1.Mapping users in cell A onto K subcarriers using $\mathsf{\alpha }$

2.Initialize ${\mathsf{\beta }}^{(0)}$ and ${\mathit{r}}^{(0)}$ randomly, let $t=0$.

3.Repeat:

4.$t=t+1$

5.Get ${\mathit{r}}^{(t)}$ by convex optimization;

6.Compute ${\mathsf{\Phi }}^{(t)}=diag({\mathsf{\eta }}_1^{(t)},{\mathsf{\eta }}_2^{(t)},\mathrm{...},{\mathsf{\eta }}_K^{(t)});$ using (18)

7.Compute $f_{i,j,k}^{(t)}({\mathsf{\beta }}^{(t-1)},{\mathrm{r}}^{(t)})$ using (24)

8.Get ${\mathsf{\beta }}^{(t)}$ by linear programming.

9.Compute objective function $f^{(t)}$ given ${\mathrm{r}}^{(t)},{\mathsf{\Phi }}^{(t)},{\mathsf{\beta }}^{(t)}$

10.Until $F^{(t)}$ converges