By Topic

Information Theory, IEEE Transactions on

Issue 4 • Date July 1972

Filter Results

Displaying Results 1 - 25 of 27
  • Correction to 'Two-Dimensional Discrete Markovian Fields'

    Publication Year: 1972 , Page(s): 541
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (107 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.
  • Review of 'Detection, Estimation, and Modulation Theory, Part III--Radar-Sonar Signal Processing and Gaussian Signals in Noise' (Van Trees, H. L.; 1971)

    Publication Year: 1972 , Page(s): 542
    Save to Project icon | Request Permissions | PDF file iconPDF (155 KB)  
    Freely Available from IEEE
  • Algorithms for tree source coding with a fidelity criterion (Ph.D. Thesis abstr.)

    Publication Year: 1972 , Page(s): 543
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (161 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.
  • The design of wideband radar and sonar systems for clutter suppression (Ph.D. Thesis abstr.)

    Publication Year: 1972 , Page(s): 543
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (161 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.
  • Mean-square performance bounds for almost-linear systems (D.Sc. Thesis abstr.)

    Publication Year: 1972 , Page(s): 543
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (161 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.
  • Structure and performance of optimum photocounting array receivers for the atmospheric optical communications channel (Eng.Sc.D. Thesis abstr.)

    Publication Year: 1972 , Page(s): 544
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (146 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.
  • New binary codes

    Publication Year: 1972 , Page(s): 503 - 510
    Cited by:  Papers (38)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1224 KB)  

    In this paper constructions are given for combining two, three, or four codes to obtain new codes. The Andryanov-Saskovets construction is generalized. It is shown that the Preparata double-error-correcting codes may be extended by about (block length) ^{1/2} symbols, of which only one is a check symbol, and that e -error-correcting BCH codes may sometimes be extended by (block !ength) ^{1/e} symbols, of which only one is a check symbol. Several new families of linear and nonlinear double-error-correcting codes are obtained. Finally, an infinite family of linear codes is given with d/n = frac{1}{3} , the first three being the (24,2^12, 8) Golay code, a (48,2^15, 16) code, and a (96,2^18, 32) code. Most of the codes given have more codewords than any comparable code previously known to us. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Note on majority-logic decoding of finite geometry codes (Corresp.)

    Publication Year: 1972 , Page(s): 539 - 541
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (432 KB)  

    In a recent paper [1], techniques for reducing the number of majority-logic decoding steps for finite geometry codes have been proposed. However, the lower bound of [1, lemma 4] is incorrect; finite geometry codes, in general, cannot be decoded in less than or equal to three steps of orthogonalization, as was claimed. This correspondence presents a decoding procedure for finite geometry codes that requires as few decoding steps as possible. It is shown that the minimum number of steps is a logarithmic function of the dimension of the associated geometry. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrete-time demodulation of continuous-time signals

    Publication Year: 1972 , Page(s): 488 - 493
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (832 KB)  

    Nonlinear stochastic estimation theory is applied to the problem of obtaining discrete-time demodulator structures for the common types of analog communication signals. A stochastic communication model is presented that can be treated with current results in estimation theory. Approximate algorithms are developed for the estimation problem that yield mathematically realizable receiver structures for the cases of AM, PM, and FM. The digital receivers yield performance characteristics that compare favorably with those of their analog counterparts. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of channel capacity and rate-distortion functions

    Publication Year: 1972 , Page(s): 460 - 473
    Cited by:  Papers (294)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1176 KB)  

    By defining mutual information as a maximum over an appropriate space, channel capacities can be defined as double maxima and rate-distortion functions as double minima. This approach yields valuable new insights regarding the computation of channel capacities and rate-distortion functions. In particular, it suggests a simple algorithm for computing channel capacity that consists of a mapping from the set of channel input probability vectors into itself such that the sequence of probability vectors generated by successive applications of the mapping converges to the vector that achieves the capacity of the given channel. Analogous algorithms then are provided for computing rate-distortion functions and constrained channel capacities. The algorithms apply both to discrete and to continuous alphabet channels or sources. In addition, a formalization of the theory of channel capacity in the presence of constraints is included. Among the examples is the calculation of close upper and lower bounds to the rate-distortion function of a binary symmetric Markov source. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effects of randomization on finite-memory decision schemes

    Publication Year: 1972 , Page(s): 499 - 502
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (528 KB)  

    This paper is concerned with the differences between deterministic and randomized finite-memory decision rules. It is shown that for any hypothesis-testing problem there exists a b < \infty such that, for any B , the optimal deterministic rule with B + b bits in memory has a lower error probability than the optimal randomized rule with B bits in memory. Suboptimal deterministic rules with this property are demonstrated. These deterministic rules lose at most b bits. Thus for large memories the fraction of memory, measured in bits, lost by deterministic rules is negligible. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Periodically pulsed sine wave detected with provision for increasing noise

    Publication Year: 1972 , Page(s): 493 - 498
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (840 KB)  

    The detection problem arises due to the false-alarm vulnerability of remote unmanned, signal detectors, typical in current wildlife-tracking studies. Some rather old theory is modified to overcome the effects of transient noise sources such as automobile engines or lightning. The resulting equipment is a simple up-down counter, tending to advance in the presence of large signal-to-noise ratio (SNR) and down-count otherwise. Probability of error for various situations is derived, wherein it is shown that false-alarm probability will be upper bounded and then decrease as noise increases above its quiescent level. The cost of the noise protection in terms of probabilities of error versus SNR is indicated by an example. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Minimum Average Probability of Error Expression for a Binary Pulse-Communication System With Intersymbol Interference

    Publication Year: 1972 , Page(s): 528 - 531
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (536 KB)  

    Results useful in the calculation of the exact closed-form expression for the minimum average probability of error P_e of a binary pulse linear communication system with 2N intersymbol interferences and additive colored Gaussian noise are given. By first performing statistical averaging and then using the variational method, a compact form of P_e that depends only on the overall system impulse response taken over N time instants is obtained. These N unknowns are given as the solution of N simultaneous nonlinear equations. Specific examples illustrating this approach are considered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding theorem and its converse for continuous incrementally stationary channels with finite incremental memory (Corresp.)

    Publication Year: 1972 , Page(s): 510 - 513
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (696 KB)  

    We define continuous incrementally stationary channels with finite incremental input- and output-memories and prove the coding theorem and its converse for such channels. These channels include, as special cases, stationary channels with finite input- and output-memories and incrementally stationary and memoryless channels. The former is defined here and the latter has been defined previously. It is emphasized that, with an elementary measure-theoretic formulation, the standard method of proving the coding theorem for discrete channels becomes directly applicable for continuous channels. Consequently, the tedious step of representing a continuous channel by an infinite series of discrete channels can be avoided entirely. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new initial-value method for on-line filtering and estimation (Corresp.)

    Publication Year: 1972 , Page(s): 515 - 518
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (560 KB)  

    Utilizing the theory of invariant imbedding, a Cauchy system suitable for real-time calculation is presented for the solution of the basic Fredholm integral equation of linear least squares filtering theory when the signal process is stationary. Extensions are also mentioned for more general nonstationary processes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A stochastic model for burst-correcting convolutional decoders (Corresp.)

    Publication Year: 1972 , Page(s): 532 - 535
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (576 KB)  

    A stochastic model is described for the decoder of an optimal burst-correcting convolutional code. From this model, an upper bound is obtained for \bar{p} , the error probability per word after decoding. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probing signal design for linear channel identification

    Publication Year: 1972 , Page(s): 481 - 487
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1104 KB)  

    This paper deals with the problem of selecting optimum probing signals for identifying multiple-input multiple-output time-varying linear M -ary channels in the presence of colored Gaussian noise. Unequal emission and observation intervals are considered and necessary and sufficient conditions for nonsingular identification are established. Hilbert-space methods are used for unifying many seemingly different problems in a single framework. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new proof of the BCH bound (Corresp.)

    Publication Year: 1972 , Page(s): 541
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (120 KB)  

    A new proof has been found to establish the BCH bound, which relates the minimum distance of a cyclic code to the number of consecutive roots its generator polynomial possesses in a certain field. This new proof is recursive in nature and is very simple in structure. It makes no use of the Van der Monde determinant while it unifies the concepts of distance, estimation, and decoding. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the identifiability of finite mixtures of Laguerre distributions (Corresp.)

    Publication Year: 1972 , Page(s): 514 - 515
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (280 KB)  

    Finite mixtures of Laguerre distribution are identifiable. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polyphase codes with good periodic correlation properties (Corresp.)

    Publication Year: 1972 , Page(s): 531 - 532
    Cited by:  Papers (468)  |  Patents (61)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (264 KB)  

    This correspondence describes the construction of complex codes of the form exp i \alpha _k whose discrete circular autocorrelations are zero for all nonzero lags. There is no restriction on code lengths. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orthogonal functionals of the Poisson process

    Publication Year: 1972 , Page(s): 473 - 481
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1264 KB)  

    In analogy to the orthogonal functionals of the Brownian-motion process developed by Wiener, ltô, and others, a theory of the orthogonal functionals of the Poisson process is presented making use of the concept of multivariate orthogonal polynomials. Following a brief discussion of Charlier polynomials of a single variable, multivariate Charlier polynomials are introduced. An explicit representation as well as an orthogonality property are given. A multiple stochastic integral of a multivariate function with respect to the Poisson process, called the multiple Poisson-Wiener integral, is defined using the multivariate Charlier polynomials. A multiple Poisson-Wiener integral, which gives a polynomial functional of the Poisson process, is orthogonal to any other of different degree. Several explicit forms are given for the sake of application. It is shown that any nonlinear functional of the Poisson process with finite variance can be developed in terms of these orthogonal functionals, corresponding to the Cameron-Martin theorem in the case of the Brownian-motion process. Finally, some possible applications to nonlinear problems associated with the Poisson process are briefly discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on conditional moments of random signals in Gaussian noise (Corresp.)

    Publication Year: 1972 , Page(s): 513 - 514
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (312 KB)  

    This correspondence generalizes some recent results on relations between minimum-variance estimates of random signals in Gaussian noise and likelihood ratios. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic approximation with a nonstationary regression function (Corresp.)

    Publication Year: 1972 , Page(s): 518 - 519
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (296 KB)  

    This correspondence is concerned with a stochastic approximation algorithm having a nonstationary regression function. Convergence conditions and a mean-square error bound are presented. Its possible application to feedback communication is discussed briefly. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error rate of phase-shift keying in the presence of discrete multipath interference (Corresp.)

    Publication Year: 1972 , Page(s): 525 - 528
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (560 KB)  

    Several expressions are derived for the probability of error of a binary coherent phase-shift keyed communication system in the presence of interference due to discrete multipath propagation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bound on lightweight sequences with application to definite decoding (Corresp.)

    Publication Year: 1972 , Page(s): 535 - 539
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (696 KB)  

    It is shown that the number M of binary-valued n -tuples having fractional weight \delta or less, 0 < \delta \leq frac{1}{3} , such that no two n -tuples agree in any L consecutive positions, is bounded by 2^{2LH(\delta )+1} . A set of n -tuples is constructed to show that this bound is not likely to be improved upon by any significant factor. This bound is used to show that the ratio d_{DD}/n_{DD} of definite-decoding minimum distance to definite-decoding constraint length is lower bounded by H^{-l}[frac{1}{6} \cdot (1 - R)/ (1+R)] as n_{DD} grows without bound. 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