IEEE Transactions on Information Theory

Volume 37 Issue 1 • Jan. 1991

Filter Results

Displaying Results 1 - 25 of 35
  • A class of least-squares filtering and identification algorithms with systolic array architectures

    Publication Year: 1991, Page(s):43 - 52
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (923 KB)

    A unified approach is presented for deriving a large class of new and previously known time and order recursive least-squares algorithms with systolic array architectures, suitable for high throughput rate and VLSI implementations of space-time filtering and system identification problems. The geometrical derivation given is unique in that no assumption is made concerning the rank of the sample da... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Almost sure convergence analysis of autoregressive spectral estimation in additive noise

    Publication Year: 1991, Page(s):36 - 42
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (570 KB)

    The almost sure convergence properties of autoregressive spectral estimates from noisy observations are derived. Sharp rates of almost sure convergence are established for the estimates of the autoregressive parameters, innovation variance, and spectral density function of the signal process. The distributions of the signal and noise processes are arbitrary.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Krein factorization of covariance operators of 2-parameter random fields and application to the likelihood ratio

    Publication Year: 1991, Page(s):53 - 59
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (454 KB)

    A factorization of the covariance operator (I+R) is derived for the observation process of a 2-parameter random field. This result can be applied to express the determinant term appearing in L.A. Shepp's (1966) expression for the likelihood ratio in terms of the system parameters. This means that, in practice, one of the problems in computing the likelihood ratio for random fields is solved. Exten... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal and robust memoryless discrimination from dependent observations

    Publication Year: 1991, Page(s):73 - 91
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1499 KB)

    Discrimination is considered between two possible sources based on dependent observations of their output. The discrimination problem is modeled by means of a general binary hypothesis test, the main emphasis being on situations that cannot be modeled as signals in additive noise. The observations are modeled as stationary m-dependent or rho -mixing processes. The structure of the discriminator is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timing estimation for a filtered Poisson process in Gaussian noise

    Publication Year: 1991, Page(s):92 - 106
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1164 KB)

    The problem of estimation of time shift of an inhomogeneous casually filtered Poisson process in the presence of additive Gaussian noise is discussed. Approximate expressions for the likelihood function, the MAP estimator, and the MMSE estimator that becomes increasingly accurate as the per-unit-time density of superimposed filter responses becomes small are obtained. The optimal MAP estimator tak... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An inequality for rational functions with applications to some statistical estimation problems

    Publication Year: 1991, Page(s):107 - 113
    Cited by:  Papers (94)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (578 KB)

    The well-known Baum-Eagon inequality (1967) provides an effective iterative scheme for finding a local maximum for homogeneous polynomials with positive coefficients over a domain of probability values. However, in many applications the goal is to maximize a general rational function. In view of this, the Baum-Eagon inequality is extended to rational functions. Some of the applications of this ine... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A calculus for network delay. I. Network elements in isolation

    Publication Year: 1991, Page(s):114 - 131
    Cited by:  Papers (1075)  |  Patents (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1490 KB)

    A calculus is developed for obtaining bounds on delay and buffering requirements in a communication network operating in a packet switched mode under a fixed routing strategy. The theory developed is different from traditional approaches to analyzing delay because the model used to describe the entry of data into the network is nonprobabilistic. It is supposed that the data stream entered into the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A calculus for network delay. II. Network analysis

    Publication Year: 1991, Page(s):132 - 141
    Cited by:  Papers (499)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    For pt.I see ibid., vol.37, no.1, p.114-31 (1991). A method to analyze the flow of data in a network consisting of the interconnection of network elements is presented. Assuming the data that enters the network satisfies burstiness constraints, burstiness constraints are derived for traffic flowing between network elements. These derived constraints imply bounds on network delay and buffering requ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on the absolute epsilon entropy

    Publication Year: 1991, Page(s):142 - 144
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    A novel characterization of the absolute epsilon entropy of an ergodic information source is presented. This characterization allows one to derive a new lower bound to this quantity, which is shown to be tight in some interesting special cases.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Divergence measures based on the Shannon entropy

    Publication Year: 1991, Page(s):145 - 151
    Cited by:  Papers (1067)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    A novel class of information-theoretic divergence measures based on the Shannon entropy is introduced. Unlike the well-known Kullback divergences, the new measures do not require the condition of absolute continuity to be satisfied by the probability distributions involved. More importantly, their close relationship with the variational distance and the probability of misclassification error are e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the error probability of signals in additive white Gaussian noise

    Publication Year: 1991, Page(s):151 - 155
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (415 KB)

    A new upper bound to the probability of error in detecting one of M equally probable signals in additive white Gaussian noise is presented. This bound is easy to calculate, can be applied to any signal set. It is always better than the union and minimum distance bounds. Examples demonstrate the use of the bound.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal bi-level quantization and its application to multilevel quantization

    Publication Year: 1991, Page(s):160 - 163
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (414 KB)

    A special form of optimal quantization, optimal bilevel quantization, is studied. A fixed-point method is embedded in a search scheme to find all the locally optimal bilevel quantizers, resulting in an algorithm for computing the globally optimal bilevel quantizer. Some interesting relations between the optimal bilevel quantizer, and the mean and the median of the density function p(x) are explore... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-correcting codes for list decoding

    Publication Year: 1991, Page(s):5 - 12
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (879 KB)

    In the list-of-L decoding of a block code the receiver of a noisy sequence lists L possible transmitted messages, and is in error only if the correct message is not on the list. Consideration is given to (n,e,L) codes, which correct all sets of e or fewer errors in a block of n bits under list-of-L decoding. New geometric relations between the number of errors corrected under list-of-1 decoding an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-correcting codes for authentication and subliminal channels

    Publication Year: 1991, Page(s):13 - 17
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (443 KB)

    The application of coding theory to security scenarios is studied. Authentication systems are introduced that are based on algebraic codes and provide high protection against an intruder's impersonation and substitution attacks. It is shown that a subliminal channel can be embedded into these systems and that there is a trade-off between the authentication capability, subliminal capacity, and erro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of the Gaussian arbitrarily varying channel

    Publication Year: 1991, Page(s):18 - 26
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The Gaussian arbitrarily varying channel with input constraint Gamma and state constraint Lambda admits input sequences x=(x/sub 1/,---,X/sub n/) of real numbers with Sigma x/sub i//sup 2/<or=n Gamma and state sequences s=(S/sub 1/,---,s/sub n/) of real numbers with Sigma s/sub i//sup 2/<or=n Lambda ; the output sequence x+s+V, where V=(V/sub 1/,---,V/sub n/) is a sequence of independent and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State constraints for the multiple-access arbitrarily varying channel

    Publication Year: 1991, Page(s):27 - 35
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (718 KB)

    A discrete multiple-access arbitrarily varying channel with two transmitters and one receiver is considered. It has recently been shown that if such a channel is symmetrizable, then the capacity region has an empty interior. It is shown that if the channel is subject to a suitable state constraint, then the capacity region can contain certain open rectangles and thereby possess a nonempty interior... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient estimation of Class A noise parameters via the EM algorithm

    Publication Year: 1991, Page(s):60 - 72
    Cited by:  Papers (77)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1075 KB)

    The Class A Middleton noise model is a commonly used statistical-physical, parametric model for non-Gaussian interference superimposed on a Gaussian background. In this study, the problem of efficient estimation of the Class A parameters for small sample sizes is considered. The proposed estimator is based on the EM algorithm, a two-step iterative estimation technique that is ideally suited for th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the performance and complexity of channel-optimized vector quantizers

    Publication Year: 1991, Page(s):155 - 160
    Cited by:  Papers (205)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    The performance and complexity of channel-optimized vector quantizers are studied for the Gauss-Markov source. Observations on the geometric structure of these quantizers are made, which have an important implication on the encoding complexity. For the squared-error distortion measure, it is shown that an operation equivalent to a Euclidean distance measurement with respect to an appropriately def... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On linear structure and phase rotation invariant properties of block M-PSK modulation codes

    Publication Year: 1991, Page(s):164 - 167
    Cited by:  Papers (22)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (426 KB)

    Two important structural properties of block M(=2/sup '/)-ary PSK modulation codes, linear structure and phase symmetry, are investigated. An M-ary modulation code is first represented as a code with symbols from the integer group S/sub M-PSK/=(0,1,2,---,M-1) under modulo-M addition. Then the linear structure of block M-PSK modulation codes over S/sub M-PSK/ with respect to modulo-M vector additio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improvement to generalized-minimum-distance decoding

    Publication Year: 1991, Page(s):167 - 172
    Cited by:  Papers (68)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    A novel acceptance criterion that is less stringent than previous criteria is developed. The criterion accepts the codeword that is closest to the received vector for many cases where previous criteria fail to accept any codeword. As a result, the performance of generalized minimum distance (GMD) decoding is better if the new criterion is used. For M-ary signaling, the weights used in GMD decoding... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the competitive optimality of Huffman codes

    Publication Year: 1991, Page(s):172 - 174
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (315 KB)

    Let X be a discrete random variable drawn according to a probability mass function p(x), and suppose p(x), is dyadic, i.e., log(1/p(x)) is an integer for each x. It is shown that the binary code length assignment l(x)=log(1/p(x)) dominates any other uniquely decodable assignment l'(x) in expected length in the sense that El(X)<El'(X), indicating optimality in long run performance (which is well... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on D-ary Huffman codes

    Publication Year: 1991, Page(s):174 - 179
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    An upper bound on the redundancy of D-ary Huffman codes in terms of the probability p/sub 1/ of the most likely source letter is provided. For large values of p/sub 1/, the bound improves the one given by R.G. Gallager (1978). Additionally, some results known for the binary case (D=2) are extended to arbitrary D-ary Huffman codes. As a consequence, a tight lower bound that corrects a bound recentl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new binary code of length 10 and covering radius 1

    Publication Year: 1991, Page(s):179 - 180
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1256 KB)

    A mixed code of covering radius 1 that has 60 codewords is constructed. This code is then used to show that K(10,1)<or=120.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the problem of finding zero-concurring codewords

    Publication Year: 1991, Page(s):180 - 187
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    Zero-concurring codewords disclose a certain structure of the code that may be used for efficient soft-decision decoding and for designing DC-free codes. Methods for constructing sets of zero-concurring codewords are presented for several families of codes. For the general case an algorithm solution of the problem is offered. A table of results obtained using the proposed techniques is supplied fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • More on the minimum distance of cyclic codes

    Publication Year: 1991, Page(s):187 - 189
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (383 KB)

    It was recently shown that the so-called Jensen bound is generally weaker than the product method and the shifting method introduced by van Lint and Wilson (1986). It is shown that the minimum distance of the two cyclic codes of length 65 (for which it is known that the product method does not produce the desired result) can be proved using Jensen's method (1985) with some adaptations.<<ETX&... 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