By Topic

Signal Processing Letters, IEEE

Issue 11 • Date Nov. 1998

Filter Results

Displaying Results 1 - 7 of 7
  • A modified multiscale error diffusion technique for digital halftoning

    Publication Year: 1998 , Page(s): 277 - 280
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (286 KB)  

    A digital halftoning method is proposed based on a multiscale error diffusion technique for digital halftoning. It can improve the diffusion performance by effectively removing pattern noise and eliminating boundary and "blackhole" effects. A dot overlap compensation scheme is also proposed to eliminate the bias in the gray scale of the printed images. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient scoring algorithm for Gaussian mixture model based speaker identification

    Publication Year: 1998 , Page(s): 281 - 284
    Cited by:  Papers (22)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (110 KB)  

    This article presents a novel algorithm for reducing the computational complexity of identifying a speaker within a Gaussian mixture speaker model framework. For applications in which the entire observation sequence is known, we illustrate that rapid pruning of unlikely speaker model candidates can be achieved by reordering the time-sequence of observation vectors used to update the accumulated probability of each speaker model. The overall approach is integrated into a beam-search strategy and shown to reduce the time to identify a speaker by a factor of 140 over the standard full-search method, and by a factor of six over the standard beam-search method when identifying speakers from the 138 speaker YOHO corpus. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A root method for Volterra system equalization

    Publication Year: 1998 , Page(s): 285 - 288
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (106 KB)  

    The need to recover the original input from the output of a nonlinear system is a common problem in many applications. We propose a new method for Volterra system equalization based on finding the roots of a polynomial of the input. The method is capable of equalizing severe nonlinearities under the assumption that the input comes from a finite symbol set. Numerical simulations demonstrate its performance under a wide range of conditions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On linear predictors for MIMO channels and related blind identification and equalization

    Publication Year: 1998 , Page(s): 289 - 291
    Cited by:  Papers (21)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (152 KB)  

    The existence of finite-length one-step linear predictors plays a key role in several existing algorithms for blind identification and equalization of multiple-input multiple-output (MIMO) systems. An upper bound on the length of the predictor is known for the case when the underlying MIMO transfer function is irreducible and column-reduced. When the MIMO transfer function is irreducible but not necessarily column-reduced, it is known that a finite-length linear predictor exists; however, its length has not been specified in the literature. An upper bound on the length of a linear predictor for MIMO systems with irreducible transfer functions is derived. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalization of the Wiener-Khinchin theorem

    Publication Year: 1998 , Page(s): 292 - 294
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (126 KB)  

    We generalize the concept of the autocorrelation function and give the generalization of the Wiener-Khinchin theorem. A full generalization is presented where both the autocorrelation function and power spectral density are defined in terms of a general basis set. In addition, we present a partial generalization where the density is the Fourier transform of the characteristic function but the characteristic function is defined in terms of an arbitrary basis set. Both the deterministic and random cases are considered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized sequential sign detector for binary hypothesis testing

    Publication Year: 1998 , Page(s): 295 - 297
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (106 KB)  

    It is known that for fixed error probabilities sequential signal detection based on the sequential probability ratio test (SPRT) is optimum in terms of the average number of signal samples for detection. But, often suboptimal detectors like the sequential sign detector are preferred over the optimal SPRT. When the additive noise statistic is independent and identically distributed (i.i.d.), the sign detector is preferred for its simplicity and nonparametric properties. However, in many practical applications such as the usage of high speed sampling devices the noise is correlated. A generalized sequential sign detector for detecting binary signals in stationary, first-order Markov dependent noise is studied. Under the i.i.d. assumptions, this reduces to the usual sequential sign detector. The optimal decision thresholds and the average sample number for the test to terminate are derived. Numerical results are given to show that the proposed detector exploits the correlation in the noise and hence results in quicker detection. The method can also be extended to Mth order Markov dependence by converting it to a first-order dependence in an extended state space. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized eigendecomposition with an on-line local algorithm

    Publication Year: 1998 , Page(s): 298 - 301
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (154 KB)  

    This article presents a novel, on-line, local learning algorithm to obtain generalized eigenvalues and their corresponding eigenvectors in descending order with a linear adaptive filter. The filter is composed of a set of forward linear projections constrained by lateral inhibitions. Equilibrium points of the adaptation process and their stability are briefly analyzed. Simulations and experimental comparisons are given to verify the validity and effectiveness of the proposed algorithm. View full abstract»

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

Aims & Scope

The IEEE Signal Processing Letters is a monthly, archival publication designed to provide rapid dissemination of original, cutting-edge ideas and timely, significant contributions in signal, image, speech, language and audio processing.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Peter Willett
University of Connecticut
Storrs, CT 06269
peter.willett@uconn.edu