In this study, we introduce an optimization procedure for coding mode selection and bit allocation derived under a game theoretic framework.
The optimal power allocation derived solves a convex optimization problem of minimizing network energy consumption under the constraint of the guaranteed quality of service for both PU and SUs.
The optimum power allocation derived for MMSE-LE is similar in spirit to classical results for the optimum continuous-time transmit filter for linear modulation formats obtained by Berger/Tufts and Yang/Roy, whereas for MMSE-DFE the capacity achieving waterfilling strategy well known from conventional single-carrier transmission schemes is obtained.
In[7], the optimal bandwidth and power allocations were derived to maximize the sum ergodic capacity of all the SUs under all possible combinations of transmit power constraint and interference power constraint.
The system model is introduced in Section 2. The resource allocation in finite systems is discussed in Section 3. The optimal resource allocation is derived for large systems in Section 4. Numerical results and conclusions are provided in Sections 5 and 6, respectively.
It is shown that the expected loss of the optimized resource allocation plan derived from this model is smaller than that of the population proportion-based allocation plan and average-based allocation plan.
Optimal channel rate allocation is derived depending upon source significance and channel status information.
Together, the tables clearly show that retention and profitability are not altogether mutually reinforcing objectives; optimal allocation decisions derived for each are not necessarily optimal overall.
Moreover, the closed-form expression of optimal time and bandwidth allocation are derived.
An optimal solution for power allocation is derived as a closed form using a Lagrangian relaxation method.
In [4], the secrecy capacity of the ergodic slow fading channels was characterized and the optimal power/rate allocation was derived.
