IEEE Transactions on Information Theory

Volume 41 Issue 3 • May 1995

Filter Results

Displaying Results 1 - 25 of 35
  • Optimum soft-output detection for channels with intersymbol interference

    Publication Year: 1995, Page(s):704 - 713
    Cited by:  Papers (113)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (958 KB)

    In contrast to the conventional Viterbi algorithm (VA) which generates hard-outputs, an optimum soft-output algorithm (OSA) is derived under the constraint of fixed decision delay for detection of M-ary digital signals in the presence of intersymbol interference and additive white Gaussian noise. The OSA, a new type of the conventional symbol-by-symbol maximum a posteriori probability algorithm, r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "Optimality of the sequential probability ratio test for nonstationary observations" by Y. Liu and S.D. Blostein

    Publication Year: 1995
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (102 KB)

    For original paper see IEEE Trans. Inform. Theory, vol.38, p.177-82 (1992). Liu and Blostein (1992) consider sequential tests with varying stopping bounds (NSPRT) for testing simple hypotheses on independent but nonstationary observations. They state a considerable generalization of the famous Wald-Wolfowitz theorem [1948] on the (simultaneous) minimization of the expected sample sizes for given e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the relation between filter maps and correction factors in likelihood ratios

    Publication Year: 1995, Page(s):833 - 836
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    The robust form of the likelihood ratio for a signal in the presence of white noise has an additional term in the exponent called the correction factor which corresponds to the trace of the conditional covariance of the signal given the observations. The authors show that this correction term is nothing but the trace of the symmetrized Frechet derivative of the nonlinear filter map and hence the l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line density estimators with high efficiency

    Publication Year: 1995, Page(s):829 - 833
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    Presents on-line procedures for estimating density functions and their derivatives. At each step, M terms are updated. By increasing M the efficiency compared to the traditional off-line kernel density estimator tends to one. Already for M=2, it exceeds 99.1% for kernel orders and derivatives of practical interest View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information-theoretic approach to unimodal density estimation

    Publication Year: 1995, Page(s):824 - 829
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    Extends the maximum entropy information-theoretic density estimation method to provide a technique which guarantees that the resulting density is unimodal. The method inputs data in the form of moment or quantile constraints and consequently can handle both data-derived and non-data-derived information View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-locator ideals for algebraic-geometric codes

    Publication Year: 1995, Page(s):819 - 824
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    The error locations for an algebraic-geometric code C*(D,mP) are exactly the common zeros (that is, a projective variety V(I)) of a set (ideal) I of error-locator functions. The paper gives a one-dimensional Berlekamp-Massey version of the Feng-Rao (1993) algorithm for decoding algebraic-geometric codes C*(D,mP). This produces a generating set for I (as an ideal) of size at most ρ (the smalles... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On spectra of BCH codes

    Publication Year: 1995, Page(s):786 - 788
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    Derives an estimate for the error term in the binomial approximation of spectra of BCH codes. This estimate asymptotically improves on the bounds by Sidelnikov (1971), Kasami et al. (1985), and Sole (1990) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction and evaluation of trellis-coded quantizers for memoryless sources

    Publication Year: 1995, Page(s):853 - 859
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    New constructions of trellis waveform coders, trellis-coded quantizers, and trellis-coded vector quantizers are proposed. The performances of the new quantizers are determined for the memoryless Laplacian, Gaussian, and uniform sources. They are better than (for the Gaussian and Laplacian sources) or equal to (for the uniform source) the best previously published results View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic construction of cyclic codes over Z8 with a good Euclidean minimum distance

    Publication Year: 1995, Page(s):815 - 818
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    Let S(8) denote the set of the eight admissible signals of an 8PSK communication system. The alphabet S(8) is endowed with the structure of Z8, the set of integers taken modulo 8, and codes are defined to be Z8-submodules of Z8n. Three cyclic codes over Z8 are then constructed. Their length is equal to 6, 8, and 7, and they, respectively, cont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal simultaneous detection and estimation under a false alarm constraint

    Publication Year: 1995, Page(s):688 - 703
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1196 KB)

    This paper addresses the problem of finite sample simultaneous detection and estimation which arises when estimation of signal parameters is desired but signal presence is uncertain. In general, a joint detection and estimation algorithm cannot simultaneously achieve optimal detection and optimal estimation performance. We develop a multihypothesis testing framework for studying the tradeoffs betw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • De-noising by soft-thresholding

    Publication Year: 1995, Page(s):613 - 627
    Cited by:  Papers (4172)  |  Patents (73)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1164 KB)

    Donoho and Johnstone (1994) proposed a method for reconstructing an unknown function f on [0,1] from noisy data di=f(ti )+σzi, i=0, …, n-1,ti=i/n, where the zi are independent and identically distributed standard Gaussian random variables. The reconstruction fˆ*n is defined in the wavelet domain by translating all... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing SCN bases in characteristic 2

    Publication Year: 1995, Page(s):790 - 794
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    A simple deterministic algorithm to construct a normal basis of GF(qn) over GF(q) (q=pr, p prime) is given. When p=2, the authors deduce a (self complementary normal-SCN) basis of GF(q n) over GF(q) for n odd, or n=2t, t odd. In characteristic 2 these cases are known to be the only possible ones for which there exists an SCN basis View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subgroup subcodes

    Publication Year: 1995, Page(s):781 - 785
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    Subgroup subcodes and their duals which can be considered as an extension of subfield subcodes and trace codes are defined. Some of their basic properties are investigated. Examples of good subgroup subcodes are included View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New bounds for the variation of mean-square-continuous wide-sense-stationary processes

    Publication Year: 1995, Page(s):849 - 852
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    New bounds for real, continuous, nonnegative-definite functions are established. As an application it is shown that the variation of a real mean-square-continuous (MSC) wide-sense-stationary (WSS) process is bounded by its Maclaurin polynomials, either from below or from above depending on their degree. The least upper bound for the variation of a real MSC WSS process which depends solely on the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Runlength-limited codes for single error detection in the magnetic recording channel

    Publication Year: 1995, Page(s):809 - 815
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    An arithmetic function that assigns the value 0, 1, or 2 to each binary sequence is introduced. The authors call this function the error-check value. Two sequences that differ by a single symmetric error or a single shift error are shown to have different error-check values. Runlength-limited codes for detecting single-errors are designed by taking a set of the constrained sequences such that each... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric estimation via empirical risk minimization

    Publication Year: 1995, Page(s):677 - 687
    Cited by:  Papers (74)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    A general notion of universal consistency of nonparametric estimators is introduced that applies to regression estimation, conditional median estimation, curve fitting, pattern recognition, and learning concepts. General methods for proving consistency of estimators based on minimizing the empirical error are shown. In particular, distribution-free almost sure consistency of neural network estimat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shadow codes and weight enumerators

    Publication Year: 1995, Page(s):762 - 768
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    The technique of using shadow codes to build larger self-dual codes is extended to codes over arbitrary fields. It is shown how to build the codes and how to determine the new weight enumerator as well. For codes over fields equipped with a square root of -1 and not of characteristic 2, a self-dual code of length n+2 can be built from a self-dual code of length n; for codes over a field without a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound on the error probability for signals in white Gaussian noise

    Publication Year: 1995, Page(s):837 - 841
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    The performance of specific signal constellations in digital communications problems is often described through use of the union bound, an upper bound which is asymptotically tight with respect to the signal-to-noise ratio. It is not unnatural to ask how tight this result is for small to medium values of signal-to-noise ratio; one way to answer this question is to develop an asymptotically tight l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A strong version of the redundancy-capacity theorem of universal coding

    Publication Year: 1995, Page(s):714 - 722
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    The capacity of the channel induced by a given class of sources is well known to be an attainable lower bound on the redundancy of universal codes with respect to this class, both in the minimax sense and in the Bayesian (maximin) sense. We show that this capacity is essentially a lower bound also in a stronger sense, that is, for “most” sources in the class. This result extends Rissan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On primitive BCH codes with unequal error protection capabilities

    Publication Year: 1995, Page(s):788 - 790
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    Presents a class of binary primitive BCH codes that have unequal-error-protection (UEP) capabilities. The authors use a previous result on the span of their minimum weight vectors to show that binary primitive BCH codes, containing second-order punctured Reed-Muller (RM) codes of the same minimum distance, are binary-cyclic UEP codes. The values of the error correction levels for this class of bin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two remarks on a paper by Moreno and Kumar [binary Reed-Muller codes]

    Publication Year: 1995, Page(s):859 - 861
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    O. Moreno and P.V. Kumar (IEEE Trans. Inform. Theory, vol.39, no.5, September 1993) showed how Deligne's theorem can be applied to coding theory. They studied certain subcodes of binary Reed-Muller codes and estimated the associated character sums over a field of q2 elements. They obtained bounds of the order 𝒪(q). The present paper shows that in one case one can improve the coeffi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the continuous wavelet transform of second-order random processes

    Publication Year: 1995, Page(s):628 - 642
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (988 KB)

    Some second-order properties of random processes such as periodic correlation, stationarity, harmonizability, self-similarity, are characterized via corresponding properties of their wavelet transform: any one of these properties of the wavelet transform characterizes the corresponding property of the increments of the random process, of order equal to the order of regularity of the analyzing wave... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear codes for the sum mod-2 multiple-access channel with restricted access

    Publication Year: 1995, Page(s):794 - 799
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    Transmission of information through a multiple-access-modulo-2 adder channel is addressed for the situation that out of a fixed family of N potential users at most some m, m<N are active simultaneously. The authors assign codes to the N users in a way that the receiver is able to correct any t or less errors and separate the s⩽m messages without a priori knowledge of the subset of active us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New models and algorithms for future networks

    Publication Year: 1995, Page(s):769 - 780
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1228 KB)

    In future networks, transmission and switching capacity will dominate processing capacity. The authors investigate the way in which distributed algorithms should be changed in order to operate efficiently in this new environment. They introduce a class of new models for distributed algorithms which make explicit the difference between switching and processing. Based on these new models they define... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the score functions of the two-sample locally optimum rank test statistic for random signals in additive noise

    Publication Year: 1995, Page(s):842 - 846
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    The test statistic of the two-sample locally optimum rank detector is derived for weak random signals in additive noise. It is shown that the two-sample locally optimum rank detector for random signals has interesting similarities to the one-sample locally optimum rank detector for random signals. The detector may also be viewed as a generalization of the two-sample locally optimum rank detector f... 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