TY - JOUR
T1 - On the secrecy capacity of the wiretap channel with imperfect main channel estimation
AU - Rezki, Zouheir
AU - Khisti, Ashish J.
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: This work was supported in part by the Qatar National Research Fund (a member of Qatar Foundation) under NPRP Grant 5-603-2-243. This work was presented in part at the 2011 IEEE Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA. The editor coordinating the review of this paper and approving it for publication was A. Thangaraj.
PY - 2014/10
Y1 - 2014/10
N2 - We study the secrecy capacity of fast fading channels under imperfect main channel (between the transmitter and the legitimate receiver) estimation at the transmitter. Lower and upper bounds on the ergodic secrecy capacity are derived for a class of independent identically distributed (i.i.d.) fading channels. The achievable rate follows from a standard wiretap code in which a simple on-off power control is employed along with a Gaussian input. The upper bound is obtained using an appropriate correlation scheme of the main and eavesdropper channels and is the best known upper bound so far. The upper and lower bounds coincide with recently derived ones in case of perfect main CSI. Furthermore, the upper bound is tight in case of no main CSI, where the secrecy capacity is equal to zero. Asymptotic analysis at high and low signal-to-noise ratio (SNR) is also given. At high SNR, we show that the capacity is bounded by providing upper and lower bounds that depend on the channel estimation error. At low SNR, however, we prove that the secrecy capacity is asymptotically equal to the capacity of the main channel as if there were no secrecy constraint. Numerical results are provided for i.i.d. Rayleigh fading channels.
AB - We study the secrecy capacity of fast fading channels under imperfect main channel (between the transmitter and the legitimate receiver) estimation at the transmitter. Lower and upper bounds on the ergodic secrecy capacity are derived for a class of independent identically distributed (i.i.d.) fading channels. The achievable rate follows from a standard wiretap code in which a simple on-off power control is employed along with a Gaussian input. The upper bound is obtained using an appropriate correlation scheme of the main and eavesdropper channels and is the best known upper bound so far. The upper and lower bounds coincide with recently derived ones in case of perfect main CSI. Furthermore, the upper bound is tight in case of no main CSI, where the secrecy capacity is equal to zero. Asymptotic analysis at high and low signal-to-noise ratio (SNR) is also given. At high SNR, we show that the capacity is bounded by providing upper and lower bounds that depend on the channel estimation error. At low SNR, however, we prove that the secrecy capacity is asymptotically equal to the capacity of the main channel as if there were no secrecy constraint. Numerical results are provided for i.i.d. Rayleigh fading channels.
UR - http://hdl.handle.net/10754/563780
UR - http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6894545
UR - http://www.scopus.com/inward/record.url?scp=84908291362&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2014.2356482
DO - 10.1109/TCOMM.2014.2356482
M3 - Article
SN - 0090-6778
VL - 62
SP - 3652
EP - 3664
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 10
ER -