IEEE Transactions on Information Theory

Volume 19 Issue 2 • March 1973

Filter Results

Displaying Results 1 - 25 of 31
  • Information theory in the fifties

    Publication Year: 1973, Page(s):145 - 148
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (726 KB)

    A short personal account of some of the developments in Shannon-type information theory from 1950 to 1960. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory and application of some classical and generalized asymptotic distributions of extreme values

    Publication Year: 1973, Page(s):148 - 154
    Cited by:  Papers (30)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (615 KB)

    An introduction is provided to the classical theory of asymptotic distributions of extreme values and to its application to estimation of tail probabilities. It is shown how the theory is sometimes misinterpreted to justify heuristic estimation procedures that introduce systematic error. A new generalized asymptotically convergent sequence of extreme-value distributions, differing from the classic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transient analysis of phase-locked tracking systems in the presence of noise

    Publication Year: 1973, Page(s):155 - 165
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1157 KB)

    This paper is concerned with the problem Of obtaining time-dependent solutions to a class of Fokker-Planck equations that arise in the analysis and synthesis of a variety of first-order synchronization systems employing the phase-lock principle. These include the classical sinusoidal phase-locked loop, squaring and Costas loops, data-aided loops, hybrid loops, various symbol synchronizer mechaniza... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A sequence solution to the Fokker-Planck equation

    Publication Year: 1973, Page(s):165 - 176
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1491 KB)

    In this paper a new approach to nonlinear system analysis based on the Fokker-Planck equation is developed. The development begins as a modification of the parametrix method of partial differential equation theory and provides a sequence solution to the multidimensional time-varying Fokker-Planck equation. This sequence is simplified for the case where only a steady-state solution or a solution fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical properties of two sine waves in Gaussian noise

    Publication Year: 1973, Page(s):176 - 183
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1106 KB)

    A detailed study is presented of some statistical properties of the stochastic process, that consists of the sum of two sine waves of unknown relative phase and a normal process. Since none of the statistics investigated seem to yield a closed-form expression, all the derivations are cast in a form that is particularly suitable for machine computation. Specifically, results are presented for the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An extension of Szasz's theorem and its application

    Publication Year: 1973, Page(s):184 - 187
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (535 KB)

    A classical result in signal theory is the completeness of the exponentials<tex>\{ e^{-\mu_n x} \}</tex>in<tex>L_2</tex>, the so-called Szasz's theorem. This paper generalizes Szasz's theorem by constructing broad classes of functions<tex>g(x)</tex>such that the set of functions<tex>\{g(\mu_n x)\}</tex>is complete in<tex>L_2</tex>. Applic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal demodulation of PAM signals

    Publication Year: 1973, Page(s):188 - 196
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (913 KB)

    Kalman filtering theory is applied to yield an optimal causal demodulator for pulse-amplitude-modulated (PAM) signals in the presence of white Gaussian noise. The discrete-time data (or sampled continuous-time data) are assumed to be either a stationary or non-stationary Gaussian stochastic process, in general nonwhite. Optimal demodulation with delay is also achieved by application of Kalman filt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random coding theorem for broadcast channels with degraded components

    Publication Year: 1973, Page(s):197 - 207
    Cited by:  Papers (291)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1342 KB)

    This paper generalizes Cover's results on broadcast channels with two binary symmetric channels (BSC) to the class of degraded channels with<tex>N</tex>components. A random code, and its associated decoding scheme, is shown to have expected probability of error going to zero for all components simultaneously as the codeword length goes to infinity, if the point representing the rates t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for optimal prefix parsing of a noiseless and memoryless channel

    Publication Year: 1973, Page(s):208 - 214
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (893 KB)

    We discuss the prefix encoding of a<tex>Q</tex>-ary source<tex>(Q \geq 2)</tex>into an<tex>L</tex>-symbol channel alphabet with<tex>L \geq Q</tex>. We present an optimal encoding scheme that minimizes the expected cost per symbol in the case of equally probable source symbols and arbitrary channel symbol costs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Commutative group codes for the Gaussian channel

    Publication Year: 1973, Page(s):215 - 219
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (609 KB)

    A class of codes for the Gaussian channel is analyzed. The code class is a subclass of the group codes for the Gaussian channel described by Slepian. Using the vector model for the Gaussian channel, the code vectors are obtained by transformations of an initial vector. The class of codes in which the transformations form a commutative group is called the class of commutative group codes. The perfo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New convolutional code constructions and a class of asymptotically good time-varying codes

    Publication Year: 1973, Page(s):220 - 225
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (870 KB)

    We show that the generator polynomials of certain cyclic codes define noncatastrophic fixed convolutional codes whose free distances are lowerbounded by the minimum distances of the cyclic codes. This result is used to construct convolutioual codes with free distance equal to the constraint length and to derive convolutional codes with good free distances from the BCH codes. Finally, a class of ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time, frequency, sequency, and their uncertainty relations (Corresp.)

    Publication Year: 1973, Page(s):225 - 229
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (745 KB)

    We study the form assumed by the classical time-frequency uncertainty relations in discrete as well as nontrigonometric spectral analysis. In particular we find that if an<tex>N</tex>-sample time signal is to contain a fraction<tex>\gamma</tex>of its energy in<tex>T</tex>consecutive samples, then the minimum number of frequency components containing that same en... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On coding and filtering stationary signals by discrete Fourier transforms (Corresp.)

    Publication Year: 1973, Page(s):229 - 232
    Cited by:  Papers (72)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    This correspondence concerns real-time Fourier processing of stationary data and examines the widespread belief that coefficients of the discrete Fourier transform (DFT) are "almost" uncorrelated. We first show that any uniformly boundedN \times NToeplitz covariance matrixT_Nis asymptotically equivalent to a nonstandard circulant matrixC_Nderived from the DFT of View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Notes on maximum-entropy processing (Corresp.)

    Publication Year: 1973, Page(s):232 - 234
    Cited by:  Papers (67)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (435 KB)

    Maximum-entropy processing is a method for computing the power density spectrum from the first<tex>N</tex>lags of the autocorrelation function. Unlike the discrete Fourier transform, maximum-entropy processing does not assume that the other lag values are zero. Instead, one mathematically ensures that the fewest possible assumptions about unmeasured data are made by choosing the spectr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary decisions with stochastic inputs (Corresp.)

    Publication Year: 1973, Page(s):234 - 235
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (297 KB)

    Upper and lower bounds on the mean error rate for binary decisions are obtained in the case where the amplitude of the signal varies during the symbol period and is a stationary process. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approximation for the distribution of shot noise (Corresp.)

    Publication Year: 1973, Page(s):235 - 237
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (405 KB)

    If a shot noise distribution is conditioned on the number of Poisson events before it is expanded in Edgeworth's series, the resulting approximation may be more accurate than the usual direct expansion. We investigate the error of such an approximation, both asymptotically and for a particular example, and give an application to laser communication. We also give a general recurrence relation for d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Empirical Bayes approach to<tex>M</tex>-ary detection (Corresp.)

    Publication Year: 1973, Page(s):237 - 239
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    An empirical Bayes procedure is introduced for<tex>M</tex>-ary detection in a statistically undefined noise background. The Bayes decision rule, which depends on a set of nuisance parameters, is formed first from sample qualitative information so that the requirement of known noise distribution can be relaxed. The rule is then approximated by estimating the nuisance parameters. The res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constrained minimax estimate of a normal mean (Corresp.)

    Publication Year: 1973, Page(s): 239
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    For Bayes estimation of a normal mean, if prior mean and prior covariance are known, a minimax estimate is obtainable by assuming the prior distribution to be normal. The minimax is constrained by the given prior mean and covariance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The structure of least-mean-square linear estimators for synchronous<tex>M</tex>-ary signals (Corresp.)

    Publication Year: 1973, Page(s):240 - 243
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (571 KB)

    Several authors have shown that the structure of the least-mean-square linear estimator of the sequence of random amplitudes in a synchronous pulse-amplitude-modulated signal that suffers intersymbol interference and additive noise is a matched filter whose output is periodically sampled and passed through a transversal filter (tapped delay line). It is our purpose in this paper to generalize this... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "On the distance criterion of Patrick and Fischer" [Corresp.] by Chitti, Babu C.

    Publication Year: 1973, Page(s): 240
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (107 KB)

    A recent paper by Babu [I] presents an upper bound on the probability of misrecognition in terms of Patrick and Fischer's measure of distance. An error in the derivation of Babu's bound is pointed out and a counterexample is presented. At the end, a proper bound on the probability of error in terms of Patrick and Fischer's measure of distance is presented with an example. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Polyphase codes with good periodic correlation properties" by Chu, David C.

    Publication Year: 1973, Page(s): 244
    Cited by:  Papers (58)
    Request permission for commercial reuse | PDF file iconPDF (141 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The random coding bound is tight for the average code (Corresp.)

    Publication Year: 1973, Page(s):244 - 246
    Cited by:  Papers (64)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (467 KB)

    The random coding bound of information theory provides a well-known upper bound to the probability of decoding error for the best code of a given rate and block length. The bound is constructed by upper-bounding the average error probability over an ensemble of codes. The bound is known to give the correct exponential dependence of error probability on block length for transmission rates above the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relationship between LMS compensators for intersymbol interference in linear and nonlinear modulation schemes (Corresp.)

    Publication Year: 1973, Page(s): 244
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (141 KB)

    Previous results on intersymbol interference in multichannel linear modulation schemes can be applied to nonlinear modulation. These are compared with new results specifically developed for the nonlinear case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on burst-error correction using the check polynomial (Corresp.)

    Publication Year: 1973, Page(s):246 - 250
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (754 KB)

    When decoding a cyclic code, an alternative to computing the syndrome by dividing the received<tex>n</tex>-tuple<tex>W(x)</tex>by the generator polynomial<tex>G(x)</tex>is to compute the product<tex>H(x)W(x)</tex>, mod<tex>x^n - 1</tex>, with the check polynomial<tex>H(x)</tex>. It is shown in this paper that the form of the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some optimal type-B1 convolutional codes (Corresp.)

    Publication Year: 1973, Page(s):250 - 251
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    Rate<tex>\frac{3}{4}</tex>optimal type-<tex>B1</tex>burst-error-correcting convolutional codes have been discovered. Optimal codes of rate<tex>1/n_o</tex>and<tex>\frac{2}{3}</tex>are also given. A method of decoding is described. 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
Alexander Barg

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

email: abarg-ittrans@ece.umd.edu