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...
Saved in:
| Published in: | 2018 IEEE 88th Vehicular Technology Conference (VTC-Fall) pp. 1 - 5 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.08.2018
|
| Subjects: | |
| ISSN: | 2577-2465 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 |