Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Communications Letters

Outage Probability Oriented Secrecy Rate Optimization for Finite-Alphabet Inputs

Hao Xu, Guiyang Xia, Xiaobo Zhou, Yantao Liu, Feng Shu, Jiangzhou Wang

Published Jun 14, 2023• 0 citations
Publisher

Abstract

This letter aims at investigating the secrecy outage probability (SOP) performance and formulating an associated precoder optimization problem to maximize the achievable secrecy rate (SR) for finite-alphabet inputs. As a passive eavesdropper is taken into account, we derive that: 1) the phase of the optimal precoder is orthogonal to that of the channel spanning from the transmitter to the intended receiver; 2) the modulus of the optimal precoder vector also has a linear correlation to that of the mentioned channel. Benefited from these findings, the original optimization problem is simplified to one only related to a pair of scalars, which thus dramatically reduces the computational complexity. Our simulation results finally verify the effectiveness of the proposed precoder design scheme.

DOI
10.1109/lcomm.2023.3285947

Related papers

Linear Precoding for Finite-Alphabet Signaling Over MIMOME Wiretap Channels

Yongpeng Wu, Chengshan Xiao, Zhi Jun Ding +2 more

In this paper, we investigate the secrecy rate of finite-alphabet communications over multiple-input-multiple-output-multiple-antenna eavesdropper (MIMOME) channels. Traditional precoding designs based on Gaussian input assumption may lead to substantial secrecy rate loss when the Gaussian input is replaced by practical finite-alphabet input. To address this issue, we investigate linear precoding designs to directly maximize the secrecy rate for MIMOME systems under the constraint of finite-alphabet input. By exploiting the theory of Karush-Kuhn-Tucker (KKT) analysis and matrix calculus, we first present necessary conditions of the optimal precoding design when instantaneous channel-state information (CSI) of the eavesdropper is known at the transmitter. In this light, an iterative algorithm for finding the optimal precoding matrix is developed, utilizing a gradient decent method with backtracking line search. Moreover, we find that the beamforming design in MIMONE systems, which is a secrecy-capacity-achieving approach for Gaussian signaling, no longer provides the maximum secrecy rate for finite-alphabet input data. This case is substantially different from the Gaussian input case. In addition, we derive the closed-form results on the precoding matrix, which maximizes the secrecy rate in the low signal-to-noise ratio (SNR) region, and reveal the optimal precoding structure in the high-SNR region. A novel jamming signal generation method that draws on the CSI of the eavesdropper to additionally increase the secrecy rate is further proposed. The precoding design with only statistical CSI of the eavesdropper available at the transmitter is also considered. Numerical results show that the proposed designs provide significant gains over recent precoding designs through a power control policy and the precoding design with the Gaussian input assumption in various scenarios.

IEEE Transactions on Vehicular Technology•Apr 20, 2012•128 citations

Outage Constrained Secrecy Rate Maximization for MIMOME Multicast Wiretap Channels

Huanhuan Song, Hong Wen, Runfa Liao +2 more

In this letter, we investigate a robust transmit optimization design based on an artificial noise (AN)-aided precoding scheme for maximizing secrecy rate in a multiple-input multiple-output multiple-eavesdropper multicast network where a transmitter sends confidential information to multiple intended users and provides energy for multiple idle nodes while multiple passive eavesdroppers try to overhear the secret information. Supposing Gaussian CSI uncertainties, the proposed outage-constrained secrecy rate maximization (OC-SRM) problem is nonconvex and its analytical analysis is more challenging than several existing OC-SRM schemes. Technically, to circumvent this mathematically intractable secrecy problem, we resort to low SNR approximation and some conservative approximations (e.g., Bernstein-type inequality and sphere bounding) to reformulate the OC-SRM problem into two convex subproblems which can be efficiently solved by the off-the-shelf optimization solver. Simulation results are provided to validate the security performance of the robust AN-aided precoding design.

