UPPER BOUND TO THE CAPACITY OF A LINEAR TIMEVARYING CHANNEL WITH ADDITIVE GAUSSIAN NOISE
Abstract
The analysis is concerned with the evaluation of the upper bound to the capacity of a linear time-varying channel obtained by finding the capacity of the same channel when its behavior at all times is known a priori. Numerical evaluation turns out to depend on the ditribution of the eigenvalues of a random infinite-dimensional matrix, which is apparently an unsolved mathematical problem. Evaluation is possible in two special ases: first, where the channel is not time-varying in which case the capacity formula reduces to that formerly known; second, when the channel has no memory, that is y = ax + u, where a is random and n is white and gaussian. 9author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 26, 1962
- Accession Number
- AD0287453
Entities
People
- G. David Forney Jr
Organizations
- Massachusetts Institute of Technology