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

Science China Information Sciences

Ergodic secrecy rate of two-user MISO interference channels with statistical CSI

Zesong Fei, Jiqing Ni, Di Zhao, Chengwen Xing, Niwei Wang, Jingming Kuang

Published Sep 5, 2014• 13 citations
Publisher
DOI
10.1007/s11432-014-5098-4

Related papers

Information theoretic secrecy for some multiuser wireless communication channels

Ender Tekin

•Apr 21, 2008•2 citations

Secrecy Balancing over Two-User MISO Interference Channels with Rician Fading

Jiqing Ni, Zesong Fei, Chengwen Xing +3 more

This paper considers a 2-user multiple-input single-output (MISO) interference channel with confidential messages (IFC-CM), in which the Rician channel model is assumed. The coordinated beamforming vectors at the two transmitters have the similar parameterizations as those for perfect CSI, which could be optimized jointly and achieved by agreeing on the real parameters between the two users. Our main contribution is that a quadratic relationship between the two real-valued parameters can be derived for the Rician channel to reach the ergodic secrecy rate balancing point. Simulation results present the secrecy performance over the 2-user MISO IFC-CM scenario.

International Journal of Antennas and Propagation•Jan 1, 2013•4 citations

Probabilistic Constrained Power Allocation for MISO Wiretap Channel Based on Statistical CSI-E

Xiaojun Sun, Xiaojian Liu, Ming Yan Jiang +2 more

In this letter, we propose a power allocation scheme to optimize the ergodic secrecy rate of multiple-input single-output (MISO) fading wiretap channels with a probabilistic constraint, using the statistical channel state information (CSI) of the eavesdropper (CSI-E). The analytical expressions of the false secrecy probability are derived and used as constraints in the rate maximization problem. Moreover, we obtain a suboptimal solution by formulating the power allocation problem as a Rayleigh quotient problem.

IEICE Transactions on Communications•Jan 1, 2011•0 citations

On the secrecy degrees of freedom of miso wiretap channels with delayed CSIT

Mari Kobayashi, Pablo Piantanida, Sheng Yang +1 more

•Mar 1, 2011•0 citations

Ergodic Secrecy Rate of Movable Antenna-Aided MIMOME Systems with Statistical ECSI

Lei Xie, Guanxiong Shen, Guyue Li +1 more

IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM)•Jul 1, 2026•0 citations

Secure Communication through Nakagami-m Fading MISO Channel

Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah

We consider the problem of secret communication over Nakagami-m fading multiple-input single-output (MISO) broadcast channel, where transmitter sends messages to the destination users following two different transmission protocols. In the first transmission protocol, transmitter sends a confidential message to user 1, and user 2 acts as an eavesdropper. In this protocol, at first, we define the ergodic secrecy capacity for the full channel state information (CSI) case and then we consider the case of only main channel CSI at the transmitter. Finally, we define the secrecy capacity in case of open-loop spatial multiplexing transmission scheme and present the analytical expression for the lower bound of ergodic secrecy capacity. In the second transmission protocol, we consider the transmission of two independent messages to user 1 and user 2 with information-theoretic secrecy, where each user would like to obtain its own confidential message in a reliable and safe manner. Under this communication scenario, an achievable secrecy capacity region is developed using secret dirty-paper coding scheme.

International Conference on Communications•Jun 1, 2011•10 citations
This paper considers a 2-user multiple-input single-output (MISO) interference channel with confidential messages (IFC-CM), in which the Rician channel model is assumed. The coordinated beamforming vectors at the two transmitters have the similar parameterizations as those for perfect CSI, which could be optimized jointly and achieved by agreeing on the real parameters between the two users. Our main contribution is that a quadratic relationship between the two real-valued parameters can be derived for the Rician channel to reach the ergodic secrecy rate balancing point. Simulation results present the secrecy performance over the 2-user MISO IFC-CM scenario.
In this letter, we propose a power allocation scheme to optimize the ergodic secrecy rate of multiple-input single-output (MISO) fading wiretap channels with a probabilistic constraint, using the statistical channel state information (CSI) of the eavesdropper (CSI-E). The analytical expressions of the false secrecy probability are derived and used as constraints in the rate maximization problem. Moreover, we obtain a suboptimal solution by formulating the power allocation problem as a Rayleigh quotient problem.
We consider the problem of secret communication over Nakagami-m fading multiple-input single-output (MISO) broadcast channel, where transmitter sends messages to the destination users following two different transmission protocols. In the first transmission protocol, transmitter sends a confidential message to user 1, and user 2 acts as an eavesdropper. In this protocol, at first, we define the ergodic secrecy capacity for the full channel state information (CSI) case and then we consider the case of only main channel CSI at the transmitter. Finally, we define the secrecy capacity in case of open-loop spatial multiplexing transmission scheme and present the analytical expression for the lower bound of ergodic secrecy capacity. In the second transmission protocol, we consider the transmission of two independent messages to user 1 and user 2 with information-theoretic secrecy, where each user would like to obtain its own confidential message in a reliable and safe manner. Under this communication scenario, an achievable secrecy capacity region is developed using secret dirty-paper coding scheme.