IEEE Transactions on Information Theory

Volume 20 Issue 6 • November 1974

Filter Results

Displaying Results 1 - 13 of 13
  • Patterns in pattern recognition: 1968-1974

    Publication Year: 1974, Page(s):697 - 722
    Cited by:  Papers (179)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5039 KB)

    This paper selectively surveys contributions to major topics in pattern recognition since 1968. Representative books and surveys pattern recognition published during this period are listed. Theoretical models for automatic pattern recognition are contrasted with practical,, design methodology. Research contributions to statistical and structural pattern recognition are selectively discussed, inclu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Envelope detection of a unit-index amplitude-modulated cartier accompanied by noise

    Publication Year: 1974, Page(s):723 - 728
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (733 KB)

    The facts concerning the relative merits of linear and square-law envelope detection of a sinusoidally modulated carrier accompanied by Gaussian noise are clarified in this paper. The comparison when the carrier is weakly modulated and has mean power substantially greater than that of the noise in the input circuit has been fully covered in prior technical literature. In this special case the sign... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduced-memory likelihood processing of point processes

    Publication Year: 1974, Page(s):729 - 738
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1540 KB)

    The problems of reduced-memory modeling and processing of regular point processes are studied. The<tex>m</tex>-memory processes and processors are defined as those whose present (incremental) behavior depends only on the present observation of counts and the stored values of the preceding<tex>m</tex>instants of occurrence. Characterization theorems for<tex>m</tex&g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication networks: Message path delays

    Publication Year: 1974, Page(s):738 - 745
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1314 KB)

    A communication network is modeled by a weighted graph. The vertices of the graph represent stations with storage capabilities, while the edges of the graph represent communication channels (or other information processing media). Channel capacity weights are assigned to the edges of the network. The network is assumed to operate in a store-and-forward manner, so that when a channel is busy the me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A training mode adaptive quantizer

    Publication Year: 1974, Page(s):746 - 749
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (590 KB)

    A quantizer that must accommodate a wide range of signal powers would ordinarily require a large number of output levels compared to a quantizer of signals with known power. In this paper a quantizlng scheme is described for situations in which the signal power is unknown a priori but remains constant for the duration of a communication. The required number of levels is reduced because the quantiz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable-length encoding of fixed-rate Markov sources for fixed-rate channels

    Publication Year: 1974, Page(s):750 - 755
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    The problem of buffer overflow in variable-length-to-block and block-to-variable-length coding of fixed-rate finite-state homogeneous Markov sources for transmission through fixed:rate noiseless channels is investigated. Asymptotically optimal converging upper and lower bounds on the probability of overflow are derived. They decrease exponentially with the buffer size<tex>B</tex>. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimum ratio of word lengths in communication

    Publication Year: 1974, Page(s):756 - 758
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (406 KB)

    An elementary account concerning the optimum ratio between the source word (block) length and the block length of the corresponding channel codeword is given. By "optimum" it is meant that by choosing a suitable ratio of word lengths we can attain the theoretically optimum balance between the average distortion of the source information and the average "cost" (in a general sense) of using the chan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development of new estimation algorithms by innovations analysis and shift-invariance properties (Corresp.)

    Publication Year: 1974, Page(s):759 - 762
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (615 KB)

    It is shown how certain innovations decompositions can be used to obtain aa alternative derivation of some new estimating algorithms, based on Chandrasekhar-type equation. Such equations were originally obtained in radiative-transfer theory by using some invariance principles due to Ambartsumian and Chandrasekhar. Stationary processes have a natural shift invariance, but we show here how state-spa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on the observation of a Markov source through a noisy channel (Corresp.)

    Publication Year: 1974, Page(s):762 - 764
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (509 KB)

    A signal is sent by a two-state Markov source through a noisy channel. The objective is to develop a decoding scheme to obtain a reconstruction of the original signal. Necessary and sufficient conditions are presented, in both a sequential and a nonsequential context, for the optimality of several decoding schemes, including the singlet decoding rule and the data-independent decoding rule. A gener... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Further results on the Viterbi algorithm equalizer (Corresp.)

    Publication Year: 1974, Page(s):764 - 767
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    A receiver structure recently proposed for the detection of pulse-amplitude modulation (PAM) signals is considered. The receiver is designed to reduce the complexity of the Viterbi decoder by equalizing the channel to an optimum desired short memory channel. Expressions for the optimum prefilter and short memory model are given. It is also shown that the minimum mean-square error achievable is a m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On modular weight and cyclic nonadjacent forms for arithmetic codes (Corresp.)

    Publication Year: 1974, Page(s):767 - 770
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (775 KB)

    In this correspondence we give a new definition of modular arithmetic weight (relative to any modulus<tex>m &gt; 0</tex>and any radix<tex>r \geq 2</tex>), which has two very useful properties, i) It is defined for all integers and is invariant under congruence modulo<tex>m</tex>. ii) It yields a metric for all moduli<tex>m</tex>. In the important... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical inference for space-time point processes (D.Sc. Thesis abstr.)

    Publication Year: 1974, Page(s): 771
    Request permission for commercial reuse | PDF file iconPDF (131 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric sequential array processing (Ph.D. Thesis abstr.)

    Publication Year: 1974, Page(s): 771
    Request permission for commercial reuse | PDF file iconPDF (131 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu