Linear Precoder Design for SWIPT-Enabled Relay Networks With Finite-Alphabet Inputs

This paper considers the problem of mutual information maximization in a two-hop relay network with simultaneous wireless information and power transfer (SWIPT), where the relay nodes use the power splitting (PS) scheme to harvest the energy for information forwarding. Unlike previous research, this...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE access Ročník 8; s. 82012 - 82023
Hlavní autoři: Chen, Baojun, Zhu, Xiaodong, Tu, Xiaodong, Guo, Yunshan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Alphabets
Codes
Energy harvesting
Finite-alphabet inputs
MIMO (control systems)
MIMO communication
Mutual information
Optimization
Performance degradation
Polynomials
Power transfer
precoder design
Precoding
relay network
Relay networks
Relay networks (telecommunications)
SWIPT
Symmetric matrices
ISSN:2169-3536, 2169-3536
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í:This paper considers the problem of mutual information maximization in a two-hop relay network with simultaneous wireless information and power transfer (SWIPT), where the relay nodes use the power splitting (PS) scheme to harvest the energy for information forwarding. Unlike previous research, this paper focuses on a more practical scenario, where the inputs to the network are assumed to be finite-alphabet signals. Although each node in the network is assumed to have single antenna, we show that the relay network can be regarded as an effective multiple-input multiple-output (MIMO) system. Our goal is to perform the joint optimization on the precoder at source and PS ratio at relays to maximize the mutual information. Although the formulated problem is nondeterministic polynomial-time (NP)-hard, we theoretically analyze the optimal PS ratio; then, by using the structure of optimization problem, a near optimal precoder design based on semidefinite relaxation (SDR) is proposed; further, to reduce the complexity of algorithm, another precoder design based on search technique, which exploiting the structure of precoder, is developed only with a slight performance degradation. Simulation results verify the efficacy of proposed precoder designs.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2020.2991342