IEEE Transactions on Information Theory

Volume 21 Issue 3 • May 1975

Filter Results

Displaying Results 1 - 25 of 26
  • Editorial

    Publication Year: 1975, Page(s): 249
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (76 KB)
    Freely Available from IEEE
  • Some properties and examples of random processes that are almost wide sense stationary

    Publication Year: 1975, Page(s):257 - 262
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    A wide sense stationary (WSS) processX(t), t in I, has shift operatorsT_h: X(t) rightarrow X(t + h), h in I, which are unitary operators in the Hilbert spaceH(X)generated in the usual way byX(t). We study the class of uniformly hounded linearly stationary (UBLS) processes; This is the class of processes having shift operatorsT_hthat are linear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust estimation via stochastic approximation

    Publication Year: 1975, Page(s):263 - 271
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1369 KB)

    It has been found that robust estimation of parameters may be obtained via recursive Robbins-Monro-type stochastic approximation (SA) algorithms. For the simple problem of estimating location, appropriate choices for the nonlinear transformation and gain constant of the algorithm lead to an asymptotically min-max robust estimator with respect to a familymathcal{F} (y_p,p)of symmetrical ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized likelihood signal resolution

    Publication Year: 1975, Page(s):276 - 282
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1069 KB)

    This paper defines anM-ary generalized likelihood ratio test (MGLRT) that overcomes Root's early objection to the application of generalized likelihood ratio testing to the resolution of correlated signals. The proposed test extends the form of a conventional binary generalized likelihood ratio test (GLRT) in a manner that permits a generalization of the minimax properties of the binary... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • k-nearest-neighbor Bayes-risk estimation

    Publication Year: 1975, Page(s):285 - 293
    Cited by:  Papers (55)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1163 KB)

    Nonparametric estimation of the Bayes riskR^astusing ak-nearest-neighbor (k-NN) approach is investigated. Estimates of the conditional Bayes errorr(X)for use in an unclassified test sample approach to estimateR^astare derived using maximum-likelihood estimation techniques. By using the volume information as well as the class representations of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On source coding with side information at the decoder

    Publication Year: 1975, Page(s):294 - 300
    Cited by:  Papers (180)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (924 KB)

    Let{(X_k, Y_k, V_k)}_{k=1}^{infty}be a sequence of independent copies of the triple(X,Y,V)of discrete random variables. We consider the following source coding problem with a side information network. This network has three encoders numbered 0, 1, and 2, the inputs of which are the sequences{ V_k}, {X_k}, and{Y_k}, respectively. The output of encoder i i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst sources and robust codes for difference distortion measures

    Publication Year: 1975, Page(s):301 - 309
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1386 KB)

    It has long been known that for a mean-square error distortion measure the Gaussian distribution requires the largest rate of all sources of a given variance. It has also been stated that a code designed for the Gaussian source and yielding distortiondwhen used with a Gaussian source will yield distortionleq dwhen used with any independent-letter source of the same variance. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A direct proof of the coding theorem for discrete sources with memory

    Publication Year: 1975, Page(s):310 - 317
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1194 KB)

    In this paper we provide an alternate method of proving the existence theorem for the coding of discrete stationary ergodic sources subject to a fidelity constraint. This method differs from previously published proofs for sources with memory in that a random coding argument is obtained directly for the coding of sourcen-tuples. The main advantage of the technique employed in this paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author's reply to `A Note on the Use of Chandrasekhar Equations for the Calculation of the Kalman Gain Matrix'

    Publication Year: 1975, Page(s):336 - 337
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (335 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.
  • On the response of anRCfilter-hard limiter-RCfilter detector to nonzero-mean white Gaussian noise (Corresp.)

    Publication Year: 1975, Page(s):338 - 341
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (431 KB)

    A three-element detector, consisting of anRCfilter with time constant1/a, a hard limiter, and finally anRCfilter with time constant1/b, is considered. The detector is stimulated by a nonzero-mean white Gaussian noise input, and the system output is observed. A Markov assumption on the hard limiter output leads to a closed-form expression for the output d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Corollaries to the Huffman Coding Procedure

    Publication Year: 1975, Page(s):342 - 344
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (493 KB)

    For a given set ofNsymbols to be coded by a code of alphabet sizeD, the necessary and sufficient conditions for the optimality of a block code of lengthm, ifN = D^m, and the optimality of a code of words of length onlymandm + 1, ifD^m < N < D^{m+1}, are stated, and an example of the construction of such a code is gi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weight distributions of some classes of binary cyclic codes (Corresp.)

    Publication Year: 1975, Page(s):345 - 350
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (447 KB)

    Leth_1(x)h_2(x)be the parity-check polynomial of a binary cyclic code. This correspondence presents a formula for decomposing words in the code as sums of multiples of words in the codes whose parity-check polynomials areh_1(x)andh_2(x). This decomposition provides information about the weight distribution of the code. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to a proof in the coding literature (Corresp.)

    Publication Year: 1975, Page(s): 351
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (45 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 'Random Differential Equations in Science and Engineering' (Soong, T. T.; 1973)

    Publication Year: 1975, Page(s):352 - 353
    Request permission for commercial reuse | PDF file iconPDF (251 KB)
    Freely Available from IEEE
  • Review of 'Optical Information Processing and Holography' (Cathey, W. T.; 1974)

    Publication Year: 1975, Page(s): 352
    Request permission for commercial reuse | PDF file iconPDF (171 KB)
    Freely Available from IEEE
  • A unification of Cramér-Rao type bounds (Corresp.)

    Publication Year: 1975, Page(s):330 - 332
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    This correspondence examines multiparameter generalizations of the Cramér-Rao (C-R) bound and related bounds from a new viewpoint. We derive a general class of bounds and show that Rao's generalization is the tightest (bes0 of the class. A bound reported by Zacks is another member of the class. This derivation of the C-R bound emphasizes its optimum nature. The relationship of the general cla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on the use of Chandrasekhar equations for the calculation of the Kalman gain matrix (Corresp.)

    Publication Year: 1975, Page(s):334 - 336
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    This correspondence discusses some possible limitations on the application of a new algorithm for recursive linear estimation. An algorithm proposed by Kailath using Chandrasekhar equations to calculate the Kalman gain matrix has been shown to be computationally advantageous in some special cases. This correspondence considers the case of controllable and observable linear systems and shows that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Fourier coefficients for the phase-shift keyed phase density function (Corresp.)

    Publication Year: 1975, Page(s):337 - 338
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    A closed-form expression is derived for the Fourier coefficients in the series expansion of the phase-shift keyed (PSK) receiver output phase probability density function. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum-mean-square-error estimation of photon pulse delay (Corresp.)

    Publication Year: 1975, Page(s):326 - 330
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    The minimum-mean-square-error (rose) estimation of the delay of a coherent pulse of photons by a direct-detection receiver is shown to depend on the shape of the pulse envelope. Whereas with smooth envelopes the minimum mse decreases only as the expected energy in the pulse, with sharp-edged envelopes it decreases as its square, provided the optimum estimator is used. Occurrence of photoelectrons ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrete optimal linear smoothing for systems with uncertain observations

    Publication Year: 1975, Page(s):271 - 275
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    The smoothing filter and smoothing error covariance matrix equations are developed for discrete linear systems whose observations may contain noise alone, where only the probability of occurrence of such cases is known to the estimator. An example of such a system arises in trajectory tracking, where the signal is first detected and then is processed by the estimator for tracking purposes. The res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cepstrum discrimination function (Corresp.)

    Publication Year: 1975, Page(s):332 - 334
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    An expression is derived for the function that governs the discrimination by the power cepstrum against components at large time delays. The function has been found to be useful in normalizing cepstrum displays. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noncoherent detection of periodic signals

    Publication Year: 1975, Page(s):282 - 285
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    In this paper the optimal Bayes detector for a general periodic waveform having uniform delay and additive white Gaussian noise is examined. It is shown that the detector is much more complex than that for the we!l-known cases of pure sine waves (i.e., classical noncoherent detection)and narrow-hand signals. An interpretation of the optimal processor is presented, and several implementations are d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of a linguistic statistical decoder for the recognition of continuous speech

    Publication Year: 1975, Page(s):250 - 256
    Cited by:  Papers (92)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1200 KB)

    Most current attempts at automatic speech recognition are formulated in an artificial intelligence framework. In this paper we approach the problem from an information-theoretic point of view. We describe the overall structure of a linguistic statistical decoder (LSD) for the recognition of continuous speech. The input to the decoder is a string of phonetic symbols estimated by an acoustic process... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bootstrap trellis decoding

    Publication Year: 1975, Page(s):318 - 325
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB)

    A new hybrid coding scheme is introduced that bears the same relation to Viterbi decoding as bootstrap hybrid decoding [3] bears to sequential decoding. Bounds on the probability of error are developed and evaluated for some examples. In high-rate regions of interest, the computed exponents are more than three times as large as those for Viterbi decoding. Results of simulations are also presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A system error bound for the self-truncating reconstructing filter class (Corresp.)

    Publication Year: 1975, Page(s):341 - 342
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    The error signal at the output of a sampling reconstruction filter caused by uncorrelated noise samples is analyzed. This error is combined with a truncation error bound for the class of "self-truncating" reconstruction filters [1] to give a system error bound for a bounded class of band-limited signals. 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
Prakash Narayan 

Department of Electrical and Computer Engineering