Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Information Theory, IRE Transactions on

Issue 1 • Date March 1959

Filter Results

Displaying Results 1 - 11 of 11
  • Editorial

    Publication Year: 1959 , Page(s): 3
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | PDF file iconPDF (56 KB)  
    Freely Available from IEEE
  • Correlation and delay line attenuation

    Publication Year: 1959 , Page(s): 4 - 9
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (784 KB)  

    The effect of delay line attenuation on the output of a correlator is studied for the case where the attenuation in db to within a frequency independent loss varies linearly with delay and as the square root of frequency. It is shown how attenuation affects the output signal-noise ratio of the correlator, increasing it for some signal spectrum shapes and decreasing it for others. Upper bounds on the increase and decrease are computed and a sufficient condition on the input signal spectrum is established which, when satisfied, assures a degradation in signal-noise ratio. Also examined is the effect of a frequency independent gain inserted to compensate for the delay line attenuation. It is shown how this gain may be chosen in order to give uniform system output noise over all values of delay. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the first probability of detection by a radar receiver system

    Publication Year: 1959 , Page(s): 9 - 11
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (334 KB)  

    Expressions for the detection probabilities associated with the output of filter-square law detector-filter radar receivers are presented for practical filter systems and with a slowly varying Rayleigh distributed signal amplitude. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Full decodable code-word sets

    Publication Year: 1959 , Page(s): 12 - 15
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (545 KB)  

    This paper considers further how the decodability condition imposes restrictions on a set of code words. A generating function is defined that describes the composition of the code words. The relation between the generating function and a "full" set of code words is found. This relation shows that the sum of arbitrary probabilities associated with the words of a full set must be one. A full set of code words is one to which no code word can be added and still keep the set decodable. It is also shown that a full set is "completable." For a completable set of code words any string of symbols can be made into a sentence by adding a suitable prefix and a suffix. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a property of Wiener filters

    Publication Year: 1959 , Page(s): 15 - 17
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (362 KB)  

    Let Y(\omega ,\alpha ) be the Wiener filter designed to yield an output which is the least-square approximation to s(t + \alpha ) where s(t) is the desired signal input. Let Y_L(\omega ) be the Wiener filter designed to yield an output which is the least-square approximation to some linear operation L on the desired input signal. The following simple relationship has been shown to hold between Y(\omega , \alpha ) and Y_L(\omega ) . If s(t) is the desired input signal and L_{\alpha }[s(t + \alpha ) is the desired output, where L_{\alpha } is some linear operation with respect to \alpha , then Y_L(\omega ) = L_{\alpha }[Y(\omega , \alpha )] . View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Machine recognition of hand-sent Morse code

    Publication Year: 1959 , Page(s): 17 - 24
    Cited by:  Papers (9)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1319 KB)  

    A transistorized special purpose digital computer called MAUDE (Morse AUtomatic DEcoder) has been designed, built and analyzed. This computer decodes a hand-sent Morse message, which is printed on a teletypewriter. MAUDE's decisions take place at a number of different levels and its "knowledge" is not only that of relative durations of dots and dashes, but also of the Morse code and even of certain elementary properties of language. MAUDE has successfully decoded between 90 per cent and 95 per cent of 184 operators. A successful decoding is one which results in a text which can be easily read by a man who knows the language. It is felt that MAUDE can be a practical piece of equipment for a site with heavy traffic. Its performance will be inferior to that of a man until more sophisticated language rules, using at least a word vocabulary, are included. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Morse distribution

    Publication Year: 1959 , Page(s): 25 - 31
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (563 KB)  

    A problem which arose during research involved in designing a machine to translate hand-keyed Morse code into printed text may be stated as follows: Let X = {x_i: i = l, 2, \cdots , n} be a sequence of independent random variables all of which have the same distribution. Assume that the probability that x_i = x_j , i \neq j , is zero. Let k be a positive integer \leq n , and consider all subsequences x_i, x_{i+1}, \cdots , x_{i+k-1} of X consisting of k consecutive variables. Let us distinguish, with a check ( \surd ), the largest member of each such subsequence. We have studied, and partially tabulated, p_n^k (r) , the probability that exactly r members of the sequence X are not checked. This paper contains most of the pertinent results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two properties of pseudo-random sequences (Corresp.)

    Publication Year: 1959 , Page(s): 32
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (152 KB)  

    The so-called "pseudo-random" (p-r) sequences defined below have two properties which may make them useful in certain communication systems. Stated roughly, the first property is that the minimum distance between different signals of a special class is maximized and the second is that the probability that one member of this class be mistaken for some other member is minimized. The so-called "pseudo-random" (p-r) sequences defined below have two properties which may make them useful in certain communication systems. Stated roughly, the first property is that the minimum distance between different signals of a special class is maximized and the second is that the probability that one member of this class be mistaken for some other member is minimized. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossless symbol coding with nonprimes (Corresp.)

    Publication Year: 1959 , Page(s): 33 - 34
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (353 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An inequality concerning the envelope of a correlation function (Corresp.)

    Publication Year: 1959 , Page(s): 33
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (172 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comment on a comment on pattern redundancy (Corresp.)

    Publication Year: 1959 , Page(s): 34 - 35
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (355 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

This Transactions ceased production in 1962. The current retitled publication is IEEE Transactions on Information Theory.

Full Aims & Scope