2020
DOI: 10.1109/access.2020.2991342
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 net… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 44 publications
0
4
0
Order By: Relevance
“…Refer to our previous work [33] for details. Note that, after the optimal solution to (32) is obtained, the Gaussian randomization technique [35], [36] needs to be used to extract an approximately optimal solution p opt to problem (30). The overall source precoder design based on SDR is presented in detail in Algorithm 2.…”
Section: A Near Optimal Source Precoder Designmentioning
confidence: 99%
See 1 more Smart Citation
“…Refer to our previous work [33] for details. Note that, after the optimal solution to (32) is obtained, the Gaussian randomization technique [35], [36] needs to be used to extract an approximately optimal solution p opt to problem (30). The overall source precoder design based on SDR is presented in detail in Algorithm 2.…”
Section: A Near Optimal Source Precoder Designmentioning
confidence: 99%
“…, step size µ := µ int , and minimum step size µ min ; 2: Set n := 1, calculate Γ(R (n) |P) according to (20); 3: If µ > µ min , go to 4. Otherwise, return R (n) and stop; 4: Calculate Θ as (35). If Θ is not satisfied (33b), project Θ into the feasible set; Otherwise, update µ := 1 2 µ and go to 3; 7: Set n := n + 1.…”
Section: To Lessen the Chance Of Getting Trapped In Locally Optimalmentioning
confidence: 99%
“…In [2], for the multipleinput multiple-output (MIMO) SWIPT-based AF-TWR systems, hybridized power-time splitting ratios and precoders are obtained via the maximization of convexified bounds on the sum rate. In [24], [25], transceivers and splitters are designed via semi-definite relaxation (SDR) based convex problems for finite constellation symbols. For DF relaying in [23], power allocation and splitting ratios are computed via the formulated convex problem.…”
Section: Introductionmentioning
confidence: 99%
“…In [2], for the multipleinput multiple-output (MIMO) SWIPT-based AF-TWR systems with hybridized power-time splitting ratios and precoders are obtained via the maximization of convexified bounds on the sum rate. In [24], [25], transceivers and splitting ratios are designed via semi-definite relaxation (SDR) based convex optimization technique for finite constellation symbols. For DF relaying in [23], power allocation and splitting ratios are computed via the formulated convex problem.…”
Section: Introductionmentioning
confidence: 99%