By Topic

IEEE Transactions on Information Theory

Issue 4 • Date Jul 1991

Filter Results

Displaying Results 1 - 25 of 37
  • Some contributions to a frequency location method due to He and Kedem

    Publication Year: 1991, Page(s):1177 - 1182
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    The author derives a useful information-theoretical technology from the tunable filter that automatically detects the frequency of an unknown signal in white Gaussian noise by adjusting its parameter to the correlation coefficient of its output. The tunable filter earlier proposed by S. He and B. Kedem (see ibid., vol.35, no.2, p.360-9, 1989) is known as the HK filter. The methodology sidesteps th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multivariate probability density deconvolution for stationary random processes

    Publication Year: 1991, Page(s):1105 - 1115
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    The kernel-type estimation of the joint probability density functions of stationary random processes from noisy observations is considered. Precise asymptotic expressions and bounds on the mean-square estimation error are established, along with rates of mean-square convergence, for processes satisfying a variety of mixing conditions. The dependence of the convergence rates on the joint density of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strengthening Simmons' bound on impersonation

    Publication Year: 1991, Page(s):1182 - 1185
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    Simmons' lower bound on impersonation P1⩾2 -I(M;E) where M and E denote the message and the encoding rule, respectively, is strengthened by maximizing over the source statistics and by allowing dependence between the message and the encoding rule. The authors show that a refinement of their argument, which removes the assumption of independence ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning by parallel Boltzmann machines

    Publication Year: 1991, Page(s):1162 - 1165
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    A parallel implementation of the Boltzmann machine in which each unit is updated independently of, but simultaneously with, the other units is studied. A transparent representation of the transition matrix and of the equilibrium distribution emphasizes the role, for the stochastic parallel evolution of the dynamical features of the underlying synchronous deterministic Hopfield model. As a conseque... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-dimensional harmonic retrieval and its time-domain analysis technique

    Publication Year: 1991, Page(s):1185 - 1188
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    The two-dimensional harmonic retrieval is examined in theory by confirming that the 2-D sinusoids in white noise are modeled as a special 2-D autoregressive moving average (ARMA) process whose AR parameters are identical to the MA ones. A new analysis technique for resolving 2-D sinusoids in white noise is proposed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Gaarder-Slepian “tracking system” conjecture [source coding]

    Publication Year: 1991, Page(s):1165 - 1168
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    The authors examine under what conditions, and with what notion of optimality, the coder of an optimal system can be operated with the information which is also accessible to the decoder. After a discussion of the difficulties involved, a theorem is proved for Markov sources which states that the extra memory of the coder can be substituted with independent randomization. The result is not tied to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory of lattice-based fine-coarse vector quantization

    Publication Year: 1991, Page(s):1072 - 1084
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 KB)

    The performance of a lattice-based fast vector quantization (VQ) method, which yields rate-distortion performance to that of an optimal VQ, is analyzed. The method, which is a special case of fine-coarse vector quantization (FCVQ), uses the cascade of a fine lattice quantizer and a coarse optimal VQ to encode a given source vector. The second stage is implemented in the form of a lookup table, whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On quantizer distortion and the upper bound for exponential entropy

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

    A sharp upper bound is derived for the exponential entropy in the class of absolutely continuous distributions with specific standard deviation and an exact description of the extremal distributions. This result is interpreted as determining the least favorable cases for certain methods of quantization of analog sources. It is known that for a large class of quantizers (both zero-memory and vector... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limiting efficiencies of burst-correcting array codes

    Publication Year: 1991, Page(s):976 - 982
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    The author evaluates the limiting efficiencies e(-S ) of burst-correcting array codes A(n1,n2, -s) for all negative readouts -s as n2 tends to infinity and n1 is properly chosen to maximize the efficiency. Specializing the result to the products of the first i prim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The zero-frequency problem: estimating the probabilities of novel events in adaptive text compression

    Publication Year: 1991, Page(s):1085 - 1094
    Cited by:  Papers (107)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    Approaches to the zero-frequency problem in adaptive text compression are discussed. This problem relates to the estimation of the likelihood of a novel event occurring. Although several methods have been used, their suitability has been on empirical evaluation rather than a well-founded model. The authors propose the application of a Poisson process model of novelty. Its ability to predict novel ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flicker noise and the estimation of the Allan variance

    Publication Year: 1991, Page(s):1173 - 1177
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    Flicker noise is a random process observed in a variety of contexts, including current fluctuations in metal film and semiconductor devices, loudness fluctuations in speech and music, and neurological patterns. The quadratic-mean convergence of appropriate estimates of the Allan variance for flicker noise is established when the latter is modeled as a stochastic process with stationary increments.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst-case interactive communication. II. Two messages are not optimal

    Publication Year: 1991, Page(s):995 - 1005
    Cited by:  Papers (22)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    For pt.I see ibid., vol.36, no.5, p.1111-26, (1990). The author defines the chromatic-decomposition number of a hypergraph and shows that, under general conditions, it determines the two message complexity. This result is then used to provide that two messages are not optimal. Protocols, complexities, and the characteristic hypergraph of (X,Y) are defined. The playoffs problem is describe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modified Q-functions and their use in detection analysis

    Publication Year: 1991, Page(s):1123 - 1142
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1152 KB)

    The Marcum's Q-function is extended to complex arguments. In particular, a set of modified generalized Q-functions for imaginary values of one or both arguments are defined and their properties are investigated. An extended probabilistic interpretation for the modified Q-functions is given appealing to a proposed generalization of the concept of random variable. Complex ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New bounds on the redundancy of Huffman codes

    Publication Year: 1991, Page(s):1095 - 1104
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    Upper and lower bounds are obtained for the redundancy of binary Huffman codes for a memoryless source whose least likely source letter probability is known. Tight upper bounds on redundancy in terms of the most and least likely source letter probabilities are provided View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Explicit formulas for self-complementary normal bases in certain finite fields

    Publication Year: 1991, Page(s):1220 - 1222
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    Explicit formulas are given for sets of p elements forming a self-complementary normal basis of GF(qp) over GF(q), where p is the characteristic of GF(q ). Using these formulas, a straightforward construction of self-complementary bases for GF(qα) (where α=pm) over GF(q) is also pre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-crossings of a wavelet transform

    Publication Year: 1991, Page(s):1019 - 1033
    Cited by:  Papers (234)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1208 KB)

    The completeness, stability, and application to pattern recognition of a multiscale representation based on zero-crossings is discussed. An alternative projection algorithm is described that reconstructs a signal from a zero-crossing representation, which is stabilized by keeping the value of the wavelet transform integral between each pair of consecutive zero-crossings. The reconstruction algorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Internal models and recursive estimation for 2-D isotropic random fields

    Publication Year: 1991, Page(s):1055 - 1066
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    Efficient recursive smoothing algorithms are developed for isotropic random fields that can be obtained by passing white noise through rational filters. The estimation problem is shown to be equivalent to a countably infinite set of 1-D separable two-point boundary value smoothing problems. The 1-D smoothing problems are solved using a Markovianization approach followed by a standard 1-D smoothing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Note on `The calculation of the probability of detection and the generalized Marcum Q-function'

    Publication Year: 1991
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    The author presents corrections to his original paper (see ibid., vol.35, no.2, p.389-400, 1989). The corrections concern computational cases using the steepest descent integration technique. It is pointed out that, for certain specific parameter ranges, the calculation error is too large to be accounted for by accumulated round-off error View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On extremal self-dual quaternary codes of lengths 18 to 28. II

    Publication Year: 1991, Page(s):1206 - 1216
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (940 KB)

    For pt.I see ibid., vol.36, no.3, p.651-60 (1990). A general decomposition theorem is applied to find all extremal self-dual quaternary codes of lengths 18 to 28 that have a nontrivial monomial automorphism of order a power of 3. Techniques to distinguish these codes are also presented. The author presents situations in which the equivalence of the codes under consideration can be decided View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On multilevel block modulation codes

    Publication Year: 1991, Page(s):965 - 975
    Cited by:  Papers (49)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The multilevel technique for combining block coding and modulation is investigated. A general formulation is presented for multilevel modulation codes in terms of component codes with appropriate distance measures. A specific method for constructing multilevel block modulation codes with interdependency among component codes is proposed. Given a multilevel block modulation code C with no ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm

    Publication Year: 1991, Page(s):1200 - 1203
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    A method of decoding two-dimensional (2-D) cyclic codes by applying the 2-D Berlekamp-Massey algorithm is proposed. To explain this decoding method, the author introduces a subclass of 2-D cyclic codes, which are called 2-D BCH codes due to their similarity with BCH codes. It is shown that there are some short 2-D cyclic codes with a better cost parameter value. The merit of the approach is verifi... View full abstract»

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

    Publication Year: 1991, Page(s):1156 - 1158
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    A theorem characterizing fractional Brownian motion by the covariance structure of its wavelet transform is established. The authors examine whether there are alternate Gaussian processes whose wavelet transforms have a natural covariance structure. In addition, the authors examine if there are any Gaussian processes whose wavelet transform is stationary with respect to the affine group (i.e. the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orthogonality of binary codes derived from Reed-Solomon codes

    Publication Year: 1991, Page(s):983 - 994
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    The author provides a simple method for determining the orthogonality of binary codes derived from Reed-Solomon codes and other cyclic codes of length 2m-1 over GF(2m) for m bits. Depending on the spectra of the codes, it is sufficient to test a small number of single-frequency pairs for orthogonality, and a pair of bases may be tested in each case simply by summing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-crossing rates of functions of Gaussian processes

    Publication Year: 1991, Page(s):1188 - 1194
    Cited by:  Papers (13)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    Formulas for the expected zero-crossing rates of random processes that are monotone transformations of Gaussian processes can be obtained by using two different techniques. The first technique involves derivation of the expected zero-crossing rate for discrete-time processes and extends the result of the continuous-time case by using an appropriate limiting argument. The second is a direct method ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A systolic Reed-Solomon encoder

    Publication Year: 1991, Page(s):1217 - 1220
    Cited by:  Papers (10)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    An architecture for a Reed-Solomon (RS) encoder is presented, consisting of r+1 systolic cells, where r is the redundancy of the code. The systolic encoder is systematic, does not contain any feedback or other global signals, its systolic cells are of low complexity, and it is easily reconfigurable for variable redundancy and changes in the choice of generator polynomial of the c... 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