A Remark on Secret-Key Generation over Correlated Fading Channels

被引:0
作者
Khisti, Ashish [1 ]
Diggavi, Suhas N. [2 ]
机构
[1] Univ Toronto, ECE Dept, Toronto, ON M5S 1A1, Canada
[2] Univ Calif Los Angeles, Dept Elect Engn, Los Angeles, CA 90024 USA
来源
2011 IEEE GLOBECOM WORKSHOPS (GC WKSHPS) | 2011年
关键词
AGREEMENT;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study secret-key agreement with public discussion over a flat-fading wiretap channel model. The fading gains are correlated across the receivers and sampled independently at each time. Perfect receiver channel state information (CSI) is assumed, whereas a noisy CSI of the main channel is also available to the transmitter. We propose lower and upper bounds on the capacity. Our lower bound is achieved by a coding scheme that involves a separate binning of the receiver CSI sequence and its channel output sequence. In general it improves upon the joint-binning schemes considered in earlier works. Our upper and lower bounds coincide, establishing the capacity, when either the transmitter has no CSI or when the channel gains of the legitimate receiver and the eavesdropper are statistically independent.
引用
收藏
页码:864 / 868
页数:5
相关论文
共 17 条