
Convex optimisation‐based joint channel and power allocation scheme for orthogonal frequency division multiple access networks
Author(s) -
Liu Peng,
Li Jiandong,
Li Hongyan,
Meng Yun
Publication year - 2015
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2014.0409
Subject(s) - joint (building) , orthogonal frequency division multiple access , division (mathematics) , computer science , channel (broadcasting) , scheme (mathematics) , regular polygon , power (physics) , mathematical optimization , channel access method , orthogonal frequency division multiplexing , telecommunications , mathematics , wireless , engineering , arithmetic , geometry , architectural engineering , mathematical analysis , physics , quantum mechanics
This study concerns joint channel and power allocation scheme for multi‐user orthogonal frequency division multiple access system. The author's highlight is margin adaptive (MA) resource allocation problem namely minimising the total transmit power of users with rate requirement constraints. MA is generally provable NP‐hard; the typical methods are either to relax and round, or to fix the transmission mode of users (e.g. modulation and coding). Differently, they reorganise MA problem with only power variables left and design a novel relaxation scheme to enable the convexity. The polynomial‐time algorithm‐interior‐point method‐is employed to solve the relaxation problem and the theoretical complexity is further presented. Simulation results demonstrate that the author's scheme can provide high energy efficiency compared with the existing methods, 100% relative error bounds with respect to the optimum in most cases, and low computational complexity.