IEEE Transactions on Information Theory

Volume 44 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 (63)  |  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
  • Detection techniques for fading multipath channels with unresolved components

    Publication Year: 1998, Page(s):2848 - 2863
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    In this paper we consider noncoherent detection structures for multipath Ricean/Rayleigh fading channels. The multipath components are assumed to be unresolved, with known delays. These delays could have been estimated, for example, by using super-resolution techniques or sounding the channel with a wide-band pulse. We show that the Rayleigh channel optimum receiver (R OPT) consists of an “o... 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 (44)
    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.
  • 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 (302)  |  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.
  • 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.
  • Minimization criteria for frequency planning in cellular radio systems

    Publication Year: 1998, Page(s):3175 - 3177
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    We ask whether the minimization criteria used in graph-based frequency-assignment algorithms are necessarily dependent upon how the corresponding interference data is interpreted, and show that any sensible interpretation of interference data allows a very simple “interference sum minimization” to be used as an appropriate criterion 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 (5)
    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.
  • Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities

    Publication Year: 1998, Page(s):2796 - 2815
    Cited by:  Papers (667)  |  Patents (5)
    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.
  • Some new disjoint Golomb rulers

    Publication Year: 1998, Page(s):3151 - 3153
    Cited by:  Papers (15)
    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.
  • Cross-entropy and iterative decoding

    Publication Year: 1998, Page(s):3097 - 3104
    Cited by:  Papers (26)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    In this correspondence, the relationship between iterative decoding and techniques for minimizing cross-entropy is explained. It is shown that minimum cross-entropy (MCE) decoding is an optimal lossless decoding algorithm but its complexity limits its practical implementation. Use of a maximum a posteriori (MAP) symbol estimation algorithm instead of the true MCE algorithm provides practical algor... 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.
  • Bounded-distance decoding: algorithms, decision regions, and pseudo nearest neighbors

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

    For a code C, bounded distance decoding algorithms perform as optimal algorithms within the balls B(c), centered at the codewords c∈C, with radius equal to half the minimum Euclidean distance of the code. Thus distinct bounded-distance algorithms vary in performance due to their different behavior outside the balls B(c). We investigate this issue by analyzing the decision regions of some know... 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 (17)
    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.
  • A multistage representation of the Wiener filter based on orthogonal projections

    Publication Year: 1998, Page(s):2943 - 2959
    Cited by:  Papers (483)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    The Wiener filter is analyzed for stationary complex Gaussian signals from an information theoretic point of view. A dual-port analysis of the Wiener filter leads to a decomposition based on orthogonal projections and results in a new multistage method for implementing the Wiener filter using a nested chain of scalar Wiener filters. This new representation of the Wiener filter provides the capabil... 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 (36)
    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.
  • Tradeoff between source and channel coding on a Gaussian channel

    Publication Year: 1998, Page(s):3044 - 3055
    Cited by:  Papers (21)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    Consider a system that quantizes and encodes analog data for transmission across an additive noise Gaussian channel. To minimize distortion, the channel code rate must be chosen to optimally allocate the available transmission rate between lossy source coding and block channel coding. We establish tight upper and lower bounds on the channel code rate that minimizes the average distortion of a vect... 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.
  • A simple one-sweep algorithm for optimal APP symbol decoding of linear block codes

    Publication Year: 1998, Page(s):3124 - 3129
    Cited by:  Papers (27)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    Soft-input/soft-output symbol decoding plays a significant role in iterative decoding. We propose a simple optimal soft-input/soft-output symbol decoding algorithm for linear block codes which requires one forward recursion using a trellis. For many codes the decoding complexity is lower than previous methods, such as the algorithm by Bahl et al. (1974), and the decrease is shown at its most when ... 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 (15)
    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.
  • An information-spectrum approach to capacity theorems for the general multiple-access channel

    Publication Year: 1998, Page(s):2773 - 2795
    Cited by:  Papers (24)
    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.
  • On balanced binary sequences with two-level autocorrelation functions

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

    Recently, Maschietti (Des., Codes Cryptogr., vol.14, p.89, 1998) constructed several families of (2m-1,2m-1-1,2m-2-1) cyclic difference sets from monomial hyperovals. In this correspondence, we consider the binary sequences associated to the difference sets constructed by Maschietti. We give algebraic proof of the fact that these sequences have two-level autocorrel... 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