1 Introduction
1.1 Prior and related work
1.2 Motivation and contributions
-
A novel non-linear precoding technique, namely SO-THP+GMI, is proposed for the downlink of MU-MIMO networks in the presence of multiple eavesdroppers.
-
The proposed SO-THP+GMI algorithm combines the SO-THP with the generalized matrix inversion (GMI) technique to achieve a higher secrecy rate.
-
The proposed SO-THP+GMI precoding algorithm is extended to a simplified GMI (S-GMI) version which aims to reduce computational complexity of the SO-THP+GMI algorithm.
-
An LR strategy is combined with the aforementioned S-GMI version proposed algorithm, and this so-called LR-aided-version algorithm achieves full receive diversity.
-
An analysis of the secrecy rate achieved by the proposed non-linear precoding algorithms is carried out along with an assessment of their computational complexity cost.
-
When different power is allocated to generate the artificial noise, an analysis of the power ratio which can achieve the optimal value in terms of secrecy rate is given
1.3 Notation
2 System model and performance metrics
2.1 System model
2.2 Secrecy rate and other relevant metrics
2.2.1 Secrecy rate and secrecy capacity
2.2.2 Computational complexity
2.2.3 BER performance
3 Review of the SO-THP algorithm
4 Proposed precoding algorithms
4.1 SO-THP+GMI algorithm
4.2 SO-THP+S-GMI algorithm
4.3 LR-SO-THP+S-GMI algorithm
5 Analysis of the algorithms
5.1 Computational complexity analysis
Steps | Operations | FLOPS | Case |
---|---|---|---|
(2,2,2)×6 | |||
1 |
G
r
=U
r
Σ
r
[V
r
(1)
V
r
(0)]
H
; |
\(32R(N_{t}{N_{r}^{2}}\)
| |
\(+{N_{r}^{3}})\)
| 3072 | ||
2 |
\(\boldsymbol {\bar {G}}=\)
|
\((2{N_{t}^{3}}-2{N_{t}^{2}}\)
| |
G=(H
H
H+α
I)−1
H
H
|
\(+N_{t}+16N_{R} {N_{t}^{2}})\)
| 3822 | |
3 |
\(\boldsymbol {\bar {G}}_{n}=\bar {\boldsymbol {Q}_{n}}\bar {\boldsymbol {R}_{n}}\)
|
\(\sum \limits _{r=1}^{R} 16r({N_{t}^{2}} N_{r}\)
| |
\( + N_{t} {N_{r}^{2}} +\frac {1}{3} {N_{r}^{3}})\)
| 9472 | ||
4 |
\({\boldsymbol {H}_{eff,n}}={\boldsymbol {H}_{n}}\bar {\boldsymbol {Q}_{n}}\boldsymbol {T}_{n}\)
|
\(\sum \limits _{r=1}^{R} 16r N_{R} {N_{t}^{2}}\)
| 20,736 |
5 |
\({\boldsymbol {H}_{eff,n}}={\boldsymbol {U}_{n}^{(4)}}{\boldsymbol {\Sigma }_{n}^{(4)}} {{\boldsymbol {V}_{n}}^{(4)}}^{H}\)
|
\(\sum \limits _{r=1}^{R} 64r(\frac {9}{8}{N_{r}^{3}}+ \)
| |
\(N_{t} {N_{r}^{2}}+\frac {1}{2}{N_{t}^{2}} N_{r})\)
| 26,496 | ||
6 |
B=lower triangular | ||
\(\left (\boldsymbol {D}\boldsymbol {H}\boldsymbol {F}\bullet \text {diag}\left ([\boldsymbol {D} \boldsymbol {H}\boldsymbol {F}]_{rr}^{-1}\right)\right)\)
|
\( 16N_{R} {N_{t}^{2}}\)
| 3456 | |
Total 67,054 |