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 (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
  • A new trellis source code for memoryless sources

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

    The trellis-based scalar-vector quantizer (TB-SVQ) for memoryless sources combines the scalar-vector quantizer (SVQ) with trellis coded quantization (TCQ) to achieve both boundary gain and granular gain. The resulting quantizer outperforms all other reasonable complexity fixed-rate quantizers. Unfortunately, the resulting code is catastrophic-a single bit error within a block can propagate indefin... 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.
  • 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.
  • 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.
  • 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 (4)
    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.
  • 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.
  • 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.
  • Analysis and design of trellis codes optimized for a binary symmetric Markov source with MAP detection

    Publication Year: 1998, Page(s):2977 - 2987
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (456 KB)

    We consider the problem of transmitting a binary symmetric Markov source (BSMS), over the additive white Gaussian noise (AWGN) channel. The coding technique considered is trellis-coded modulation (TCM), where we utilize decoders which implement the maximum-likelihood (ML) and maximum a posteriori (MAP) criteria. Employing 8-PSK Ungerboeck codes on a BSMS with state transition probability 0.1, we f... 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.
  • Error probability for block codes over channels with block interference

    Publication Year: 1998, Page(s):2998 - 3008
    Cited by:  Papers (39)
    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.
  • Efficient heuristic search algorithms for soft-decision decoding of linear block codes

    Publication Year: 1998, Page(s):3023 - 3038
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (804 KB)

    Efficient new algorithms are presented for maximum-likelihood and suboptimal soft-decision decoding algorithms for linear block codes. The first algorithm, MA*, improves the efficiency of the A* decoding algorithm, conducting the heuristic search through a code tree while exploiting code-specific properties. The second algorithm, H*, reduces search space by successively estimating the cost of the ... 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.
  • Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities

    Publication Year: 1998, Page(s):2796 - 2815
    Cited by:  Papers (667)  |  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.
  • Correlation-based testing for the convergence of decision feedback equalizers

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

    It has been thought that convergence tests developed for linear decision-directed equalizers based on the correlation matching criterion may not be directly applicable to decision feedback equalizers (DFE's). Indeed, the correlation-based convergence criteria proved for linear equalizers have so far been accepted as conjectural for DFE's. In this correspondence we show that identical channel input... 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.
  • 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.
  • A new treatment of priority-first search maximum-likelihood soft-decision decoding of linear block codes

    Publication Year: 1998, Page(s):3091 - 3096
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (248 KB)

    In this correspondence we present a new method to convert the maximum-likelihood soft-decision decoding problem for linear block codes into a graph search problem where the generalized Dijkstra's algorithm can still be applied to the decoding procedure. The cost assigned to every branch in the graph is based on a generalization of the Wagner rule which is an equivalent form of the maximum-likeliho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast iterative coding techniques for feedback channels

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

    A class of capacity-achieving, low-complexity, high-reliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noiseless feedback. Algorithms for encoding and decoding that require computations growing linearly with the number of channel inputs used are developed. The error exponent associated with the scheme is shown to be optimal and implies t... 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.
  • Information bounds and quick detection of parameter changes in stochastic systems

    Publication Year: 1998, Page(s):2917 - 2929
    Cited by:  Papers (138)
    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.
  • 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