2014 International Conference on Signal Processing and Communications (SPCOM) 2014
DOI: 10.1109/spcom.2014.6983915
|View full text |Cite
|
Sign up to set email alerts
|

Power allocation in MIMO wiretap channel with statistical CSI and finite-alphabet input

Abstract: Abstract-In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical knowledge of the eavesdroppers CSI are assumed. We first consider the MIMO wiretap channel with Gaussian input. Using Jensen's inequality, we transform the secrecy rate max-min optimization problem to a single maximization problem. We use generalized singular value decompos… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 16 publications
0
6
0
Order By: Relevance
“…Alternatively, the secrecy rate maximization, assuming statistical CSIT of the eavesdropping channel, has been pursued by approximating the information rate between Alice and Eve, which leads to a simplified optimization problem. In [28], the average mutual information between Alice and Eve is upperbounded by a deterministic channel and the optimal precoding has the same direction as the generalized eigenvector of the approximate wiretap channels. In [29], the average mutual information is lower-bounded with a simplified analytical expression, and the upper bound of secrecy rate is obtained by assuming linear precoding at the transmitter.…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Alternatively, the secrecy rate maximization, assuming statistical CSIT of the eavesdropping channel, has been pursued by approximating the information rate between Alice and Eve, which leads to a simplified optimization problem. In [28], the average mutual information between Alice and Eve is upperbounded by a deterministic channel and the optimal precoding has the same direction as the generalized eigenvector of the approximate wiretap channels. In [29], the average mutual information is lower-bounded with a simplified analytical expression, and the upper bound of secrecy rate is obtained by assuming linear precoding at the transmitter.…”
Section: A Related Workmentioning
confidence: 99%
“…By approximating the average rate of Eve with its Taylor series expansion, the non-convex secrecy rate maximization reduces to a sequence of convex sub-problems [30]. However, the techniques used in [28]- [30] are relevant to the MIMO channels with colocated antenna arrays, and cannot be applied to the D-MIMO (or RD-MIMO) channels, as we assumed in this paper.…”
Section: Introductionmentioning
confidence: 99%
“…They first obtain an expression for an achievable secrecy rate, and then, under the full CSI assumption, they optimize the transmit power and the beamforming vector. The problem of power allocation for secrecy over MIMO wiretap channels with multiple eavesdroppers is studied in [102]. Under the assumption that the transmitter has perfect MCSI and statistical ECSI, the proposed power allocation strategy gives non-zero secrecy rates at high transmit powers.…”
Section: A Multiuser and Multi-eve Network 1) Broadcast Channel Witmentioning
confidence: 99%
“…The constraint in (35) corresponds to the best case S − E j link information rate over the region of CSI error uncertainty. The constraint in ( 36) is associated with the information rate constraint in (23), i.e., the worst case information rate to the MIMO relay R over the region of CSI error uncertainty should be greater than or equal to the best case information rate to destination D. Solving the optimization problem (33) is hard due to the presence of e h in both the numerator and denominator of the objective function in (33) and the constraint in (36).…”
Section: N0mentioning
confidence: 99%
“…However, in a practical communication system, the codeword symbols will belong to a finite alphabet set, e.g., M -ary alphabets. The effect of finite constellation on secrecy rate has been reported in [17]- [23]. In [22], DF relay beamforming for secrecy with finite alphabet has been considered.…”
Section: Introductionmentioning
confidence: 99%