Information capacity of the matched Gaussian channel with jamming. Part 2: Infinitedimensional channels
Abstract
The additive infinitedimensional Gaussian channel subject to jamming is modeled as a twoperson zerosum game with mutual information as the payoff function. The jammer's noise is added to the ambient Gaussian noise. The coder's signal energy is subject to a constraint is necessary in order that the capacity without feedback be finite. It is shown that use of this same RKHS constraint on the jammer's process is too strong; the jammer would then not be able to reduce capacity, regardless of the amount of jamming energy available. The constraint on the jammer is thus on the total jamming energy, without regard to its distribution relative to that of the ambient noise energy. The existence of a saddle value for the problem does not follow from the von Neuman minimax theorem in the original problem formulation. However, a solution is shown to exist. A saddle point, saddle value, and the jammer's minimax strategy are determined. The solution is a function of the problem parameters: the constraint on the coder, the constraint on the jammer, and the covariance of the ambient Gaussian noise.
 Publication:

NASA STI/Recon Technical Report N
 Pub Date:
 October 1990
 Bibcode:
 1990STIN...9127432B
 Keywords:

 Channel Capacity;
 Channel Noise;
 Coders;
 Jamming;
 Random Noise;
 Signal Encoding;
 Signal Transmission;
 Additives;
 Ambience;
 Covariance;
 Game Theory;
 Information;
 Jammers;
 Minimax Technique;
 Communications and Radar