Gaussian Wiretap Channel With Amplitude and Variance Constraints

被引:34
作者
Ozel, Omur [1 ]
Ekrem, Ersen [1 ]
Ulukus, Sennur [1 ]
机构
[1] Univ Maryland, Dept Elect & Comp Engn, College Pk, MD 20742 USA
基金
美国国家科学基金会;
关键词
Gaussian wiretap channel; rate-equivocation region; amplitude and variance constraints; MEAN-SQUARE ERROR; CONFIDENTIAL MESSAGES; BROADCAST CHANNELS; TAP CHANNEL; CAPACITY; DISTRIBUTIONS; INFORMATION;
D O I
10.1109/TIT.2015.2459705
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the Gaussian wiretap channel with amplitude and variance constraints on the channel input. We first show that the entire rate-equivocation region of the Gaussian wiretap channel with an amplitude constraint is obtained by discrete input distributions with finite support. We prove this result by considering the existing single-letter description of the rate-equivocation region, and showing that discrete distributions with finite support exhaust this region. Our result highlights an important difference between the peak power (amplitude) constrained and the average power (variance) constrained cases. Although, in the average power constrained case, both the secrecy capacity and the capacity can be achieved simultaneously, our results show that in the peak power constrained case, in general, there is a tradeoff between the secrecy capacity and the capacity, in the sense that, both may not be achieved simultaneously. We also show that under sufficiently small amplitude constraints the possible tradeoff between the secrecy capacity and the capacity does not exist and they are both achieved by the symmetric binary distribution. Finally, we prove the optimality of discrete input distributions in the presence of an additional variance constraint.
引用
收藏
页码:5553 / 5563
页数:11
相关论文
共 19 条
[1]   The capacity of discrete-time memoryless Rayleigh-Fading channels [J].
Abou-Faycal, IC ;
Trott, MD ;
Shamai, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (04) :1290-1301
[2]   ESTIMATING A BOUNDED NORMAL-MEAN [J].
CASELLA, G ;
STRAWDERMAN, WE .
ANNALS OF STATISTICS, 1981, 9 (04) :870-878
[3]   Capacity-achieving probability measure for conditionally Gaussian channels with bounded inputs. [J].
Chan, TH ;
Hranilovic, S ;
Kschischang, FR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (06) :2073-2088
[4]  
Cover Thomas M., 2006, Elements of Information Theory, V2nd
[5]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892
[6]   Mutual information and minimum mean-square error in Gaussian channels [J].
Guo, DN ;
Shamai, S ;
Verdú, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (04) :1261-1282
[7]   Estimation in Gaussian Noise: Properties of the Minimum Mean-Square Error [J].
Guo, Dongning ;
Wu, Yihong ;
Shamai , Shlomo ;
Verdu, Sergio .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) :2371-2385
[8]   The noncoherent Rician fading channel -: Part I:: Structure of the capacity-achieving input [J].
Gursoy, MC ;
Poor, HV ;
Verdú, S .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2005, 4 (05) :2193-2206
[9]   Characterization and computation of optimal distributions for channel coding [J].
Huang, JY ;
Meyn, SP .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (07) :2336-2351
[10]  
LEUNGYANCHEONG SK, 1978, IEEE T INFORM THEORY, V24, P451, DOI 10.1109/TIT.1978.1055917