Abstract

We investigate power allocation optimization for global energy efficiency (GEE) maximization in the massive multiple-input multiple-output technique aided multi-pair one-way decode-and-forward relay systems. Assuming that the minimum mean-square error channel estimator and zero-forcing transceivers are employed at the relay, we first derive an accurate closed-form expression of the GEE of this complex system. Based on our analytical results, a non-convex power allocation optimization problem with the objective of GEE maximization is formulated under specific quality-of-service (QoS) and transmit power constraints. To solve this challenging problem, the successive convex approximation technique is invoked to transform the original optimization problem into a concave fractional programming problem, which is then efficiently solved by Dinkelbach’s method and by the Charnes–Cooper transformation-based method. In addition, as a special case, the GEE maximization problem under the assumption of using the equal power allocation strategy at both the source users and the relay is also considered. Simulation results demonstrate the accuracy of our analytical results and the effectiveness of the proposed algorithms. Furthermore, the impact of several important system parameters (i.e., the QoS constraint, the transmit power constraints at both the source users and the relay, as well as the quality of channel estimation) on the maximum GEE achieved by the proposed algorithms is also illustrated.

Full Text
Paper version not known

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 call

Disclaimer: 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.