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
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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 (14)
    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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Fast iterative coding techniques for feedback channels

    Publication Year: 1998, Page(s):2960 - 2976
    Cited by:  Papers (20)
    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.
  • 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.
  • 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.
  • A minimum discrepancy estimator in parameter estimation

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

    In statistical estimation theory, a satisfactory estimator should be able to embody a large portion of the available information, which may be known a priori or provided by the data. Hence, the loss of information is minimum when this estimator is employed. In previous work, an estimator criterion based on the discrepancy between the estimator's error covariance and its information lower bound was... 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.
  • 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.
  • 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.
  • 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.

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