IEEE Transactions on Information Theory

Volume 34 Issue 4 • July 1988

Filter Results

Displaying Results 1 - 25 of 34
  • Time-frequency localization operators: a geometric phase space approach

    Publication Year: 1988, Page(s):605 - 612
    Cited by:  Papers (269)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (690 KB)

    The author defines a set of operators which localize in both time and frequency. These operators are similar to but different from the low-pass time-limiting operator, the singular functions of which are the prolate spheroidal wave functions. The author's construction differs from the usual approach in that she treats the time-frequency plane as one geometric whole (phase space) rather than as two... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Double series representation of bounded signals

    Publication Year: 1988, Page(s):613 - 624
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    Series representations of the form f(t) approximately Sigma /sub n=- infinity //sup infinity / Sigma /sub k=- infinity //sup infinity /a/sub n,k/ nu (t-n)/sub e//sup 2 pi /kts/ for bounded signals f(t) are studied, as are conditions on the unit function nu (t), such that coefficients a/sub n,k/ reveal the energy content of f(t) in the time interval n-(1/2)<or=t<or=n+(1/2) and frequency inter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral expressions of information measures of Gaussian time series and their relation to AIC and CAT

    Publication Year: 1988, Page(s):625 - 631
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (543 KB)

    Interrelations among the spectral expressions of the information measures of Kullback-Leibler (1959) and Renyi (1961) for discrimination between two stationary Gaussian time series are discussed. The spectral expression of Fisher's information rate matrix is also treated, as well as two intuitively acceptable discrimination functions. It is shown that all of them are equivalent except for scalar m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimax estimation of unknown deterministic signals in colored noise

    Publication Year: 1988, Page(s):632 - 641
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (814 KB)

    The estimation of a deterministic signal corrupted by random noise is considered. The strategy is to find a linear noncausal estimator which minimizes the maximum mean square error over an a priori set of signals. This signal set is specified in terms of frequency/energy constraints via the discrete Fourier transform. Exact filter expressions are given for the case of additive white noise. For the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence analysis of adaptive linear estimation for dependent stationary processes

    Publication Year: 1988, Page(s):642 - 654
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1072 KB)

    The convergence properties of an adaptive linear mean-square estimator that uses a modified LMS algorithm are established for generally dependent processes. Bounds on the mean-square error of the estimates of the filter coefficients and on the excess error of the estimate of the signal are derived for input processes which are either strong mixing or asymptotically uncorrelated. It is shown that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of discrete-time predictors of continuous-time stationary processes

    Publication Year: 1988, Page(s):655 - 668
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1118 KB)

    The asymptotic performance of linear predictors of continuous-time stationary processes is studied from observations at n sampling instants on a fixed observation interval. Both optimal and simpler choices of predictor coefficients are considered, using uniform sampling as well as nonuniform sampling tailored to the statistics of the process under prediction. The focus is on stationary processes w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic analysis for the recursive median filter process

    Publication Year: 1988, Page(s):669 - 679
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (842 KB)

    Vector probability measure functions (density function) for recursively median filtered signals are found when the underlying input binary sequences are either independent identically distributed (i.i.d.) or Markov chains. The results are parametric in the window size of the filter and in the probability distribution of the input sequence. Using statistical threshold decomposition, the same result... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence and performance analysis of the normalized LMS algorithm with uncorrelated Gaussian data

    Publication Year: 1988, Page(s):680 - 691
    Cited by:  Papers (110)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    It is demonstrated that the normalized least mean square (NLMS) algorithm can be viewed as a modification of the widely used LMS algorithm. The NLMS is shown to have an important advantage over the LMS, which is that its convergence is independent of environmental changes. In addition, the authors present a comprehensive study of the first and second-order behavior in the NLMS algorithm. They show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Benveniste's convergence results in the study of adaptive IIR filtering algorithms

    Publication Year: 1988, Page(s):692 - 709
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1316 KB)

    It is shown that the weak convergence results of A. Benveniste et al. (IEEE Trans. Automat. Contr., vol.AC-25, p.1042-58, Dec. 1980) can be used to prove convergence of some adaptive infinite impulse response (IIR) filtering algorithms. The association of the algorithms with some ordinary differential equations for constant gains, which parallels the theory of L. Ljung et al. (1983), is suitable f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error bounds for the nonlinear filtering of signals with small diffusion coefficients

    Publication Year: 1988, Page(s):710 - 721
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (898 KB)

    New upper and lower bounds for the nonlinear filtering problem are presented. The lower bounds are especially useful in the region of small diffusion coefficients where previously known bounds are inefficient. The upper and lower bounds are shown to be tight. An example demonstrating the tightness of the bounds is presented.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the existence of positive-definite maximum-likelihood estimates of structured covariance matrices

    Publication Year: 1988, Page(s):722 - 729
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    It is shown that a sufficient condition for the likelihood function of a zero-mean Gaussian random vector with covariance R from some class of covariances R to be unbounded above over the set of positive-definite matrices in R is that some singular R/sub o/ exists in R whose range space contains the data. The results obtained imply that, for the spectrum estimation problem in which R is the class ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A transform theory for a class of group-invariant codes

    Publication Year: 1988, Page(s):725 - 775
    Cited by:  Papers (24)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2611 KB)

    A binary cyclic code of length of n can be defined by a set of parity-check equations that is invariant under the additive cyclic group generated by A:i to i+1 modulo n. A class of quasicyclic codes that have parity-check equations invariant under the group generated by a subgroup of A and a subgroup of the multiplicative group M:i to 2/sup k/i modulo n is studied in detail. The Fourier transform ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structure, optimization, and realization of FFSK trellis codes

    Publication Year: 1988, Page(s):730 - 751
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2139 KB)

    The structure of combinations of (l,k) binary trellis encoders and fast frequency-shift keying (FFSK) modulation is studied. A novel method for the optimization of these combinations is proposed. It is concluded that, regardless of the particular realization, the best combinations can always be obtained by using a so-called matched convolutional code. Optimum FFSK codes of rates 1/2 and 2/3 for up... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the bit error probability of a linear cyclic code over GF(2/sup l/) and its extended code

    Publication Year: 1988, Page(s):776 - 785
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (657 KB)

    An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2/sup l/) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DC-free coset codes

    Publication Year: 1988, Page(s):786 - 792
    Cited by:  Papers (36)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (577 KB)

    A class of block coset codes with disparity and run-length constraints are studied. They are particularly well suited for high-speed optical fiber links and similar channels, where DC-free pulse formats, channel error control, and low-complexity encoder-decoder implementations are required. The codes are derived by partitioning linear block codes. The encoder and decoder structures are the same as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speedier decoding of cyclic codes using chord properties

    Publication Year: 1988, Page(s):793 - 803
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (762 KB)

    Finite-field transform quantities, appearing in typical cyclic code decoders, obey conjugacy-based relationships commonly called chord properties. It is demonstrated that these relationships may be used to significantly expedite error estimation by the decoder. The resulting speed-up factor is proportional to the degree of the extension field in which the code design is specified. BCH codes and st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional modulation and coding for band-limited digital channels

    Publication Year: 1988, Page(s):803 - 809
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (655 KB)

    A class of multidimensional signals, based on generalized group alphabets, is introduced and its basic properties are derived. The combination of generalized group alphabets and coding is also examined: two coding schemes are considered-G. Ungerboeck's scheme (1982) for combination with convolutional codes, and V.V. Ginzburg's (1984) scheme for combination with block codes. It is concluded that th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Composition of Reed-Solomon codes and geometric designs

    Publication Year: 1988, Page(s):810 - 816
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (602 KB)

    It is shown that good linear (n,k,d) codes over a finite field GF(q) can be constructed by concatenating the generator matrices of Reed-Solomon codes. For the case of k=3, it is shown that many of the codes obtained using projective-geometry techniques can readily be obtained by the proposed algebraic approach.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the characterization of statistically synchronizable variable-length codes

    Publication Year: 1988, Page(s):817 - 825
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (839 KB)

    The authors consider statistically synchronizable variable-length codes, i.e. codes that admit decoders able to self-synchronize with high probability if the input sequence of code symbols is long enough. They show that a necessary and sufficient condition for the existence of a statistically self-synchronizing decoder and, therefore, for a code to be statistically synchronizable, is that the code... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified approach for encoding clean and noisy sources by means of waveform and autoregressive model vector quantization

    Publication Year: 1988, Page(s):826 - 834
    Cited by:  Papers (61)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (893 KB)

    Data compression by vector quantization is considered for sources which have been degraded by noise. It is shown that, by appropriately modifying the given distortion measure, the problem becomes a standard quantization problem for the noisy source and the modified distortion measure. For the special case of sources corrupted by statistically independent additive noise, the authors provide suffici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rate-distortion problem for a communication system with a secondary decoder to be hindered

    Publication Year: 1988, Page(s):835 - 842
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (551 KB)

    A rate-distortion problem is considered for a communication system (f, phi /sub 1/) with a secondary decoder phi /sub 2/ to be hindered which uses a different distortion measure from the primary system. The least achievable distortion of the secondary decoder is evaluated for the most secure primary system. Source coding for sources with additional outputs to be kept secret from the receiver or wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source encoding using syntactic information source models

    Publication Year: 1988, Page(s):843 - 850
    Cited by:  Papers (23)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    The use of syntactic information source models for the source encoding (data compression) of messages is described. Syntactic models formulated using context-free grammars augmented with derivation step probabilities are considered. Using an arithmetic coder as the low-level encoding unit, it is shown how practical encoding systems can be constructed from such models. Application of the techniques... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal contention among three senders

    Publication Year: 1988, Page(s):851 - 857
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (689 KB)

    The tests allowed in conflict resolution problems have usually three types of outcomes, according to whether the test contains zero, one, or at least two senders. The question of locating three elements in a given interval of the real line with the least number of such tests is studied. A nested detection algorithm is provided which is then proven to be optimal. For this purpose, extensive use is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new look at coding for APD-based direct-detection optical channels

    Publication Year: 1988, Page(s):858 - 866
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    Coding for avalanche photodiode (APD)-based direct-detection optical channels is investigated using a simple channel model that clearly points out the difference between the signal-dependent optical noise channel model and additive white Gaussian noise channel model. Coding and modulation are viewed as a single entity and the coding/modulation gain (CMG) is used to analyze and construct good codes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclic unequal error protection codes constructed from cyclic codes of composite length

    Publication Year: 1988, Page(s):867 - 871
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (578 KB)

    The unequal error correction capabilities of binary cyclic codes of composite length are investigated. Under certain conditions, direct sums of concatenated codes have unequal error correction capabilities. By a modified Hartmann and Tzeng (1973) algorithm, it is shown that a binary cyclic code of composite length is equivalent to the direct sum of concatenated codes. With this, some binary cyclic... 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