IEEE Transactions on Information Theory

Volume 39 Issue 2 • March 1993

Filter Results

Displaying Results 1 - 25 of 45
  • Trellis coding with multidimensional QAM signal sets

    Publication Year: 1993, Page(s):325 - 336
    Cited by:  Papers (41)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1132 KB)

    Trellis coding using multidimensional quadrature amplitude modulation (QAM) signal sets is investigated. Finite-size 2D signal sets are presented that have minimum average energy, are 90 degrees rotationally symmetric, and have from 16 to 1024 points. The best trellis codes using the finite 16-QAM signal set with two, four, six, and eight dimensions are found by computer search (the multidimension... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the asymptotic efficiency of importance sampling techniques

    Publication Year: 1993, Page(s):710 - 715
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    The asymptotic efficiency of importance sampling (IS) techniques for the simulation of rare events in a multidimensional nonlinear setting was studied by J.S. Sadowsky and J.A. Bucklew (see ibid., vol.36, p.579-88, 1990). Fundamental results on the asymptotic efficiency of the mean-value modification (MM) technique were derived. Additionally, a statement was made that other IS techniques cannot be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vector quantizers with direct sum codebooks

    Publication Year: 1993, Page(s):565 - 580
    Cited by:  Papers (65)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1076 KB)

    The use of direct sum codebooks to minimize the memory requirements of vector quantizers is investigated. Assuming arbitrary fixed partitions, necessary conditions for minimum distortion codebooks are derived, first for scalar codebooks, assuming mean-squared error distortion, and then for vector codebooks and a broader class of distortion measures. An iterative procedure is described for designin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed algorithms for computing shortest pairs of disjoint paths

    Publication Year: 1993, Page(s):443 - 455
    Cited by:  Papers (47)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1184 KB)

    Distributed algorithms for finding two disjoint paths of minimum total length from each node to a destination are presented. The algorithms have both node-disjoint and link-disjoint versions and provide each node with information sufficient to forward data on the disjoint paths. It is shown that this problem can be reduced to the problem of finding a minimal shortest path from each node to the des... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Valid parameter space of 2-D Gaussian Markov random fields

    Publication Year: 1993, Page(s):703 - 709
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    The valid parameter spaces of infinite- and finite-lattice (2-D noncausal) Gaussian Markov random fields (GMRFs) are investigated. For the infinite-lattice fields, the valid parameter space is shown to admit an explicit description; a procedure that yields the valid parameter space is presented. This procedure is applied to the second-order (neighborhood) 2-D GMRFs to obtain an explicit descriptio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modifying real convolutional codes for protecting digital filtering systems

    Publication Year: 1993, Page(s):553 - 564
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    A method is presented for protecting the overall realization of digital filters implemented with very dense high-speed electronic devices against both hard and soft errors at the data sample level using the error-detecting properties of real convolutional codes. The normal filter system is surrounded with parallel parity channels defined by a real systematic rate k/n convolutiona... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perfect (d,k)-codes capable of correcting single peak-shifts

    Publication Year: 1993, Page(s):656 - 662
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    Codes for the multibit peak-shift recording channel, called (d ,k)-codes of reduced length N, are considered. Arbitrary (d,k)- and perfect (d,k)-codes capable of correcting single peak-shifts of given size t are defined. For the construction of perfect codes, a general combinatorial method connected with finding `good' weight ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Phased burst error-correcting array codes

    Publication Year: 1993, Page(s):684 - 693
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    Various aspects of single-phased burst-error-correcting array codes are explored. These codes are composed of two-dimensional arrays with row and column parities with a diagonally cyclic readout order; they are capable of correcting a single burst error along one diagonal. Optimal codeword sizes are found to have dimensions n1 ×n2 such that n<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized sequential detection with a fusion center performing the sequential test

    Publication Year: 1993, Page(s):433 - 442
    Cited by:  Papers (104)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A decentralized sequential detection problem is considered in which each one of a set of sensors receives a sequence of observations about the hypothesis. Each sensor sends a sequence of summary messages to the fusion center where a sequential test is carried out to determine the true hypothesis. A Bayesian framework for this problem is introduced, and for the case when the information structure i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Super-exponential methods for blind deconvolution

    Publication Year: 1993, Page(s):504 - 519
    Cited by:  Papers (220)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1072 KB)

    A class of iterative methods for solving the blind deconvolution problem, i.e. for recovering the input of an unknown possibly nonminimum-phase linear system by observation of its output, is presented. These methods are universal do not require prior knowledge of the input distribution, are computationally efficient and statistically stable, and converge to the desired solution regardless of initi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new model of numerical computer data and its application for construction of minimum-redundancy codes

    Publication Year: 1993, Page(s):389 - 397
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    Numerical computer data in many applications contain numerous leading and trailing zeros, and this data feature has been neglected in common source models and related data compression methods. A new approach to source modeling, consisting of the description of this data feature by probabilities pij of data values with i leading and j trailing zeros, is propose... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources

    Publication Year: 1993, Page(s):698 - 702
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    The authors apply the Lempel-Ziv incremental parsing (LZIP) algorithm to an i.i.d. source and obtain the expected length of the ith parsed segment. From this formula, the data compression ratio of LZIP is calculated in the framework of a variable-to-fixed length coding scheme View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of identified 2-D noncausal models

    Publication Year: 1993, Page(s):525 - 534
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    There are two approaches to the identification of noncausal autoregressive systems in two dimensions differing in the assumed noise model. For both approaches, the maximum likelihood estimator formulated in the frequency domain is presented. The Fisher information matrix is evaluated and found to be the sum of a block-Toeplitz and a block-Hankel matrix. The variance of the parameters, however, can... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The input-output map of a monotone discrete-time quasireversible node [queueing theory]

    Publication Year: 1993, Page(s):543 - 552
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    A class of discrete-time quasi-reversible nodes called monotone, which includes discrete-time analogs of the ./M/∞ and ./M/1 nodes, is considered. For stationary ergodic nonnegative integer valued arrival processes, the existence and uniqueness of stationary regimes are proven when a natural rate condition is met. Coupling is used to prove the contractiveness of the input-output map relative... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modified Gold codes

    Publication Year: 1993, Page(s):654 - 656
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    Large families of weakly correlated codes, much in the spirit of R. Gold (1967) and T. Kasami (1971), are constructed. More general codes than those of Gold and Kasami, generated in essentially the same way, and with a much simpler method of proof, are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust estimation of signal parameters with nonstationary and/or dependent data

    Publication Year: 1993, Page(s):617 - 623
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    A new approach toward robust parameter estimation is presented. As opposed to schemes based on classical saddlepoint techniques, the methods apply quite naturally to dependent and/or nonstationary data and also have the advantage of providing a quantitative measure of the degree of robustness offered by a particular estimator. It is shown why censoring observations of large magnitude does indeed i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Primitive polynomials and m-sequences over GF(q m)

    Publication Year: 1993, Page(s):643 - 647
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Procedures for obtaining primitive polynomials and m-sequences over GF(qm) in terms of primitive polynomials and m-sequences over GF(q) are presented. Using a degree mn primitive polynomial g( x) in GF[g, x], an m-sequence over GF(qm) can be expressed as a vector m-sequ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On limiting characterizations of memoryless multiuser capacity regions

    Publication Year: 1993, Page(s):609 - 612
    Cited by:  Papers (21)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    The restriction to Gaussian inputs in the limiting expression for the capacity regions of memoryless Gaussian interference and multiple-access channels is shown to fall short of achieving capacity even if the inputs are allowed to be dependent and nonstationary. In addition, the equality between the limiting and the single-letter characterizations of memoryless multiple-access channel capacity is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the number of correctable errors for some AG-codes

    Publication Year: 1993, Page(s):681 - 684
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    An algorithm that, for codes from a regular plane curve, corrects up to (d*/2)-(m2/8)+(m/4)-(9/8) errors, where d* is the designed distance and m is the degree of the curve, was presented in an earlier work (see ibid., vol.35, p.811-21, 1989). It is now shown that this bound is the best possible for the algorithm considered View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A coded ARQ scheme with the generalized Viterbi algorithm

    Publication Year: 1993, Page(s):423 - 432
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    A coded automatic repeat request (ARQ) scheme based on a generalized Viterbi decoding algorithm is proposed. The scheme utilizes the error propagation, which is commonly observed in reduced-complexity decoding, as a means of error detection. It is shown that a small undetectable error probability is obtained with a small retransmission probability for a discrete memoryless channel, contrary to the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block-coded M-PSK modulation over GF(M)

    Publication Year: 1993, Page(s):337 - 346
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Channel codes where the redundancy is obtained not from parity symbols, but from expanding the channel signal-set, are addressed. They were initially proposed by G. Ungerboeck (1982) using a convolutional code. Here, a block coding approach is given. Rate m/(m+1) coded 2m+1-ary phase-shift keying (PSK) is considered. The expanded signal-set is given the structure of a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on the asymptotics of distributed detection with feedback

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

    The effect of feedback on the performance of a distributed Neyman-Pearson detection system consisting of n sensors, two-stage local quantizers, and a global detector is investigated. Two feedback schemes are discussed, only one of which yields an asymptotic gain in performance, as measured by an appropriate error exponent View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the reliability function of the ideal Poisson channel with noiseless feedback

    Publication Year: 1993, Page(s):491 - 503
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB)

    A coding scheme for the channel under peak power and average power constraints on the input is presented, and its asymptotic error exponent is shown to coincide, at all rates below capacity, with the sphere packing error exponent, which, for the case at hand, is known to be unachievable without feedback for rates below the critical rate. An upper bound on the error exponent achievable with feedbac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding for skew-tolerant parallel asynchronous communications

    Publication Year: 1993, Page(s):379 - 388
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    A communication channel consisting of several subchannels transmitting simultaneously and asynchronously is considered, an example being a board with several chips, where the subchannels are wires connecting the chips and differences in the lengths of the wires can result in asynchronous reception. A scheme that allows transmission without an acknowledgment of the message, therefore permitting pip... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Difference bases and sparse sensor arrays

    Publication Year: 1993, Page(s):716 - 721
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    Difference bases are discussed and their relevance to sensor arrays is described. Several new analytical difference base structures that result in near optimal low-redundancy sensor arrays are introduced. Algorithms are also presented for efficiently obtaining sparse sensor arrays and/or difference bases. New bounds, related to arrays that have both redundancies and holes in their coarray, are pre... 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