Abstract
In this paper, we investigate secure transmission over the large-scale multiple-antenna wiretap channel with finite alphabet inputs. First, we investigate the case where instantaneous channel state information (CSI) of the eavesdropper is known at the transmitter. 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 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 while the resulting performance loss is minimal. Then, we extend the PG-GSVD design to the case where only statistical CSI of the eavesdropper is available at the transmitter. 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 with the GSVD design.
Recommended Citation
Y. Wu et al., "Secure Transmission with Large Numbers of Antennas and Finite Alphabet Inputs," IEEE Transactions on Communications, vol. 65, no. 8, pp. 3614 - 3628, article no. 7926385, Institute of Electrical and Electronics Engineers, Aug 2017.
The definitive version is available at https://doi.org/10.1109/TCOMM.2017.2703654
Department(s)
Electrical and Computer Engineering
Keywords and Phrases
Finite Alphabet Inputs; GSVD; MIMO; Secure Transmission
International Standard Serial Number (ISSN)
0090-6778
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
01 Aug 2017
Comments
Horizon 2020 Framework Programme, Grant SCHO 831/5-1