IEEE Transactions on Information Theory

Issue 7 • Nov. 1998

Filter Results

Displaying Results 1 - 25 of 42
  • Adaptive blind source separation and equalization for multiple-input/multiple-output systems

    Publication Year: 1998, Page(s):2864 - 2876
    Cited by:  Papers (62)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    In this paper, we investigate adaptive blind source separation and equalization for multiple-input/multiple-output (MIMO) systems. We first analyze the convergence of the constant modulus algorithm (CMA) used in MIMO systems (MIMO-CMA). Our analysis reveals that the MIMO-CMA equalizer is able to recover one of the input signals, remove the intersymbol interference (ISI), and suppress the other inp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Acknowledgment [on the inability to generalize results of "Multiterminal source coding achievable rates and reliability"]

    Publication Year: 1998, Page(s): 3177
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (30 KB)

    The results of the article "Multiterminal source coding achievable rates and reliability" (IEEE Trans. Inform. Theory, vol. 42, pp. 2094??2101, Nov. 1996) proved to be correct only in very particular cases. The author is grateful to R. Ahlswede and N. Cai for a counterexample, to I. Csiszar as well as T. Berger for letters to the author with remarks on the subject. My persistent and prolonged atte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 1996-1998 Index IEEE Transactions on Information Theory Vols. 42-44 - Author Index

    Publication Year: 1998, Page(s):3185 - 3201
    Request permission for commercial reuse | PDF file iconPDF (411 KB)
    Freely Available from IEEE
  • Subject index

    Publication Year: 1998, Page(s):3201 - 3252
    Request permission for commercial reuse | PDF file iconPDF (693 KB)
    Freely Available from IEEE
  • Random sequence multisets for synchronous code-division multiple-access channels

    Publication Year: 1998, Page(s):2832 - 2836
    Cited by:  Papers (61)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    The effect of using randomly selected sequence multisets for the uplink of a synchronous code-division multiple-access channel is considered. A tight lower bound on the expected value of the sum capacity over the ensemble of randomly selected sequence multisets is given. For large systems, the sum rate penalty for using randomly selected multisets is shown to be at most 1 nat and to vanish as the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiaccess fading channels. II. Delay-limited capacities

    Publication Year: 1998, Page(s):2816 - 2831
    Cited by:  Papers (297)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    For pt.I see ibid., vol.44, no.7, p.2796-815 (1998). In multiaccess wireless systems, dynamic allocation of resources such as transmit power, bandwidths, and rates is an important means to deal with the time-varying nature of the environment. We consider the problem of optimal resource allocation from an information-theoretic point of view. We focus on the multiaccess fading channel with Gaussian ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stationary Markov random fields on a finite rectangular lattice

    Publication Year: 1998, Page(s):2901 - 2916
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (non-toroidal) lattice in the basic case of a second-order neighborhood system. Equivalently, it characterizes stationary Markov fields on Z2 whose restrictions to finite rectangular subsets are still Markovian (i.e., even on the boundaries). Until now, Pickard random fields formed... 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: 1998, Page(s):3168 - 3175
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    In this correspondence we apply a recent inequality by de Caen (1997) to derive a lower bound on the probability of error for M-ary signals derived from a binary linear code and used on the additive white Gaussian noise channel with a maximum-likelihood decoder. This bound depends only on the weight enumerator of the code and the signal-to-noise ratio Eb/N0. We show that this... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities

    Publication Year: 1998, Page(s):2796 - 2815
    Cited by:  Papers (650)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (924 KB)

    In multiaccess wireless systems, dynamic allocation of resources such as transmit power, bandwidths, and rates is an important means to deal with the time-varying nature of the environment. We consider the problem of optimal resource allocation from an information-theoretic point of view. We focus on the multiaccess fading channel with Gaussian noise, and define two notions of capacity depending o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the infeasibility of training neural networks with small mean-squared error

    Publication Year: 1998, Page(s):2892 - 2900
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    We demonstrate that the problem of training neural networks with small mean-squared error is computationally intractable. This answers a question posed by Jones (1997) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some new disjoint Golomb rulers

    Publication Year: 1998, Page(s):3151 - 3153
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Let a Golomb ruler be a set {ai} of integers so that all the differences ai-aj, i≠j, are distinct. Let H(I.J) be the smallest n such that there are I disjoint Golomb rulers each containing J elements chosen from {1,2,...n}. In 1990, Klove gave a table of bounds on H(I,J). In this correspondence we improve and extend this table with results found by computer sear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis of the timed Z-channel

    Publication Year: 1998, Page(s):3162 - 3168
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    Golomb analyzed the Z-channel, a memoryless channel with two input symbols and two output symbols, where one of the input symbols is transmitted with noise while the other is transmitted without noise, and the output symbol transmission times are equal. We generalize to the timed Z-channel, where the output symbol transmission times are not equal. The timed Z-channel appears as the basis for a lar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An information-spectrum approach to capacity theorems for the general multiple-access channel

    Publication Year: 1998, Page(s):2773 - 2795
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1768 KB)

    The paper deals with the capacity problems for the general multiple-access channel, where the channel transition probabilities are arbitrary for every blocklength n. The approach used here, which is called the information-spectrum approach, is quite different from the standard typical-sequence and/or AEP techniques. The general formula for the capacity region for the general multiple-access channe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The blind simulation problem and regenerative processes

    Publication Year: 1998, Page(s):2877 - 2891
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    Blind simulation techniques are Monte Carlo simulation strategies that can be carried out with little or no knowledge of the underlying probability law. We first show (in the independent and identically distributed setting) that by a strategy of selectively throwing away data samples, we can achieve arbitrarily close to the optimal performance gains promised by the importance sampling strategy kno... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On integer-valued rational polynomials and depth distributions of binary codes

    Publication Year: 1998, Page(s):3146 - 3150
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    The notion of the depth of a binary sequence was introduced by Etzion. In this correspondence we show that the set of infinite sequences of finite depth corresponds to a set of equivalence classes of rational polynomials. We go on to characterize infinite sequences of finite depth in terms of their periodicity. We conclude by giving the depth distributions for all linear cyclic codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error probability for block codes over channels with block interference

    Publication Year: 1998, Page(s):2998 - 3008
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    A methodology is presented to evaluate analytically the error probability for block codes over block interference channels. The proposed analysis is based on the knowledge of the moments of the bit-error probability over the interference, thus allowing, for instance, fast performance evaluation of block-coded slow frequency hopping (SFH) systems with antenna diversity over fading channels. As an e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of shapes for precise image registration

    Publication Year: 1998, Page(s):3156 - 3162
    Cited by:  Papers (15)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    This correspondence deals with the problem of designing planar shapes for subpixel image registration. Basic theoretical considerations are shown to lead to a lower bound on location accuracy. Optimal registration marks achieving this bound are discussed. These optimal designs, however, require very high printing or etching resolution and are inherently very sensitive to variations in the image sa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bit-error probability for maximum-likelihood decoding of linear block codes and related soft-decision decoding methods

    Publication Year: 1998, Page(s):3083 - 3090
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    In this correspondence, the bit-error probability Pb for maximum-likelihood decoding of binary linear block codes is investigated. The contribution Pb(j) of each information bit j to Pb is considered and an upper bound on Pb(j) is derived. For randomly generated codes, it is shown that the conventional approximation at high SNR Pb≈(dH<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the volume of the Minkowski sum of line sets and the entropy-power inequality

    Publication Year: 1998, Page(s):3039 - 3043
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    We derive a version of the Brunn-Minkowski inequality which gives a nontrivial lower bound on the volume of the Minkowski sum of degenerate sets, namely, line sets. This inequality parallels a recently obtained matrix generalization of the entropy-power inequality View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Double circulant self-dual codes over Z2k

    Publication Year: 1998, Page(s):3105 - 3123
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    Recently there has been tremendous interest in self-dual codes over finite rings, specifically the rings Z2k. In this paper, we investigate double circulant self-dual codes over Z2k for small k and short lengths. In particular, we give a classification of the extremal double circulant codes. Using invariant theory, a basis for the space of invariants to which the Hamming weig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Voronoi neighbor ratio for binary linear block codes

    Publication Year: 1998, Page(s):3064 - 3072
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    Soft-decision decoding of block codes is regarded as the geometrical problem of identifying the Voronoi region within which a given input vector lies. A measure, called the neighbor ratio, is proposed to characterize how many facets a Voronoi region has. Theory and algorithms are presented to determine the neighbor ratio for binary linear block codes and results are given for several types of code... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perfect byte-correcting codes

    Publication Year: 1998, Page(s):3140 - 3146
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    We present a few new constructions for perfect linear single byte-correcting codes. These constructions generate some perfect single byte-correcting codes with new parameters, and some perfect single byte-correcting codes with known parameters and simpler presentation and implementation over the known codes. It is also shown that nonequivalent perfect linear single byte-correcting codes exist when... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multihead detection for multitrack recording channels

    Publication Year: 1998, Page(s):2988 - 2997
    Cited by:  Papers (40)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    We look at multiple-track detection for magnetic recording systems that use array heads to write and read over multiple tracks simultaneously. The recording channel is modeled as having intersymbol interference (ISI) in the axial direction, and intertrack interference (ITI) in the radial direction. Optimum multihead and single-head detectors are derived and analyzed in terms of error-probability p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coded asynchronous CDMA and its efficient detection

    Publication Year: 1998, Page(s):2837 - 2847
    Cited by:  Papers (14)  |  Patents (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    In this paper, receiver design and performance analysis for coded asynchronous code-division multiple access (CDMA) systems is considered. The receiver front-end consists of the near-far resistant multiuser detector known as the projection receiver (PR). The PR performs multiple-access interference resolution and is followed by error-control decoding. The output of the projection receiver yields t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information bounds and quick detection of parameter changes in stochastic systems

    Publication Year: 1998, Page(s):2917 - 2929
    Cited by:  Papers (127)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    By using information-theoretic bounds and sequential hypothesis testing theory, this paper provides a new approach to optimal detection of abrupt changes in stochastic systems. This approach not only generalizes previous work in the literature on optimal detection far beyond the relatively simple models treated but also suggests alternative performance criteria which are more tractable and more ap... 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