File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

최진석

Choi, Jinseok
Intelligent Wireless Communications Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 1578 -
dc.citation.number 3 -
dc.citation.startPage 1564 -
dc.citation.title IEEE TRANSACTIONS ON COMMUNICATIONS -
dc.citation.volume 71 -
dc.contributor.author Choi, Eunsung -
dc.contributor.author Oh, Mintaek -
dc.contributor.author Choi, Jinseok -
dc.contributor.author Park, Jeonghun -
dc.contributor.author Lee, Namyoon -
dc.contributor.author Al-Dhahir, Naofal -
dc.date.accessioned 2023-12-21T12:44:53Z -
dc.date.available 2023-12-21T12:44:53Z -
dc.date.created 2023-09-12 -
dc.date.issued 2023-03 -
dc.description.abstract Secure precoding superimposed with artificial noise (AN) is a promising transmission technique to improve security by harnessing the superposition nature of the wireless medium. However, finding a jointly optimal precoding and AN structure is very challenging in downlink multi-user multiple-input multiple-output wiretap channels with multiple eavesdroppers. The major challenge in maximizing the secrecy rate arises from the non-convexity and non-smoothness of the rate function. Traditionally, an alternating optimization framework that identifies beamforming vectors and AN covariance matrix has been adopted; yet this alternating approach has limitations in maximizing the secrecy rate. In this paper, we put forth a novel secure precoding algorithm that jointly and simultaneously optimizes the beams and AN covariance matrix for maximizing the secrecy rate when a transmitter has either perfect or partial channel knowledge of eavesdroppers. To this end, we first establish an approximate secrecy rate in a smooth function. Then, we derive the first-order optimality condition in the form of the nonlinear eigenvalue problem (NEP). We present a computationally efficient algorithm to identify the principal eigenvector of the NEP as a suboptimal solution for secure precoding. Simulations demonstrate that the proposed methods improve secrecy rate significantly compared to the existing methods. -
dc.identifier.bibliographicCitation IEEE TRANSACTIONS ON COMMUNICATIONS, v.71, no.3, pp.1564 - 1578 -
dc.identifier.doi 10.1109/TCOMM.2022.3227284 -
dc.identifier.issn 0090-6778 -
dc.identifier.scopusid 2-s2.0-85144786529 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/65436 -
dc.identifier.wosid 001053380300024 -
dc.language 영어 -
dc.publisher IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC -
dc.title Joint Precoding and Artificial Noise Design for MU-MIMO Wiretap Channels -
dc.type Article -
dc.description.isOpenAccess FALSE -
dc.relation.journalWebOfScienceCategory Engineering, Electrical & Electronic; Telecommunications -
dc.relation.journalResearchArea Engineering; Telecommunications -
dc.type.docType Article -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor Physical layer security -
dc.subject.keywordAuthor secrecy rate -
dc.subject.keywordAuthor secure precoding -
dc.subject.keywordAuthor artificial noise (AN) -
dc.subject.keywordAuthor joint and simultaneous optimization -
dc.subject.keywordPlus PHYSICAL LAYER SECURITY -
dc.subject.keywordPlus SECRECY RATE OPTIMIZATION -
dc.subject.keywordPlus WIRELESS COMMUNICATIONS -
dc.subject.keywordPlus MASSIVE MIMO -
dc.subject.keywordPlus NETWORKS -
dc.subject.keywordPlus SYSTEMS -
dc.subject.keywordPlus TRANSMISSION -
dc.subject.keywordPlus MAXIMIZATION -
dc.subject.keywordPlus CAPACITY -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.