• DocumentCode
    910613
  • Title

    Estimates of \\epsilon capacity for certain linear communication channels

  • Author

    Root, William L.

  • Volume
    14
  • Issue
    3
  • fYear
    1968
  • fDate
    5/1/1968 12:00:00 AM
  • Firstpage
    361
  • Lastpage
    369
  • Abstract
    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.
  • Keywords
    Information theory; Additive noise; Channel capacity; Communication channels; Convolution; Distortion; Fourier transforms; Gaussian channels; Kernel; NASA; Signal mapping;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1968.1054156
  • Filename
    1054156