The worst additive noise under a covariance constraint

被引:252
作者
Diggavi, SN [1 ]
Cover, TM
机构
[1] AT&T Shannon Labs, Florham Pk, NJ 07932 USA
[2] Stanford Univ, Informat Syst Lab, Stanford, CA 94305 USA
关键词
Burg's theorem; mutual information game; worst additive noise;
D O I
10.1109/18.959289
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The maximum entropy noise under a lag p autocorrelation constraint is known by Burg's theorem to be the pth order Gauss-Markov process satisfying these constraints. The question is, what is the worst additive noise for a communication channel given these constraints? Is it the maximum entropy noise? The problem becomes one of extremizing the mutual information over all noise processes with covariances satisfying the correlation constraints R-0,.., R-p. For high signal powers, the worst additive noise is Gauss-Markov of order p as expected. But for low powers, the worst additive noise is Gaussian with a covariance matrix in a convex set which depends on the signal power.
引用
收藏
页码:3072 / 3081
页数:10
相关论文
共 27 条
[1]  
[Anonymous], 1959, RADIOTECHN ELEKTRON
[2]  
[Anonymous], ADAPTIVE FILTER THEO, DOI DOI 10.1109/ISCAS.2017.8050871
[3]   Information capacity of channels with partially unknown noise .1. Finite-dimensional channels [J].
Baker, CR ;
Chao, IF .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1996, 56 (03) :946-963
[5]   THE GAUSSIAN TEST CHANNEL WITH AN INTELLIGENT JAMMER [J].
BASAR, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (01) :152-157
[6]  
Blachman N. M., 1957, P IRE WESCON C, P61
[7]   ON CAPACITY OF A BAND-LIMITED-CHANNEL PERTURBED BY STATISTICALLY DEPENDENT INTERFERENCE [J].
BLACHMAN, NM .
IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :48-&
[8]  
BLACHMAN NM, 1962, IRE T INFORM THEOR, V8, pS53
[9]   AN INFORMATION-THEORETIC PROOF OF BURGS MAXIMUM-ENTROPY SPECTRUM [J].
CHOI, BS ;
COVER, TM .
PROCEEDINGS OF THE IEEE, 1984, 72 (08) :1094-1095
[10]  
Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X