English

Large-Scale MIMO Secure Transmission with Finite Alphabet Inputs

Information Theory 2016-12-28 v1 math.IT

Abstract

In this paper, we investigate secure transmission over the large-scale multiple-antenna wiretap channel with finite alphabet inputs. First, we show analytically that a generalized singular value decomposition (GSVD) based design, which is optimal for Gaussian inputs, may exhibit a severe performance loss for finite alphabet inputs in the high signal-to-noise ratio (SNR) regime. In light of this, we propose a novel Per-Group-GSVD (PG-GSVD) design which can effectively compensate the performance loss caused by the GSVD design. More importantly, the computational complexity of the PG-GSVD design is by orders of magnitude lower than that of the existing design for finite alphabet inputs in [1] while the resulting performance loss is minimal. Numerical results indicate that the proposed PG-GSVD design can be efficiently implemented in large-scale multiple-antenna systems and achieves significant performance gains compared to the GSVD design.

Keywords

Cite

@article{arxiv.1612.08328,
  title  = {Large-Scale MIMO Secure Transmission with Finite Alphabet Inputs},
  author = {Yongpeng Wu and Jun-Bo Wang and Jue Wang and Robert Schober and Chengshan Xiao},
  journal= {arXiv preprint arXiv:1612.08328},
  year   = {2016}
}
R2 v1 2026-06-22T17:34:21.250Z