By Topic

IEEE Transactions on Information Theory

Issue 4 • Date July 1986

Filter Results

Displaying Results 1 - 19 of 19
  • Comments, with reply, on "ARMA spectral estimation of time series with missing observations" by B. Porat and B. Friedlander

    Publication Year: 1986, Page(s):601 - 602
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (255 KB)

    A variant to a recently proposed autoregressive moving average (ARMA) spectrum estimation technique for time series with gapped data is suggested. It is based on the partial fraction expansion of the power spectrum and exhibits some computational and operational advantages. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hypothesis testing with communication constraints

    Publication Year: 1986, Page(s):533 - 542
    Cited by:  Papers (60)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1384 KB)

    A new class of statistical problems is introduced, involving the presence of communication constraints on remotely collected data. Bivariate hypothesis testing, H_{0}: P_{XY} against H_{1}: P_{={XY}} , is considered when the statistician has direct access to Y data but can be inform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An iterative code construction and codes generated by permutations for the asymmetric multiple-access channel (Corresp.)

    Publication Year: 1986, Page(s):607 - 612
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1496 KB)

    It is shown that for an asymmetric multiple-access channel, it is possible, starting with one codeword at each of the encoders, to add the codewords for one message at a time (first for the elements in the set of private messages and thereafter for the messages in the set of common messages) and to construct this way, iteratively, a code for this channel with the average error probability upper-bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Gaussian Nonlinearity's Output Power Spectral Density Due to a Sinusoid Plus Band-Limited Noise

    Publication Year: 1986, Page(s):597 - 601
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    A sinusoid accompanied by stationary, additive, nonzero-mean, band-limited, white Gaussian noise is passed through a Gaussian nonlinear characteristic, and the output power spectral density is evaluated by using known results due to Rice and Atherton. Several characteristics of the Gaussian nonlinearity are revealed in the process, and input tuning is shown to contribute to output noise reduction.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ungerboeck codes do not shape the signal power spectrum (Corresp.)

    Publication Year: 1986, Page(s):595 - 596
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    Simple sufficient conditions are found for the spectrum of Ungerboeck-coded signals to be equal to the spectrum of uncoded signals. It is shown that a carefully designed Ungerboeck code does not shape the spectrum. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distribution of the filtered output of a quadratic rectifier computed by numerical contour integration

    Publication Year: 1986, Page(s):450 - 463
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1496 KB)

    The cumulative distribution of the filtered output of a quadratic rectifier whose input is either narrow-band Gaussian noise or Gaussian noise with a low-pass spectral density is to be computed by numerical quadrature of a Laplace inversion integral along a contour in the complex plane chosen to economize the number of steps. The integrand contains the moment-generating function (mgf) of the outpu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterizing partition detectors with stationary and quasi-stationary Markov dependent data

    Publication Year: 1986, Page(s):471 - 482
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1672 KB)

    Multisensor data from sonar arrays are usually temporally and spatially dependent. In addition, in some environments the noise field in which the sonar system must operate is contaminated by impulsive and non-Gaussian interference. A natural way to include these effects is to formulate a statistic based upon the likelihood ratio. However, implementing a multisensor likelihood ratio statistic in it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of strings in the class of Markov sources

    Publication Year: 1986, Page(s):526 - 532
    Cited by:  Papers (93)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1096 KB)

    Shannon's self-information of a string is generalized to its complexity relative to the class of finite-state-machine (FSM) defined sources. Unlike an earlier generalization, the new one is valid for both short and long strings. The definition is justified in part by a theorem stating that, asymptotically, the mean complexity provides a tight lower bound for the mean length of all so-called regula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An achievable bound for optimal noiseless coding of a random variable (Corresp.)

    Publication Year: 1986, Page(s):592 - 594
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    For a discrete N -valued random variable ( N possibly denumerably infinite) Leung-Yan-Cheong and Cover have given bounds for the minimal expected length of a one-to-one (not necessarily uniquely decodable) code L_{1:1}=\sum _{i=1}^{N} p_{i} \log \left( frac{1}{2} + 1 \right). It is show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On multiple descriptions and team guessing

    Publication Year: 1986, Page(s):543 - 549
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    Witsenhausen's hyperbola bound for the multiple description problem without excess rate in case of a binary source is not tight for exact joint reproductions. However, this bound is tight for almost-exact joint reproductions (Theorem 1 , conjectured by Witsenhausen). The proof is based on an {em approximative} form of the team guessing lemma for {em sequences... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for complex approximations in Z[e^{2{\pi}i/8}] (Corresp.)

    Publication Year: 1986, Page(s):603 - 607
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    An algorithm is described that approximates complex numbers by elements of the algebraic integers of Z[e^{2 \pi i / 8}] with integer coordinates of at most a prescribed size. The motivating application is to reduce the dynamic range requirements of residue number system implementations of the discrete Fourier transform. The closest points to zero of View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extrapolating a band-limited function from its samples taken in a finite interval

    Publication Year: 1986, Page(s):464 - 470
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB)

    A band-limited signal of finite energy can be reconstructed from its samples taken at the Nyquist rate. Moreover, the reconstruction is stable, a feature crucial for implementation: a small error in the sample values generates only a correspondingly small error in the resulting signal. The Nyquist sample values are mutually independent, so that knowledge of them in a given interval View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Smoothing error dynamics and their use in the solution of smoothing and mapping problems

    Publication Year: 1986, Page(s):483 - 495
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1896 KB)

    Martingale decomposition techniques are used to derive Markovian models for the error in smoothed estimates of processes described by linear models driven by white noise. These models, together with some simple Hilbert space decomposition ideas, provide a simple unified framework for examining a variety of problems involving the efficient assimilation of spatial data, which we refer to as mapping ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust coding for multiple-access channels

    Publication Year: 1986, Page(s):550 - 560
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1720 KB)

    The problem of minimax robust coding for classes of multiple-access channels with uncertainty in their statistical description is addressed. We consider 1) discrete memoryless multiple-access channels with uncertainty in the probability transition matrices and 2) discrete-time stationary additive Gaussian multiple-access... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of a delayed delta modulator

    Publication Year: 1986, Page(s):496 - 512
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2136 KB)

    While delta modulation (DM) simply compares the current predictive estimate of the input with the current sample, delayed delta modulation (DDM) also compares with the upcoming sample so as to detect and anticipate slope overloading. Since this future sample must be available before the present output is determined and the estimate updated, delay is introduced at the encoding. The performance of D... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding the Golay codes

    Publication Year: 1986, Page(s):561 - 567
    Cited by:  Papers (37)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB)

    We introduce exceptionally simple decoding algorithms for the two extended Golay codes. The algorithms are based on recent methods of Conway and Curtis of finding the unique blocks containing five points in either the (5,8,24) Steiner system or the (5,6,12) Steiner system. These decoding methods are simple enough to enab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of information extraction

    Publication Year: 1986, Page(s):513 - 525
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2312 KB)

    How difficult are decision problems based on natural data, such as pattern recognition? To answer this question, decision problems are characterized by introducing four measures defined on a Boolean function f of N variables: the implementation cost C(f) , the randomness View full abstract»

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

    Publication Year: 1986, Page(s):568 - 583
    Cited by:  Papers (170)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1784 KB)

    The geometric properties of a memoryless Laplacian source are presented and used to establish a source coding theorem. Motivated by this geometric structure, a pyramid vector quantizer (PVQ) is developed for arbitrary vector dimension. The PVQ is based on the cubic lattice points that lie on the surface of an L -dimensional pyramid and has simple encoding and d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A continuous polling system with constant service times

    Publication Year: 1986, Page(s):584 - 591
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1080 KB)

    A server moves at a constant rate around a closed tour, stopping to perform services wherever requests are encountered. Requests appear according to a Poisson process at locations independently and uniformly distributed over the tour, and the service times are all taken to be one unit. Discrete versions of this model have applications ranging from machine repair to computer/communication polling s... View full abstract»

    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
Frank R. Kschischang

Department of Electrical and Computer Engineering