By Topic

Estimates of \epsilon capacity for certain linear communication channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

The following simple abstract model for a class of communications problems is adopted: the set of possible transmitted signals x is taken to be the unit ball in the L_{2} space of functions defined on [-T, T] (bounded energy); the transmitted signal is assumed to be operated on by a convolution operator H ; and the final observed received signal z is z = Hx + n , where n is an unknown error, caused either by additive noise, lack of complete knowledge of H , or other causes, of norm less than some specified \epsilon (not necessarily small). The problem is to determine how many "distinguishable" signals can be sent, i.e., how many x_{i} there are such that the y_{i} = Hx_{i} are separated in norm by at least \epsilon . The chief results are asymptotic upper and lower bounds on the rate of error-free transmission possible, i.e., the ratio of the logarithm of the number of distinguishable signals to the time interval 2T as T \rightarrow \infty . These estimates are in terms of the Fourier transform of the kernel of the convolution operator H . The suitability of the model and the nature of the results are discussed.

Published in:

IEEE Transactions on Information Theory  (Volume:14 ,  Issue: 3 )