Algorithm 2

DC Programming Algorithm for Power Allocation

1) Initialize $P^{\left(0\right)}$ , set iteration number $m=0$ .

2) The Objective function $Q\left(P\right)$ , convex functions $F\left(P\right)$ and $G\left(P\right)$ .

3) do { define convex approximation of $G^{\left(m\right)}\left(P\right)$ at $P^{\left(m\right)}$ as

4) $G^{\left(m\right)}\left(P\right)=F\left(P\right)-G\left(P^{\left(m\right)}\right)-\nabla G^{\text{T}}\left(P^{\left(m\right)}\right)\left(P-P^{\left(m\right)}\right)$ (27)

5) solve the convex problem

6) $P^{\left(m\right)}=\underset{{\Vert P\Vert }_1=P_s,p_n\ge p_{n,\min }}{\arg \min }{Q}^{\left(m\right)}\left(P\right)$ (28)

7) $k++$

8) } while ( $\left|Q\left(P^{\left(M+1\right)}\right)-Q\left(P^{\left(m\right)}\right)\right|\ge \epsilon$ );

9) end