TY - GEN
T1 - Secure SC systems over generalized fading channels with imperfect CSI and co-channel interference
AU - Yang, Liang
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2021-09-14
Acknowledgements: This publication was made possible by the National Natural Science Foundation of China (NSFC) under Grant 61372096 and 61671160, the Department of Education of Guangdong Province (No. 2016KZDXM050), and the open research fund of National Mobile Communications Research Laboratory, Southeast University (No. 2018D01).
PY - 2018/6/11
Y1 - 2018/6/11
N2 - In this paper, we consider the average secrecy capacity of a single-input multiple-output (SIMO) system with channel estimation error over generalized fading channels in the presence of co-channel interference and an eavesdropper. More specifically, we assume that selection combining is applied at both the receiver and eavesdropper. We first present statistical analysis for the signal-to-interference plus noise ratio (SINR). Then, closed-form expressions for the average secrecy capacity are derived for two special cases: Rayleigh fading and no interference. For the general case, we focus on the asymptotic secrecy capacity analysis. Finally, numerical results are provided for average secrecy capacity with with different values of N and N. Results show that the scaling law of the secrecy capacity is 1/L log (N /N).
AB - In this paper, we consider the average secrecy capacity of a single-input multiple-output (SIMO) system with channel estimation error over generalized fading channels in the presence of co-channel interference and an eavesdropper. More specifically, we assume that selection combining is applied at both the receiver and eavesdropper. We first present statistical analysis for the signal-to-interference plus noise ratio (SINR). Then, closed-form expressions for the average secrecy capacity are derived for two special cases: Rayleigh fading and no interference. For the general case, we focus on the asymptotic secrecy capacity analysis. Finally, numerical results are provided for average secrecy capacity with with different values of N and N. Results show that the scaling law of the secrecy capacity is 1/L log (N /N).
UR - http://hdl.handle.net/10754/630500
UR - https://ieeexplore.ieee.org/document/8376961/
UR - http://www.scopus.com/inward/record.url?scp=85049161253&partnerID=8YFLogxK
U2 - 10.1109/wcnc.2018.8376961
DO - 10.1109/wcnc.2018.8376961
M3 - Conference contribution
AN - SCOPUS:85049161253
SN - 9781538617342
SP - 1
EP - 6
BT - 2018 IEEE Wireless Communications and Networking Conference (WCNC)
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -