DocumentCode
1543326
Title
The worst additive noise under a covariance constraint
Author
Diggavi, Suhas N. ; Cover, Thomas M.
Author_Institution
AT&T Shannon Labs., Florham Park, NJ, USA
Volume
47
Issue
7
fYear
2001
fDate
11/1/2001 12:00:00 AM
Firstpage
3072
Lastpage
3081
Abstract
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 R0,…, Rp. 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
Keywords
Gaussian noise; Markov processes; correlation methods; covariance matrices; decoding; game theory; maximum entropy methods; minimax techniques; random codes; telecommunication channels; Burg´s theorem; Gauss-Markov process; Gaussian additive noise; Mahalanobis distance decoding; autocorrelation constraint; communication channel; convex set; correlation constraints; covariance constraint; covariance matrix; decoding; game-theoretic problem; high signal power; low signal power; maximum entropy noise; minimax rate; mutual information; noise covariance constraint; noise process; random Gaussian codebook; random coding; worst additive noise; Additive noise; Constraint theory; Entropy; Error correction; Error correction codes; Gaussian noise; Interference constraints; Quantum computing; Quantum mechanics; Rain;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.959289
Filename
959289
Link To Document