By Topic

On Secrecy Rate Analysis of MIMO Wiretap Channels Driven by Finite-Alphabet Input

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shafi Bashar ; Dept. of Electr. & Comput. Eng., Univ. of California, Davis, Davis, CA, USA ; Zhi Ding ; Chengshan Xiao

This work investigates the effect of finite-alphabet input constraint on the secrecy rate of a multi-antenna wiretap channel. Most existing works have characterized maximum achievable secrecy rate or secrecy capacity for single and multiple antenna systems based on Gaussian source signals and secrecy code. For practical considerations, we study the effect of finite discrete-constellation on the achievable secrecy rate of multiple-antenna wire-tap channels. Our proposed precoding scheme converts the underlying multi-antenna system into a bank of parallel channels. Based on this precoding strategy, we develop a decentralized power allocation algorithm based on dual decomposition to maximize the achievable secrecy rate. In addition, we analyze the achievable secrecy rate for finite-alphabet inputs in low and high SNR regions. Our results demonstrate substantial difference in secrecy rate between systems given finite-alphabet inputs and systems with Gaussian inputs.

Published in:

IEEE Transactions on Communications  (Volume:60 ,  Issue: 12 )