By Topic

IEEE Transactions on Information Theory

Issue 2 • Date 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 (40)  |  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.
  • Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder

    Publication Year: 1993, Page(s):640 - 643
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    BCH decoders based on the Peterson-Gorenstein-Zierler algorithm can malfunction and produce output vectors that are no codewords. To avoid this malfunction a simple additional check is proposed that can be performed before the computation of the error locations. The additional check consists of the minimum number of algebraic equations in the syndrome components that are necessary over a general f... 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 (11)
    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 converse theorem in statistical hypothesis testing for Markov chains

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

    Hypothesis testing for two Markov chains is considered. Under the constraint that the error probability of the first kind is less than or equal to exp(-rn), the error probability of the second kind is minimized. The geodesic that connects the two Markov chains is defined. By analyzing the geodesic, the power exponents are calculated and then represented in terms of Kullback-Leibler diverg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the converse theorem in statistical hypothesis testing

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

    Simple statistical hypothesis testing is investigated by making use of the divergence geometric method. The asymptotic behavior of the minimum value of the error probability of the second kind under the constraint that the error probability of the first kind is bounded above by exp(-rn) is looked for, where r is a given positive number. If r is greater than the divergenc... 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 (42)  |  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.
  • Perfect (d,k)-codes capable of correcting single peak-shifts

    Publication Year: 1993, Page(s):656 - 662
    Cited by:  Papers (30)  |  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.
  • 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.
  • Difference bases and sparse sensor arrays

    Publication Year: 1993, Page(s):716 - 721
    Cited by:  Papers (34)
    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.
  • Decentralized sequential detection with a fusion center performing the sequential test

    Publication Year: 1993, Page(s):433 - 442
    Cited by:  Papers (98)
    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.
  • 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.
  • Modified Gold codes

    Publication Year: 1993, Page(s):654 - 656
    Cited by:  Papers (9)
    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.
  • Uniform switching system by families of switching sets

    Publication Year: 1993, Page(s):479 - 490
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    A new mathematical method in coding theory that is applicable to various practical problems in communication systems is introduced. The uniform switching system based on k-sets is defined, and its cardinalities, an index system, and error correctabilities are studied. The cardinalities of a uniform switching system based on general families of switching sets are discussed. The asymptotic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The cutoff rate of time correlated fading channels

    Publication Year: 1993, Page(s):612 - 617
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    The cutoff rate of Rician and Rayleigh channels characterized by time correlated fading is derived for M-ary phase shift keying (MPSK) modulation. It is useful for situations where perfect interleaving cannot be achieved. It indicates the practical achievable information rate of the channel when coding is employed. It is used to determine the potential coding gains of coded modulation ove... 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.
  • A coded ARQ scheme with the generalized Viterbi algorithm

    Publication Year: 1993, Page(s):423 - 432
    Cited by:  Papers (3)
    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.
  • 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.
  • Minimum support weights of binary codes

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

    Some relations between the minimum support weights are discussed. In particular, the possible weight hierarchies of codes of dimension 4 are determined View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic server allocation to parallel queues with randomly varying connectivity

    Publication Year: 1993, Page(s):466 - 478
    Cited by:  Papers (306)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    Consider N parallel queues competing for the attention of a single server. At each time slot each queue may be connected to the server or not depending on the value of a binary random variable, the connectivity variable. Allocation at each slot; is based on the connectivity information and on the lengths of the connected queues only. At the end of each slot, service may be completed with ... 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 (20)  |  Patents (10)
    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.
  • Valid parameter space of 2-D Gaussian Markov random fields

    Publication Year: 1993, Page(s):703 - 709
    Cited by:  Papers (13)  |  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.
  • On the minimum distance of ternary cyclic codes

    Publication Year: 1993, Page(s):409 - 422
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    There are many ways to find lower bounds for the minimum distance of a cyclic code, based on investigation of the defining set. Some new theorems are derived. These and earlier techniques are applied to find lower bounds for the minimum distance of ternary cyclic codes. Furthermore, the exact minimum distance of ternary cyclic codes of length less than 40 is computed numerically. A table is given ... 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 (10)
    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.
  • 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.
  • Coding for skew-tolerant parallel asynchronous communications

    Publication Year: 1993, Page(s):379 - 388
    Cited by:  Papers (12)  |  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.

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
Frank R. Kschischang

Department of Electrical and Computer Engineering