.png){kind=icon}
Return
Efficient Algorithm for Selecting Secrecy Rate Maximizing Antennas
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2013.072313.131491.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Antenna selection (AS) is poised to provide solutions to hardware complexity issues while guaranteeing untappable information flow. We investigate the AS problem set up in the context of linear precoder design for secrecy rate maximization of a multiple-input single-output system. The original problem is both non-tractable and nonconvex. We propose a provably convergent iterative procedure that sequentially solves a series of convex programs. The proposed algorithm is then refined to yield a precoder of desired sparsity. Finally, numerical experiments are performed to study the execution of AS algorithm from various different aspects.
Keywords:
Physical layer security
antenna selection
convex optimization
multiple-input single-output (MISO) system
cardinality constraint
beamforming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
ShareSave
View more