Precoding Design and Power Allocation in Two-User MU-MIMO Wireless Ad Hoc Networks
| Autor: | Yinfeng Li, Dingcheng Yang, Haole Chen, Xiaoxiao Zhou, Lin Xiao |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
Beamforming
Physics and Astronomy (miscellaneous) Wireless ad hoc network Computer science General Mathematics Real-time computing 02 engineering and technology Precoding law.invention beamforming 0203 mechanical engineering Relay law 0202 electrical engineering electronic engineering information engineering Computer Science (miscellaneous) Zero-forcing precoding Wireless precoding Computer Science::Information Theory business.industry Node (networking) lcsh:Mathematics 020206 networking & telecommunications 020302 automobile design & engineering power allocation semi-definite relaxation lcsh:QA1-939 Multi-user MIMO Chemistry (miscellaneous) business Computer network |
| Zdroj: | Symmetry, Vol 9, Iss 11, p 247 (2017) Symmetry; Volume 9; Issue 11; Pages: 247 |
| ISSN: | 2073-8994 |
| Popis: | In this paper, we consider the precoding design and power allocation problem for multi-user multiple-input multiple-output (MU-MIMO) wireless ad hoc networks. In the first timeslot, the source node (SN) transmits energy and information to a relay node (RN) simultaneously within the simultaneous wireless information and power transfer (SWIPT) framework. Then, in the second timeslot, based on the decoder and the forwarding (DF) protocol, after reassembling the received signal and its own signal, the RN forwards the information to the main user (U1) and simultaneously sends its own information to the secondary user (U2). In this paper, when the transmission rate of the U1 is restricted, the precoding, beamforming, and power splitting (PS) transmission ratio are jointly considered to maximize the transmission rate of U2. To maximize the system rate, we design an optimal beamforming matrix and solve the optimization problem by semi-definite relaxation (SDR), considering the high complexity of implementing the optimal solution. Two sub-optimal precoding programs are also discussed: singular value decomposition and block diagonalization. Finally, the performance of the optimization and sub-optimization schemes are compared using a simulation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|