Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2016
DOI: 10.1109/lsp.2015.2504396
|View full text |Cite
|
Sign up to set email alerts
|

A Full-Duplex Bob in the MIMO Gaussian Wiretap Channel: Scheme and Performance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
39
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 65 publications
(39 citation statements)
references
References 18 publications
0
39
0
Order By: Relevance
“…The secrecy rate (SR) optimization was studied in both cases of known and unknown channel state information (CSI) of the Eve. The work in [20] considered a MIMO Gaussian wiretap channel with an FD jamming receiver to secure the DoF. The authors in [21] extended the prior work to a multiuser scenario, where the transmitter is equipped with multiple antennas to guarantee the individual SR for multiple users.…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The secrecy rate (SR) optimization was studied in both cases of known and unknown channel state information (CSI) of the Eve. The work in [20] considered a MIMO Gaussian wiretap channel with an FD jamming receiver to secure the DoF. The authors in [21] extended the prior work to a multiuser scenario, where the transmitter is equipped with multiple antennas to guarantee the individual SR for multiple users.…”
Section: A Related Workmentioning
confidence: 99%
“…Practical Implementations: The first step of Algorithm 1 requires a feasible point (X (0) , α (0) , µ (0) ) of (17) to successfully initialize the computational procedure, which is difficult to find in general. To circumvent this problem, initialized by any feasible (X (0) , α (0) ) to the convex constraints {(9e), (14), (17e), (20), (24), (26), (29), (39)}, the following convex Algorithm 1: Proposed Path-Following Algorithm to Solve SRM-EWCI (9) Initialization: Set κ := 0 and solve (41) to generate an initial feasible point (X (0) , α (0) , µ (0) ). 1: repeat 2: Solve (40) to obtain the optimal solution (X ⋆ , η ⋆ , Γ ⋆ , α ⋆ , µ ⋆ ).…”
Section: Approximation Of Constraintsmentioning
confidence: 99%
“…, X ∈ {a, b} and P A,max , P B,max ∈ R + represent the maximum transmit power of Alice and Bob. It is observed that the optimization problem in (33) holds a similar mathematical structure in relation to the transmit covariance matrices, i.e., X (n) X , W (n) X , X ∈ {a, b}, ∀n ∈ N as addressed for (12). Hence a similar procedure as in the Algorithm 1 following the result of the Lemma III.1 and III.2 is employed to obtain an optimal solution.…”
Section: A Bidirectional Sum Secrecy Rate Maximizationmentioning
confidence: 99%
“…One can check that the SDR-based MM approach developed in this paper is still applicable by setting κ A = κ B = 0, removing the zero-forcing constraint (12c), lifting the variable dimension of W and Q from (N −r)×(N −r) to N ×N and modifying Eve's sum rate accordingly. 3 Fig. 4 shows the result, where "FD" and "HD" correspond to the full-duplex and half duplex-based designs, resp.…”
Section: A the Case Of No Energy Harvesting With Evementioning
confidence: 99%