IEEE Wireless Communications Letters•Nov 9, 2018•10 citations

Alleviating Secrecy Outage Events via Power Optimization for Finite-Alphabet Inputs

Guiyang Xia, Yan Lin, Xiaobo Zhou +2 more

This letter aims at minimizing the total power consumption of security-reliability transmission (SRT) for practical finite-alphabet inputs. To this end, we coercively restrict that the mutual information over the legitimate channel is greater than an anticipated rate while the one over the illegitimate channel is constrained by a low rate. Our proposed strategy contributes to the secure transmission in circumventing secrecy outage events, which is a challenge in conventional secrecy rate maximization problems. Finally, simulation results reveal the significance of our proposed SRT in terms of both the total power consumption and the secrecy performance attained.

IEEE Wireless Communications Letters•Nov 15, 2021•2 citations

Secure-Reliable Transmission Designs for Full-Duplex Receiver With Finite-Alphabet Inputs

Guiyang Xia, Xiaobo Zhou, Lichuan Gu +3 more

This paper studies a convincingly secure transmission framework under an allowable outage probability for practical finite-alphabet inputs, where a full-duplex receiver (Bob) is taken into account to emit the artificial noise for deteriorating the eavesdropper’s decoding performance. We develop a secure-reliable mechanism to take the place of prior secrecy rate (SR) maximization strategy, where a closed form expression is invoked for substituting the non-closed SR expression upon exploiting the multi-exponential decay fitting approach. Hence, the intractable expectation operation over a large number of noise samples is circumvented. Moreover, a pair of critical probabilities of the reliable transmission and secure outage are first analyzed, and then a low-complexity optimization scheme is formulated. Apart from designing the transmission scheme for classically secure networks consisting of a transmitter, Bob and an eavesdropper, we further carry out an investigation on conceiving a secure-reliable strategy against multiple Eves for improving the system’s extensibility. To this end, analytical expressions of both the reliability outage and secrecy outage probabilities for multiple-Eve scenarios are also derived. Furthermore, a pragmatic iterative solution is conceived for addressing the corresponding max-min optimization problem. Finally, the simulation results validate the significance of our considered secure-reliable transmission in terms of the average SR performance attained.

IEEE Transactions on Information Forensics and Security•Jan 1, 2022•5 citations

On the Optimum Secrecy Outage Probability and Ergodic Secrecy Rate over Wireless Channels

Clément Leroy, Tarak Arbi, Benoît Geller +1 more

We study the secrecy of wireless channels in the presence of an eavesdropper, where the channels are random and the transmitter only has knowledge of the channel statistics. We investigate the optimal input distribution with respect to several secrecy metrics: the Secrecy Outage Probability (SOP), defined as the probability that the coding rate $r$ exceeds the instantaneous secrecy rate; the Ergodic Secrecy Rate (ESR), defined as the expected secrecy rate over channel realizations; and the Ergodic Positive Secrecy Rate (EPSR), defined as the expected value of the positive part of the secrecy rate. We introduce two partial orderings for random channels: the uniformly less noisy order and the less noisy on average order. We show that when the main channel is uniformly less noisy than the eavesdropper channel, the optimal input distribution is a non-precoded Gaussian input for both the SOP and the EPSR. Furthermore, we show that the same input distribution is optimal for the ESR when the less noisy on average order holds. In addition, similar optimality results for the SOP and the EPSR are obtained for single-transmit-antenna channels without requiring any channel ordering assumptions. Closed-form expressions of the secrecy metrics are derived for special cases of Rayleigh fading channels.

arXiv:2604.22587•Apr 24, 2026•0 citations

Linear MIMO precoding in multi-antenna wiretap channels for finite-alphabet data

Yongpeng Wu, Chengshan Xiao, Zhi Jun Ding +2 more

