IEEE Transactions on Information Theory

Volume 41 Issue 1 • Jan. 1995

Filter Results

Displaying Results 1 - 25 of 39
  • Comments on "Degradation of signal-to-noise ratio due to amplitude ripple

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (82 KB)

    Sadr, Shahshahani, and Hurd (see ibid., vol.35, no.4, p.874, 1989) studied the effect of filtering on the signal-to-noise ratio (SNR) of a coherently demodulated bandlimited signal and found the worst case amplitude ripple. They showed that when the maximum passband amplitude ripple is 2/spl Delta/, then the signal-to-noise ratio is degraded by at most (1-/spl Delta//sup 2/). A very simple proof i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Averaging entropy

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

    It is pointed out that a uniform distribution on probability n-tuples is not necessarily the best distribution to use in calculating an average entropy. The noninformative prior of Bayesian statistics and certain-distributions which arise in differential-geometry approaches to statistics are other candidates. The mean and variance of the entropy are calculated when probability n-tuples are distrib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive filtering and smoothing for reciprocal Gaussian processes-pinned boundary case

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

    The least square estimation problem for pinned-to-zero discrete-index reciprocal Gaussian processes in additive white noise is solved, thus completing and extending some previous results available in the literature. In particular, following the innovations approach a (finite) set of recursive equations is obtained for the filter and for the three standard classes of smoothers (fixed-point, fixed-i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blind channel identification based on second-order statistics: a frequency-domain approach

    Publication Year: 1995, Page(s):329 - 334
    Cited by:  Papers (183)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (517 KB)

    In this communication, necessary and sufficient conditions are presented for the unique blind identification of possibly nonminimum phase channels driven by cyclostationary processes. Using a frequency domain formulation, it is first shown that a channel can be identified by the second-order statistics of the observation if and only if the channel transfer function does not have special uniformly ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Echo canceler performance analysis in four-wire loop systems with correlated AR subscriber signals

    Publication Year: 1995, Page(s):322 - 328
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    By using a simple example we illustrate the effect of autocorrelation and cross correlation of subscriber signals on the achievable performance of adaptive echo cancelers in a four-wire telephone network.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Remarks on linear and nonlinear filtering

    Publication Year: 1995, Page(s):317 - 322
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (538 KB)

    This communication tries to give some insight into relationships existing between Viterbi and the forward-backward algorithm (used in the context of hidden Markov models) on the one hand and Kalman filtering and Rauch-Tung Striebel smoothing on the other. We give a unifying view which shows how those algorithms are related and give an example of a nonlinear hybrid system that can be filtered throu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum-likelihood estimation of a class of chaotic signals

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

    The chaotic sequences corresponding to tent map dynamics are potentially attractive in a range of engineering applications. Optimal estimation algorithms for signal filtering, prediction, and smoothing in the presence of white Gaussian noise are derived for this class of sequences based on the method of maximum likelihood. The resulting algorithms are highly nonlinear but have convenient recursive... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On blind identifiability of multipath channels using fractional sampling and second-order cyclostationary statistics

    Publication Year: 1995, Page(s):308 - 311
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB)

    The problem of blind identifiability of digital communication multipath channels using fractionally spaced samples is considered. Fractionally sampled data are cyclostationary rather than stationary. The problem is cast into a mathematical framework of parameter estimation for a vector stationary process with single input (information sequence) and multiple outputs, by using a time-series represen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes

    Publication Year: 1995, Page(s):304 - 308
    Cited by:  Papers (40)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (438 KB)

    Constructs Reed-Muller codes by generalized multiple concatenation of binary block codes of length 2. As a consequence of this construction, a new decoding procedure is derived that uses soft-decision information. The algorithm is designed for low decoding complexity and is applicable to all Reed-Muller codes. It gives better decoding performance than soft-decision bounded-distance decoding. Its d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Existence and nonexistence of almost-perfect autocorrelation sequences

    Publication Year: 1995, Page(s):301 - 304
    Cited by:  Papers (32)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (399 KB)

    Shows that almost perfect autocorrelation sequences are the same as certain cyclic divisible difference sets. The authors apply known theorems on divisible difference sets to simplify and strengthen results by J. Wolfmann [1992]. In particular, they answer two questions which were posed by Wolfman.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized Hamming weights of BCH(3) revisited

    Publication Year: 1995, Page(s):300 - 301
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    Determines the first five generalized Hamming weights of 3-error-correcting primitive binary BCH-codes.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the worst case probability of undetected error

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

    Upper and lower bounds on the average worst-case probability of undetected error for linear [n,k,q] codes are given.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deciding multiset decipherability

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

    An O(n/sup 2/L) time and O((n+k)L) space algorithm is provided for deciding whether or not a finite set C consisting of n words having total length L, where all words are taken over a k-element alphabet, is a multiset decipherable code. The algorithm is based on a technique related to dominoes. At an easily stage it decides in O(nL) time and O((n+k)L) space whether or not the set C is uniquely dec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum average cost testing for partially ordered components

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

    The problem of designing a sequence of optimal binary tests for the identification of a single faulty component is addressed. For components in linear order this is equivalent to the classical alphabetic coding problem solved by Hu and Tucker (1971). For partially ordered components the problem is solved by reduction to a minimization over a set of alphabetic problems.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions of almost block-decodable runlength-limited codes

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

    Describes a new technique for constructing fixed-length (d,k) runlength-limited block codes. The new codes are very close to block-decodable codes, as decoding of the retrieved sequence can be accomplished by observing (part of) the received codeword plus a very small part (usually only a single bit) of the previous codeword. The basic idea of the new construction is to uniquely represent each sou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes correcting a single insertion/deletion of a zero or a single peak-shift

    Publication Year: 1995, Page(s):279 - 283
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (433 KB)

    Codes of (d,k) sequences of constant Hamming weight are considered. Perfect codes correcting a single insertion, deletion, or peak-shift are defined and shown to exist. A systematic method to construct large classes of perfect codes is given. A number of related problems are considered.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correcting a specified set of likely error patterns

    Publication Year: 1995, Page(s):272 - 279
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (837 KB)

    The main concern of this article is to find linear codes which will correct a set of arbitrary error patterns. Although linear codes which have been designed for correcting random error patterns and burst error patterns can be used, we would like to find codes which will correct a specified set of error patterns with the fewest possible redundant bits. Here, to reduce the complexity involved in fi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packing radius, covering radius, and dual distance

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

    Tietaivainen (1991) derived an upper bound on the covering radius of codes as a function of the dual distance. This was generalized to the minimum distance, and to Q-polynomial association schemes by Levenshtein and Fazekas. Both proofs use a linear programming approach. In particular, Levenshtein and Fazekas (1990) use linear programming bounds for codes and designs. In this article, proofs relyi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Second-order time-frequency synthesis of nonstationary random processes

    Publication Year: 1995, Page(s):255 - 267
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1151 KB)

    We present time-frequency methods for the synthesis of finite-energy, nonstationary random processes. The energetic characteristics of the process to be synthesized are specified in a joint time-frequency domain via a time-frequency model function. The synthesis methods optimize the autocorrelation function of the process such that the process' Wigner-Ville spectrum is closest to the given model f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blind identifiability of a quadratic stochastic system

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

    Quadratic systems appear in various fields of signal processing, in particular in detection and estimation. In this paper, we establish some conditions to determine the order and identify the coefficients of any discrete and finite extent quadratic system driven by a sequence of independent and identically distributed random variables. The input sequence is assumed unobservable and the conditions ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On estimating the spectral exponent of fractional Brownian motion

    Publication Year: 1995, Page(s):233 - 244
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1022 KB)

    Three estimators of the exponent /spl alpha/ in the power spectral density g(/spl lambda/)=c/sub g/|/spl lambda/|/sup -/spl alpha// of fractional Brownian motion are evaluated. These are (i) the periodogram-based estimator /spl alpha//spl circ//sub PG/ (ii) the maximum likelihood estimator /spl alpha//spl circ//sub ML/; and (iii) the Allan (1966) variance-based estimator /spl alpha//spl circ//sub ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic theory of mixed time averages and kth-order cyclic-moment and cumulant statistics

    Publication Year: 1995, Page(s):216 - 232
    Cited by:  Papers (201)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1341 KB)

    We generalize Parzen's (1961) analysis of "asymptotically stationary" processes to mixtures of deterministic, stationary, nonstationary, and generally complex time series. Under certain mixing conditions expressed in terms of joint cumulant summability, we show that time averages of such mixtures converge in the mean-square sense to their ensemble averages. We additionally show that sample average... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantization in multisensor random signal detection

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

    Optimum detection schemes based on quantized data are of great interest in radar and sonar applications. The design and properties of multisensor schemes are considered here for detection of weak random signals in additive, possibly non-Gaussian, noise. Signal-to-noise ratios are assumed unknown and the signals at the different sensors may be statistically dependent. Analytical expressions describ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the relationship between measures of discrimination and the performance of suboptimal detectors

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

    The problem of designing and analyzing suboptimal detectors via statistical distance measures is considered. As a preliminary result, we show that only the minimum and maximum probability of error are valid measures of discrimination between the input statistics. This result would seem then to imply that the use of distance measures in this context can be inappropriate. However, to overcome this a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized change detection problem

    Publication Year: 1995, Page(s):171 - 187
    Cited by:  Papers (99)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1300 KB)

    The purpose of this paper is to give a new statistical approach to the change diagnosis (detection/isolation) problem. The change detection problem has received extensive research attention; however, the change isolation problem has, for the most part, been ignored. We consider a stochastic dynamical system with abrupt changes and investigate the multiple hypotheses extension of Lorden's (1971) re... 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu