Abstract
Transmitted-power allocation (TPA) is vital for minimizing power consumption and managing interference in interleave-division multiple access (IDMA) systems. Conventionally, optimization problems arising from TPA assume that the transmitted powers can take any values in a pre-defined interval. Hence, a practical limitation is not taken into consideration: the transmitted powers of most mobile devices are discrete nowadays. In this paper, we consider an optimization problem in which transmitted powers can only take a finite number of levels. This problem is non-convex, but we show that it can be converted into a linear zero-one programming (LZOP) problem. Numerical examples demonstrate that the problem in the LZOP form can be solved efficiently using existing solvers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
