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

TL;DR

This paper examines how finite-alphabet inputs affect the secrecy rate in MIMO wiretap channels, proposing a precoding scheme and power allocation algorithm, and analyzing secrecy rates in different SNR regimes.

Contribution

It introduces a precoding method and a decentralized power allocation algorithm tailored for finite-alphabet inputs in MIMO wiretap channels, addressing practical input constraints.

Findings

Finite-alphabet inputs significantly reduce secrecy rates compared to Gaussian inputs.

The proposed precoding and power allocation improve secrecy rates in practical scenarios.

Secrecy rate analysis varies notably between low and high SNR regimes.

Abstract

This work investigates the effect of finite-alphabet source input on the secrecy rate of a multi-antenna wiretap system. 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. Despite the impracticality of Gaussian sources, the compact closed-form expression of mutual information between linear channel Gaussian input and corresponding output has led to broad application of Gaussian input assumption in physical secrecy analysis. 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 multi-antenna system into a bank of parallel channels. Based on this precoding strategy, we propose a decentralized power allocation algorithm based on dual decomposition for maximizing the achievable secrecy rate. In addition, we analyze the achievable secrecy rate for finite-alphabet inputs in low and high SNR cases. Our results demonstrate substantial difference in secrecy rate between systems given finite-alphabet inputs and systems with Gaussian inputs.