IEEE Transactions on Information Theory

Volume 40 Issue 5 • Sept. 1994

Filter Results

Displaying Results 1 - 25 of 48
  • Modulation and coding for throughput-efficient optical systems

    Publication Year: 1994, Page(s):1313 - 1326
    Cited by:  Papers (53)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1327 KB)

    Optical direct-detection systems are currently being considered for some high-speed intersatellite links, where data rates of a few hundred megabits per second are envisioned under power and pulsewidth constraints. The authors investigate the capacity, cutoff rate, and error-probability performance of uncoded and trellis-coded systems for various modulation schemes and under throughput and power c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On sequential delay estimation in wideband digital communication systems

    Publication Year: 1994, Page(s):1327 - 1333
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    The problem of estimating the symbol timing in wideband data communication signals is considered. Conventional approaches to this problem suffer from several drawbacks, including possible lack of consistency due to multiple extrema in the error surface, and very slow convergence due to exceedingly sharp waveform correlation functions. In the paper sequential detection-estimation algorithms that al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint transmitter-receiver optimization for multi-input multi-output systems with decision feedback

    Publication Year: 1994, Page(s):1334 - 1347
    Cited by:  Papers (91)  |  Patents (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1126 KB)

    The joint transmit-receive optimization problem for multiuser communication systems with decision feedback is investigated. It is shown that minimization of the geometric mean-squared error (defined as the determinant of the error covariance matrix) leads to a tractable transmitter optimization problem for general multi-input multi-output decision-feedback systems. Several computational results ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A trellis coded modulation scheme constructed from block coded modulation with interblock memory

    Publication Year: 1994, Page(s):1348 - 1363
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1287 KB)

    Proposes a new trellis coded modulation scheme which is constructed by combining a convolutional code and a variation of block coded modulation called block coded modulation with interblock memory. In the proposed scheme, each coded multidimensional signal point has a kind of two-fold dependency on other coded multidimensional signal points. In addition to the dependency on other coded multidimens... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new procedure for decoding cyclic and BCH codes up to actual minimum distance

    Publication Year: 1994, Page(s):1364 - 1374
    Cited by:  Papers (35)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (855 KB)

    The paper presents a new procedure for decoding cyclic and BCH codes up to their actual minimum distance. It generalizes the Peterson decoding procedure and the procedure of Feng and Tzeng (1991) using nonrecurrent syndrome dependence relations. For a code with actual minimum distance d to correct up to t=[(d-1)/2] errors, the procedure requires a (2t+1)/spl times/(2t+1) syndrome matrix with known... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Irreducible components of canonical diagrams for spectral nulls

    Publication Year: 1994, Page(s):1375 - 1391
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1505 KB)

    Irreducible components of canonical diagrams for spectral null constraints at f=f/sub s/k/n are studied, where k and n are integers and f/sub s/ is the symbol frequency. To identify systematically all irreducible components of the canonical diagrams for first-order spectral nulls at f, we give a set of channel symbol sequences specifying all of them. If n is a prime number, then each sequence in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Suboptimum decoding of decomposable block codes

    Publication Year: 1994, Page(s):1392 - 1405
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1224 KB)

    To decode a long block code with a large minimum distance by maximum likelihood decoding is practically impossible because the decoding complexity is simply enormous. However, if a code can be decomposed into constituent codes with smaller dimensions and simpler structure, it is possible to devise a practical and yet efficient scheme to decode the code. This paper investigates a class of decomposa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the structure of linear codes with covering radius two and three

    Publication Year: 1994, Page(s):1406 - 1416
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1094 KB)

    We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering radius r. All bounds are derived in a uniform way. We employ results from coding theory, some earlier results on covering codes, and combinatorial arguments. We prove the following bounds: l(6, 2)=13, l(7,2)=19, l(8,2)/spl ges/25, l(9,2)/spl ges/34, l(2m-l,2)/spl ges/2/sup m/+1 for m/spl ges/3, l(14... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary coding by integration of polynomials

    Publication Year: 1994, Page(s):1417 - 1424
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (725 KB)

    Based on the idea of integration and differentiation of polynomials, a large class of linear unequal error-protection (LUEP) codes is constructed. Many of these codes are optimal. A codeword is generated by binary discrete integration of an all-zero vector, using the information bits as integration constants. Decoding is performed by discrete differentiation of the received word. For special desig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weight distributions of cosets of two-error-correcting binary BCH codes, extended or not

    Publication Year: 1994, Page(s):1425 - 1442
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1514 KB)

    Let B be the binary two-error-correcting BCH code of length 2/sup m/-1 and let B/spl circ/ be the extended code of B. We give formal expressions of weight distributions of the cosets of the codes B/spl circ/ only depending on m. We can then deduce the weight distributions of the cosets of B. When m is odd, it is well known that there are four distinct weight distributions for the cosets of B. So o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on achievable rates for limited bitshift correcting codes

    Publication Year: 1994, Page(s):1443 - 1458
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1416 KB)

    Limited codes (runlength-limited, charge constrained, and so on) capable of correcting shifts of their symbols are considered. The error-correction ability is characterized by the minimal bitshift distance d/sub BS/ of a code. For a given /spl delta/=d/sub BS//n, where n is the code length, the achievable code rate R/sub /spl alpha// is lower bounded. We prove the existence of codes of rate R/spl ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance of convolutional codes on the block erasure channel using various finite interleaving techniques

    Publication Year: 1994, Page(s):1459 - 1473
    Cited by:  Papers (40)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1470 KB)

    Consider the transmission of a finitely interleaved rate 1/n convolutionally encoded message over a channel with memory having two internal states /spl Xi//sub 0/ and /spl Xi//sub 1/ where when in state /spl Xi//sub 0/, the channel resembles a noiseless binary symmetric channel (BSC), whereas when in state /spl Xi//sub 1/, the channel is totally blocked and is well approximated by a binary-input s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic system identification with order statistics

    Publication Year: 1994, Page(s):1474 - 1489
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1137 KB)

    Systems consisting of linear dynamic and memory-less nonlinear subsystems are identified. The paper deals with systems in which the nonlinear element is followed by a linear element, as well as systems in which the subsystems are connected in parallel. The goal of the identification is to recover the nonlinearity from noisy input-output observations of the whole system; signals interconnecting the... View full abstract»

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

    Publication Year: 1994, Page(s):1504 - 1512
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (683 KB)

    An on-line density estimator may be defined to be one where each update, following the arrival of a new data value, may be accomplished after no more than a fixed number of calculations. This definition should also apply to any empirical bandwidth selection rule for such an estimator. Recursive estimators comprise only a special case of on-line estimators, but even there, on-line bandwidth formula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric density estimation for classes of positive random variables

    Publication Year: 1994, Page(s):1513 - 1535
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1714 KB)

    A kernel-based density estimator for positive random variables is proposed and analyzed. In particular, a nonparametric estimator is developed which takes advantage of the fact that positive random variables can be represented as the norms of random vectors. By appropriately choosing the dimension of the assumed vector space, the estimator can be structured to exploit a priori knowledge about the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal waveform selection for tracking systems

    Publication Year: 1994, Page(s):1536 - 1550
    Cited by:  Papers (122)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1376 KB)

    Investigates adaptive waveform selection schemes where selection is based on overall target tracking system performance. Optimal receiver assumptions allow the inclusion of transmitted waveform specification parameters in the tracking subsystem defining equations. The authors give explicit expressions for two one-step ahead optimization problems for a single target in white Gaussian noise when the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data fusion with minimal communication

    Publication Year: 1994, Page(s):1551 - 1563
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1302 KB)

    Two sensors obtain data vectors x and y, respectively, and transmit real vectors m/spl I.oarr//sub 1/(x) and m/spl I.oarr//sub 2/(y), respectively, to a fusion center. The authors obtain tight lower bounds on the number of messages (the sum of the dimensions of m/spl I.oarr//sub 1/ and m/spl I.oarr//sub 2/) that have to be transmitted for the fusion center to be able to evaluate a given function f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The rate-distortion dimension of sets and measures

    Publication Year: 1994, Page(s):1564 - 1572
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (867 KB)

    Data compression of independent samples drawn from a fractal set is considered. The asymptotic ratio of rate to magnitude log distortion characterizes the effective dimension occupied by the underlying distribution. This quantity is shown to be identical to Renyi's (1959) information dimension. For self-similar fractal sets this dimension is distribution dependent-in sharp contrast with the behavi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on the probability of deception in authentication with arbitration

    Publication Year: 1994, Page(s):1573 - 1585
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1174 KB)

    The paper investigates a model for authentication in which not only an outsider, but also the transmitter or the receiver, may cheat. Lower bounds on the probability of success for different types of deception as well as on the parameters of secure authentication codes are derived. The latter bounds are shown to be tight by demonstrating codes in projective space that meet the bounds with equality... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the probability of deception in multiple authentication

    Publication Year: 1994, Page(s):1586 - 1591
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    The frequently assumed "freshness" constraint on the source states in multiple authentication schemes is not necessary if one allows the encoding rule to change between subsequent transmissions. In the paper it is shown that the main existing lower bounds on the probabilities of successful attack on multiple authentication schemes also hold for this new setup. Furthermore, Stinson's (1988) bound f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum likelihood sequence estimation from the lattice viewpoint

    Publication Year: 1994, Page(s):1591 - 1600
    Cited by:  Papers (50)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1043 KB)

    Considers the problem of data detection in multilevel lattice-type modulation systems in the presence of intersymbol interference and additive white Gaussian noise. The conventional maximum likelihood sequence estimator using the Viterbi algorithm has a time complexity of O(m/sup /spl nu/+1/) operations per symbol and a space complexity of O(/spl delta/m/sup /spl nu//) storage elements, where m is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation for discrete Markov random fields observed in Gaussian noise

    Publication Year: 1994, Page(s):1600 - 1603
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB)

    A finite state Markov random field is observed in Gaussian noise. Changes of measures are defined under which all random variables of the signal are independent and uniformly distributed over the finite state space and all random variables of the observation are independent and N(0,1). The problem of estimating the most likely signal given the observations is treated in a related form by introduci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On two-dimensional spectral realization

    Publication Year: 1994, Page(s):1603 - 1608
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (555 KB)

    Reconstruction of a spectral density function from a finite set of covariances can be performed by maximizing an entropy functional. The method of the maximum entropy on the mean is used For computing a discrete version of this spectral density and allows one to give a new interpretation of these reconstruction methods. In fact, the authors show that the choice of the entropy is directly related t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the correlation structure of the wavelet coefficients of fractional Brownian motion

    Publication Year: 1994, Page(s):1609 - 1612
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (367 KB)

    Shows that the interdependence of the discrete wavelet coefficients of fractional Brownian motion, defined by normalized correlation, decays exponentially fast across scales and hyperbolically fast along time.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically robust detection of known signals in nonadditive noise

    Publication Year: 1994, Page(s):1612 - 1619
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    Robust detection of known weak signals of unknown amplitude is considered for a class of combined additive and nonadditive noise models and an asymptotically large set of independent observations. This class includes observation models that may have combinations of multiplicative and signal-dependent noise terms. Sufficient conditions are given for robust detection schemes for cases where the gene... 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