By Topic

IEEE Transactions on Information Theory

Issue 4 • Date Jul 1995

Filter Results

Displaying Results 1 - 25 of 38
  • On the capacity of the discrete-time Gaussian channel with delayed feedback

    Publication Year: 1995, Page(s):1051 - 1059
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    Gives an upper bound on the finite block length capacity of the discrete-time nonstationary Gaussian channel with delayed feedback. With the aid of minimization of a quadratic form, it is proved that the L time-delayed feedback capacity CnFBL(P) and the nonfeedback capacity Cn(P) satisfy Cn(P)⩽CnFBL(P)⩽Cn (P*) whe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bennett's integral for vector quantizers

    Publication Year: 1995, Page(s):886 - 900
    Cited by:  Papers (53)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1184 KB)

    This paper extends Bennett's (1948) integral from scalar to vector quantizers, giving a simple formula that expresses the rth-power distortion of a many-point vector quantizer in terms of the number of points, point density function, inertial profile, and the distribution of the source. The inertial profile specifies the normalized moment of inertia of quantization cells as a function of location.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blind adaptive multiuser detection

    Publication Year: 1995, Page(s):944 - 960
    Cited by:  Papers (903)  |  Patents (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1440 KB)

    The decorrelating detector and the linear minimum mean-square error (MMSE) detector are known to be effective strategies to counter the presence of multiuser interference in code-division multiple-access channels; in particular, those multiuser detectors provide optimum near-far resistance. When training data sequences are available, the MMSE multiuser detector can be implemented adaptively withou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proof of a conjecture of Sarwate and Pursley regarding pairs of binary m-sequences

    Publication Year: 1995, Page(s):1153 - 1155
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    Binary m-sequences are maximal length sequences generated by shift registers of length m, that are employed in navigation, radar, and spread-spectrum communications systems, because of their crosscorrelation properties. It is well known that given a pair of distinct m-sequences, the crosscorrelation function must take on at least three values. The article considers crosscorrelation functions that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comment on “A rate of convergence result for a universal D-semifaithful code”

    Publication Year: 1995, Page(s):1200 - 1202
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    In the above paper (see ibid., vol.39, no.3, p.813-20, 1993) Yu and Speed propose a universal pointwise D-semifaithful code whose expected compression ratio, for discrete memoryless sources, approaches the rate-distortion function at a rate O(n-1 log n). They also conjecture that this is the fastest achievable convergence rate for pointwise D-semifaithful codes. In this correspondence, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conditional entropy-constrained vector quantization: high-rate theory and design algorithms

    Publication Year: 1995, Page(s):901 - 916
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB)

    The performance of optimum vector quantizers subject to a conditional entropy constraint is studied. This new class of vector quantizers was originally suggested by Chou and Lookabaugh (1990). A locally optimal design of this kind of vector quantizer can be accomplished through a generalization of the well-known entropy-constrained vector quantizer (ECVQ) algorithm. This generalization of the ECVQ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Threshold detection in correlated non-Gaussian noise fields

    Publication Year: 1995, Page(s):976 - 1000
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1728 KB)

    Classical threshold detection theory for arbitrary noise and signals, based on independent noise samples, i.e., using only the first-order probability density of the noise, is generalized to include the critical additional statistical information contained in the (first-order) covariances of the noise. This is accomplished by replacing the actual, generalized noise by a “quasi-equivalent&rdq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable-rate tree-structured vector quantizers

    Publication Year: 1995, Page(s):917 - 930
    Cited by:  Papers (12)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    In general, growth algorithms for optimal tree-structured vector quantizers do not exist. In this paper we show that if the source satisfies certain conditions; namely, that of diminishing marginal returns; optimal growth algorithms do exist. We present such an algorithm and compare its performance with that of other tree growth algorithms. Even for sources that do not meet the necessary condition... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new construction for n-track (d, k) codes with redundancy

    Publication Year: 1995, Page(s):1107 - 1115
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A new construction for n-track (d, k) codes with redundancy r, referred to as (d, k; n, r) codes, is presented. This construction applies single-track (d, k+Δk) codes (with certain extra constraints and appropriate amounts of delay) on each of the n tracks. This construction achieves a large part of the capacity increases possible when using (d, k; n, r) codes, has simple encoders and decode... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiuser signaling in the symbol-synchronous AWGN channel

    Publication Year: 1995, Page(s):1174 - 1178
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    Multiuser signal set design for the energy-constrained linear real-additive symbol-synchronous additive white Gaussian noise channel is investigated in this correspondence. An argument is presented showing the suboptimality of binary alphabets which, in turn, uncovers a rule for the formation of multiuser signal sets. This simple rule leads to a theorem stating the dimensionality at which addition... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symmetric capacity and signal design for L-out-of-K symbol-synchronous CDMA Gaussian channels

    Publication Year: 1995, Page(s):1072 - 1082
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    We consider the symbol-synchronous Gaussian L-out-of-K code-division multiaccess channel, and obtain the capacity region and the upper and lower bounds to the symmetric capacity. The capacity region is found to be the same with or without frame synchronism. The lower bound depends on the signature waveforms through the eigenvalues of the SNR-weighted crosscorrelation matrix. We find a sufficient c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Invertibility conditions of a class of moment matrices and applications

    Publication Year: 1995, Page(s):1196 - 1199
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    We consider a multivariable polynomial with random variables as arguments. All the monoids of this polynomial are arranged to define a random vector for which we study the correlation matrix. We establish necessary and sufficient invertibility conditions of this matrix, and investigate some applications View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear filters for linear models (a robust approach)

    Publication Year: 1995, Page(s):1001 - 1009
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    We consider the altering problem for linear models where the driving noises may be quite general, nonwhite and non-Gaussian, and where the observation noise may only be known to belong to a finite family of possible disturbances. Using diffusion approximation methods, we show that a certain nonlinear filter minimizes the asymptotic filter variance. This nonlinear filter is obtained by choosing at ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistics of the binary quantizer error in single-loop sigma-delta modulation with white Gaussian input

    Publication Year: 1995, Page(s):931 - 943
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    Representations and statistical properties of the process e¯ defined by e¯n+1=λ(e¯nn ), are given. Here λ(u):=u-b·sign(u)+m and {ξn}n=0+∞ is Gaussian white noise. The process e¯ represents the binary quantizer error in a model for single-loop sigma-delta modulation. The innovati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-correcting two-dimensional modulation codes

    Publication Year: 1995, Page(s):1116 - 1126
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB)

    Modulation coding, to limit the number of consecutive zeros in a data stream, is essential in digital magnetic recording/playback systems. Additionally, such systems require error-correction coding to ensure that the decoded output matches the recorder input, even if noise is present. Typically, these two coding steps have been performed independently, although various methods of combining them in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On calculating Sakrison's rate distortion function for classes of parameterized sources

    Publication Year: 1995, Page(s):1160 - 1163
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    Sakrison extended Shannon's notion of the rate distortion function to parameterized classes of sources by taking a minimax approach and defining a measure of the minimum rate required for information reconstruction subject to a prescribed fidelity level D. Unfortunately, calculation of Sakrison's rate distortion function may be very difficult because analytic solutions do not generally exist and t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MMSE decision-feedback equalizers: finite-length results

    Publication Year: 1995, Page(s):961 - 975
    Cited by:  Papers (189)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 KB)

    This paper extends a number of results on the infinite-length minimum-mean-square-error decision Feedback equalizer (MMSE-DFE) reported by Cioffi, Dudevoir, Eyuboglu and Forney (see IEEE Trans. Commun., 1995) to the finite-length case. Cholesky factorization and displacement structure theory are demonstrated to be two powerful analytical tools for analyzing the finite-length MMSE-DFE. Our objectiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robustness of decentralized tests with ϵ-contamination prior

    Publication Year: 1995, Page(s):1164 - 1169
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    We consider a decentralized detection problem where the prior density is not completely known, but is assumed to belong to an ε-contamination class. The expressions for the infimum and the supremum of the posterior probability that the parameter under question is in a given region, as the prior varies over the ε-contamination class, are derived. Numerical results are obtained for a speci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sup-norm approximation bounds for networks through probabilistic methods

    Publication Year: 1995, Page(s):1021 - 1027
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    We consider the problem of approximating a smooth target function and its derivatives by networks involving superpositions and translations of a fixed activation function. The approximation is with respect to the sup-norm and the rate is shown to be of order O(n-1/2); that is, the rate is independent of the dimension d. The results apply to neural and wavelet networks and extend the wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple strategy for constructing a class of DC-free error-correcting codes with minimum distance 4

    Publication Year: 1995, Page(s):1134 - 1137
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    A class of DC-free codes with minimum distance 4 which offer very simple encoding and decoding procedures is presented. Spectral analysis shows that in addition to being DC-free they offer strong spectral suppression at low frequencies. A comparison with similar codes in the literature shows that they provide a good compromise solution to the design of practically realizable, high-rate, DC-free er... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Superimposed codes for the multiaccess binary adder channel

    Publication Year: 1995, Page(s):1178 - 1182
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    Superimposed codes for multiple-access communication in a binary adder channel are analyzed. The superposition mechanism used in this correspondence is ordinary addition. Each user is assigned a codeword from a superimposed code. It is proved that every constant-weight code C of weight w and maximal correlation c corresponds to a subclass of a disjunctive code D of order m<w/c. Therefore, any m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials

    Publication Year: 1995, Page(s):873 - 885
    Cited by:  Papers (15)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    The problem of decoding cyclic error correcting codes is one of solving a constrained polynomial congruence, often achieved using the Berlekamp-Massey or the extended Euclidean algorithm on a key equation involving the syndrome polynomial. A module-theoretic approach to the solution of polynomial congruences is developed here using the notion of exact sequences. This technique is applied to the We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A coset correlation for sequences with two-valued periodic autocorrelation

    Publication Year: 1995, Page(s):1150 - 1153
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    Defines a new coset correlation that generalizes previous coset correlation results for m-sequences. This new correlation can be computed in terms of the coset sizes for any sequence that has a two-valued periodic autocorrelation function and that is constant on cosets. Thus the results apply to a larger family of periodic sequences than just m-sequences View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiresolution analysis of a class of nonstationary processes

    Publication Year: 1995, Page(s):1010 - 1020
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    Processing nonstationary signals is an important and challenging problem. We focus on the class of nonstationary processes with stationary increments of an arbitrary order, and place them in a multiscale framework. Unlike other related studies, we concentrate on the discrete-time analysis and derive a number of new results in addition to placing the related existing ones in the same framework. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A counterexample to a Voronoi region conjecture

    Publication Year: 1995, Page(s):1195 - 1196
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    Given a 2D-symmetric lattice Λ, it was conjectured by Forney (1989) that the projection of the Voronoi region R(Λ) onto two coordinates equals the Voronoi region of the constituent 2D-sublattice Λν2. We present a three-dimensional counterexample 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