In this paper, we investigate the secrecy rate of finite alphabet communications over multiple-input, multiple-output, multiple-antenna eavesdropper (MIMOME) systems. Traditional precoder designs at the transmitter for achieving secrecy capacity (maximum secrecy rate) for MIMOME systems are developed according to the assumption of Gaussian input signals. Such designs may risk substantial secrecy rate loss when Gaussian inputs are replaced by practical finite alphabet inputs. To address this issue, we propose a linear precoding design to directly maximize the secrecy rate for MIMOME systems under the constraint of finite alphabet input. Exploiting convex optimization and matrix calculus, we present necessary conditions required of the optimal precoding design and develop an iterative algorithm for finding an efficient precoder. With finite alphabet input signals, maximum transmission power no longer corresponds to maximum secrecy rate as in the case of Gaussian input. We further derive closed-form results on the optimal transmission design for maximizing secrecy rate in low signal-to-noise ratio (SNR) region and near-optimal transmission power in a high SNR region.

International Conference on Communications•Jun 1, 2012•0 citations
This letter aims at investigating the secrecy outage probability (SOP) performance and formulating an associated precoder optimization problem to maximize the achievable secrecy rate (SR) for finite-alphabet inputs. As a passive eavesdropper is taken into account, we derive that: 1) the phase of the optimal precoder is orthogonal to that of the channel spanning from the transmitter to the intended receiver; 2) the modulus of the optimal precoder vector also has a linear correlation to that of the mentioned channel. Benefited from these findings, the original optimization problem is simplified to one only related to a pair of scalars, which thus dramatically reduces the computational complexity. Our simulation results finally verify the effectiveness of the proposed precoder design scheme.
In this paper, we investigate the secrecy rate of finite-alphabet communications over multiple-input-multiple-output-multiple-antenna eavesdropper (MIMOME) channels. Traditional precoding designs based on Gaussian input assumption may lead to substantial secrecy rate loss when the Gaussian input is replaced by practical finite-alphabet input. To address this issue, we investigate linear precoding designs to directly maximize the secrecy rate for MIMOME systems under the constraint of finite-alphabet input. By exploiting the theory of Karush-Kuhn-Tucker (KKT) analysis and matrix calculus, we first present necessary conditions of the optimal precoding design when instantaneous channel-state information (CSI) of the eavesdropper is known at the transmitter. In this light, an iterative algorithm for finding the optimal precoding matrix is developed, utilizing a gradient decent method with backtracking line search. Moreover, we find that the beamforming design in MIMONE systems, which is a secrecy-capacity-achieving approach for Gaussian signaling, no longer provides the maximum secrecy rate for finite-alphabet input data. This case is substantially different from the Gaussian input case. In addition, we derive the closed-form results on the precoding matrix, which maximizes the secrecy rate in the low signal-to-noise ratio (SNR) region, and reveal the optimal precoding structure in the high-SNR region. A novel jamming signal generation method that draws on the CSI of the eavesdropper to additionally increase the secrecy rate is further proposed. The precoding design with only statistical CSI of the eavesdropper available at the transmitter is also considered. Numerical results show that the proposed designs provide significant gains over recent precoding designs through a power control policy and the precoding design with the Gaussian input assumption in various scenarios.
In this letter, we investigate a robust transmit optimization design based on an artificial noise (AN)-aided precoding scheme for maximizing secrecy rate in a multiple-input multiple-output multiple-eavesdropper multicast network where a transmitter sends confidential information to multiple intended users and provides energy for multiple idle nodes while multiple passive eavesdroppers try to overhear the secret information. Supposing Gaussian CSI uncertainties, the proposed outage-constrained secrecy rate maximization (OC-SRM) problem is nonconvex and its analytical analysis is more challenging than several existing OC-SRM schemes. Technically, to circumvent this mathematically intractable secrecy problem, we resort to low SNR approximation and some conservative approximations (e.g., Bernstein-type inequality and sphere bounding) to reformulate the OC-SRM problem into two convex subproblems which can be efficiently solved by the off-the-shelf optimization solver. Simulation results are provided to validate the security performance of the robust AN-aided precoding design.
This letter aims at minimizing the total power consumption of security-reliability transmission (SRT) for practical finite-alphabet inputs. To this end, we coercively restrict that the mutual information over the legitimate channel is greater than an anticipated rate while the one over the illegitimate channel is constrained by a low rate. Our proposed strategy contributes to the secure transmission in circumventing secrecy outage events, which is a challenge in conventional secrecy rate maximization problems. Finally, simulation results reveal the significance of our proposed SRT in terms of both the total power consumption and the secrecy performance attained.
This paper studies a convincingly secure transmission framework under an allowable outage probability for practical finite-alphabet inputs, where a full-duplex receiver (Bob) is taken into account to emit the artificial noise for deteriorating the eavesdropper’s decoding performance. We develop a secure-reliable mechanism to take the place of prior secrecy rate (SR) maximization strategy, where a closed form expression is invoked for substituting the non-closed SR expression upon exploiting the multi-exponential decay fitting approach. Hence, the intractable expectation operation over a large number of noise samples is circumvented. Moreover, a pair of critical probabilities of the reliable transmission and secure outage are first analyzed, and then a low-complexity optimization scheme is formulated. Apart from designing the transmission scheme for classically secure networks consisting of a transmitter, Bob and an eavesdropper, we further carry out an investigation on conceiving a secure-reliable strategy against multiple Eves for improving the system’s extensibility. To this end, analytical expressions of both the reliability outage and secrecy outage probabilities for multiple-Eve scenarios are also derived. Furthermore, a pragmatic iterative solution is conceived for addressing the corresponding max-min optimization problem. Finally, the simulation results validate the significance of our considered secure-reliable transmission in terms of the average SR performance attained.
We study the secrecy of wireless channels in the presence of an eavesdropper, where the channels are random and the transmitter only has knowledge of the channel statistics. We investigate the optimal input distribution with respect to several secrecy metrics: the Secrecy Outage Probability (SOP), defined as the probability that the coding rate rrr exceeds the instantaneous secrecy rate; the Ergodic Secrecy Rate (ESR), defined as the expected secrecy rate over channel realizations; and the Ergodic Positive Secrecy Rate (EPSR), defined as the expected value of the positive part of the secrecy rate. We introduce two partial orderings for random channels: the uniformly less noisy order and the less noisy on average order. We show that when the main channel is uniformly less noisy than the eavesdropper channel, the optimal input distribution is a non-precoded Gaussian input for both the SOP and the EPSR. Furthermore, we show that the same input distribution is optimal for the ESR when the less noisy on average order holds. In addition, similar optimality results for the SOP and the EPSR are obtained for single-transmit-antenna channels without requiring any channel ordering assumptions. Closed-form expressions of the secrecy metrics are derived for special cases of Rayleigh fading channels.
In this paper, we investigate the secrecy rate of finite alphabet communications over multiple-input, multiple-output, multiple-antenna eavesdropper (MIMOME) systems. Traditional precoder designs at the transmitter for achieving secrecy capacity (maximum secrecy rate) for MIMOME systems are developed according to the assumption of Gaussian input signals. Such designs may risk substantial secrecy rate loss when Gaussian inputs are replaced by practical finite alphabet inputs. To address this issue, we propose a linear precoding design to directly maximize the secrecy rate for MIMOME systems under the constraint of finite alphabet input. Exploiting convex optimization and matrix calculus, we present necessary conditions required of the optimal precoding design and develop an iterative algorithm for finding an efficient precoder. With finite alphabet input signals, maximum transmission power no longer corresponds to maximum secrecy rate as in the case of Gaussian input. We further derive closed-form results on the optimal transmission design for maximizing secrecy rate in low signal-to-noise ratio (SNR) region and near-optimal transmission power in a high SNR region.