IEEE Transactions on Information Theory

Volume 29 Issue 4 • July 1983

Filter Results

Displaying Results 1 - 25 of 33
  • Discrete utterance speech recognition without time alignment

    Publication Year: 1983, Page(s):473 - 491
    Cited by:  Papers (66)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2850 KB)

    The results of a new method are presented for discrete utterance speech recognition. The method is based on rate-distortion speech coding (speech coding by vector quantization), minimum cross-entropy pattern classification, and information-theoretic spectral distortion measures. Separate vector quantization code books are designed from training sequences for each word in the recognition vocabulary... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimax optimal universal codeword sets

    Publication Year: 1983, Page(s):491 - 502
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2051 KB)

    In an interactive multi-user data-processing system, a user knows the probabilities of his messages and must encode them into a fixed system-wide variable-length codeword set. He needs to receive the answer to his last message before selecting the next, so his encoding is one-shot. To minimize average codeword length he encodes his messages in order of decreasing probability into codewords in orde... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterizing the autocorrelations of binary sequences

    Publication Year: 1983, Page(s):502 - 508
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (907 KB)

    The class of autocorrelation functions of binary sequences is studied in terms of their finite-dimensional projections; that is, the vector ranges of finite sets of consecutive correlation coefficients. These are convex polyhedra whose extreme points can be generated by binary sequences of bounded periods. Algorithms are given for the calculation of the extreme points. Tables are presented for the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Monte Carlo study of absolute phase determination

    Publication Year: 1983, Page(s):509 - 520
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1651 KB)

    The problem of absolute phase tracking and the development of the properties of an optimal estimator of absolute phase are considered. Using Monte Carlo simulation, this estimator's performance is compared with that of the phase-locked loop on the basis of slip distribution growth rate. Further slip prediction is considered and a statistic, based on the entropy of the conditional distribution of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid ARQ error control using sequential decoding

    Publication Year: 1983, Page(s):521 - 535
    Cited by:  Papers (43)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2037 KB)

    An important feature of ARQ sequential decoding is that a very low undetected error probability can be achieved without increasing significantly the complexity of decoding. Several ARQ sequential decoding algorithms based on the stack algorithm are considered. Analysis is done for a memoryless channel with noiseless feedback, and the emphasis is on evaluating the undetected error probability and t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the shape and duration of FM-clicks

    Publication Year: 1983, Page(s):536 - 543
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1055 KB)

    The stochastic behavior of FM-clicks in an unmodulated carrier plus noise is studied in terms of the conditional behavior of stationary Gaussian processes after level crossings. By a systematic use of thc Slepian model processes it is shown that the normalized shape of a positive FM-click approaches a certain rational function with simple random coefficients as the carrier-to-noise ratio tends to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear estimation of PSK-modulated carrier phase with application to burst digital transmission

    Publication Year: 1983, Page(s):543 - 551
    Cited by:  Papers (583)  |  Patents (113)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    Burst transmission of digital data and voice has become commonplace, particularly in satellite communication systems employing time-division multiple-access (TI)MA) and packet demand-assignment multiple-access (DAMA) techniques. In TDMA systems particularly, phase estimation on each successive burst is a requirement, while bit timing and carrier frequency can be accurately tracked between bursts. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the shape of a set of points in the plane

    Publication Year: 1983, Page(s):551 - 559
    Cited by:  Papers (489)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1458 KB)

    A generalization of the convex hull of a finite set of points in the plane is introduced and analyzed. This generalization leads to a family of straight-line graphs, "<tex>\alpha</tex>-shapes," which seem to capture the intuitive notions of "fine shape" and "crude shape" of point sets. It is shown that a-shapes are subgraphs of the closest point or furthest point Delaunay triangulation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SECT---A coding technique for black/white graphics

    Publication Year: 1983, Page(s):559 - 570
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1781 KB)

    A new coding technique called SECT for digitized two-tone or black/white pictures which is particularly applicable to polygonal objects composed of horizontal, vertical, and diagonal lines such as logical circuit patterns, characteristic font patterns, and mechanical drawings is described. While many previously proposed coding techniques attempt to encode the positions of transitive elements in a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional spherical coordinates quantization

    Publication Year: 1983, Page(s):570 - 576
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1017 KB)

    Several investigators have considered polar coordinates quantization of a circularly symmetric source; in particular, the independent bivariate Gaussian source. Their schemes quantize the polar coordinates independently in an attempt to reduce the mean-square error below that of an analogous rectangular coordinates quantizer yet retain an implementation simpler than that of the optimal bivariate q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust noiseless source coding through a game theoretical approach

    Publication Year: 1983, Page(s):576 - 583
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1210 KB)

    Noiseless coding of a discrete source with partially known statistics is formulated as a two-person game. The payoff is the average codeword length, using Shannon codes. The code designer picks a source probability distribution for the design of the code, while an opponent picks the actual source probability distribution. It is shown that if the class of probability distributions allowed is convex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new structured design method for convolutions over finite fields, Part I

    Publication Year: 1983, Page(s):583 - 595
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1929 KB)

    The structure of bilinear cyclic convolution algorithms is explored over finite fields. The algorithms derived are valid for any length not divisible by the field characteristic and are based upon the small length polynomial multiplication algorithms. The multiplicative complexity of these algorithms is small and depends on the field of constants. The linear transformation matrices<tex>A, B&... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group codes for the<tex>M</tex>-receiver Gaussian broadcast channel (Corresp.)

    Publication Year: 1983, Page(s):595 - 597
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    The<tex>M</tex>-receiver Gaussian broadcast channel is a communication system in which a single codeword is transmitted over<tex>M</tex>distinct Gaussian channels and is received by<tex>M</tex>receivers. The receivers have no contact with each other and the channels have different signal-to-noise ratios. The purpose of this correspondence is to define the concep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ternary sequences with perfect periodic autocorrelation (Corresp.)

    Publication Year: 1983, Page(s):597 - 600
    Cited by:  Papers (46)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    We construct<tex>0, \pm 1</tex>sequences of length<tex>(q^{2l+1}-l)/(q-1)</tex>, where<tex>q=2^{s}</tex>, with out-of-phase periodic autocorrelation<tex>0</tex>, and in-phase correlation<tex>q^{2l};</tex>SUch that the peak factor of radiation is<tex>(q^{2l+1}-1) /(q^{2+l}-q^{2l})</tex>, which is close to<tex>1</tex>... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A low-rate bound for asymmetric error-correcting codes (Corresp.)

    Publication Year: 1983, Page(s):600 - 602
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (489 KB)

    We prove a Plotkin-type bound for binary codes which correct asymmetric errors. This bound shows that it is possible to correct as many as<tex>1/3</tex>asymmetric errors per code symbol, and no more. The result is obtained by estimating the solution of a linear program. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the characteristics of PN sequences (Corresp.)

    Publication Year: 1983, Page(s): 600
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (135 KB)

    Balanced binary sequences of period<tex>2^{n}-1</tex>with the run property and the two-level autocorrelation property are not necessarily PN sequences. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Outer bounds on the capacity of interference channels (Corresp.)

    Publication Year: 1983, Page(s):602 - 606
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (857 KB)

    New outer bounds are demonstrated for the capacity regions of discrete memoryless interference channels and Gaussian interference channels. The bound for discrete channels coincides with the capacity region in special cases. The bound for Gaussian channels improves previous knowledge when the interference is of medium strength. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trellis coding for a multiple-access channel (Corresp.)

    Publication Year: 1983, Page(s):606 - 611
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    A general trellis coding scheme has been described previously for error control of<tex>L</tex>simultaneous users of a discrete memoryless multiple-access channel. A new random coding performance bound for this trellis coding is given in an algebraic form. Since this bound lacks ease of computation, a transfer function bound is derived as a more tractable alternative. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The discriminant analysis of multivariate time series (Corresp.)

    Publication Year: 1983, Page(s):612 - 614
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (435 KB)

    Discrimination among multivariate autoregressive processes by Bayes' method is described. The determination of the true order of the multivariate autoregressive equation is also investigated; the estimator of the true order is obtained by minimizing the posterior risk. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Wiener filters for random signals in correlated noise (Corresp.)

    Publication Year: 1983, Page(s):614 - 619
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1017 KB)

    Minimax robust Wiener filtering is considered for the case in which the signal and noise spectral-density matrix is not completely specified. Results are obtained for spectral-density matrix classes which are defined by upper and lower bounds on the components of the matrix. These results form an extension of earlier results on robust Wiener filtering for the case of uncorrelated signals and noise... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple suboptimum estimator of prior probability in mixtures (Corresp.)

    Publication Year: 1983, Page(s):619 - 621
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (442 KB)

    A simple relative frequency type estimator of the prior probability in a mixture of two known density functions is presented. Examples are given demonstrating the ease of design and implementation of this estimator structure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic reliability functions for failure rates derived from Gauss - Markov processes (Corresp.)

    Publication Year: 1983, Page(s):621 - 624
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (646 KB)

    An extension of the well-known Cameron-Martin formula can be interpreted as the expectation of a stochastic reliability function applicable in those situations where nondecreasing failure rates are desired. This follows ff the failure rate is modeled as the square of a Gauss-Markov process. We describe the methodology for the general vector case, and then specialize the results to the one-dimensio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient distributed orientation algorithm (Corresp.)

    Publication Year: 1983, Page(s):624 - 629
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (997 KB)

    An algorithm for constructing and maintaining full information on the structure of a communication network is presented. The algorithm uses distributed computation. It can be used as an information-gathering step, to be followed by special-purpose algorithms which are to be executed within the nodes, without any additional communication. The load of the lines of the network is measured and shown t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to 'Estimation and choice of Neighbors in Spatial-Interaction Models of Images'

    Publication Year: 1983, Page(s): 629
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of 'Introduction to the Theory of Error-Correcting codes' (Pless, V.; 1982)

    Publication Year: 1983, Page(s): 630
    Request permission for commercial reuse | PDF file iconPDF (126 KB)
    Freely Available from IEEE

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