Sum-Throughput Maximization for MIMO Full-Duplex Wireless Powered Communication Network with Finite Alphabet Inputs

In this paper, we maximize the sum-throughput of a multi-user MIMO full-duplex wireless powered communication network (FD-WPCN) by jointly optimizing the precoding matrices and time allocation vector. In particular, we consider a more practical scenario with energy causality and finite alphabet inpu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2018 IEEE 88th Vehicular Technology Conference (VTC-Fall) s. 1 - 5
Hlavní autoři: Peng, Yingru, Ke, Feng
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.08.2018
Témata:
Broadcasting
Covariance matrices
Energy harvesting
finite alphabet inputs
full-duplex wireless powered communication network (FD-WPCN)
Iterative methods
Optimization
Precoding
Resource management
Wireless communication
ISSN:2577-2465
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we maximize the sum-throughput of a multi-user MIMO full-duplex wireless powered communication network (FD-WPCN) by jointly optimizing the precoding matrices and time allocation vector. In particular, we consider a more practical scenario with energy causality and finite alphabet inputs. The original optimization problem is non-convex and intractable. We prove that the time allocation problem is convex with the precoding matrices fixed. We also simplify the optimal precoder design to a convex power allocation problem for a given time allocation vector. By optimizing the precoding matrices and the time allocation vector alternately, we propose a two-step iterative algorithm to find the optimal solution. The simulation results show that our scheme outperforms other benchmark schemes significantly.
ISSN:2577-2465
DOI:10.1109/VTCFall.2018.8690897