Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Signal Processing Letters, IEEE

Issue 3 • Date March 2000

Filter Results

Displaying Results 1 - 8 of 8
  • Conditional entropy-constrained trellis-coded RVQ with application to image coding

    Publication Year: 2000 , Page(s): 49 - 51
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (57 KB)  

    This paper introduces an extension of conditional entropy-constrained RVQ (CEC-RVQ) that embodies trellis-coded quantization. The method, which we call conditional entropy-constrained trellis-coded residual vector quantization (CEC-TCRVQ), quantizes a supervector (made from a large number of neighboring vectors) to better extract the two-dimensional (2-D) correlation present in real images. Simulation results indicate that CEC-TCRVQ provides 0.3-0.4 dB improvement over CEC-RVQ for the 4/spl times/4 vector case and 1.3 dB improvement for the 8/spl times/8 case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate linear phase multiplierless IIR halfband filter

    Publication Year: 2000 , Page(s): 52 - 53
    Cited by:  Papers (7)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (47 KB)  

    This paper deals with the real-time multiplierless implementation of halfband IIR filters having approximate linear phase and significantly smaller processing delay than previously reported implementations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive IIR filtering with monic normalization: reduced-order approximation

    Publication Year: 2000 , Page(s): 54 - 56
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (75 KB)  

    The monic normalization equation-error (MNEE) algorithm for adaptive IIR filtering is applied to the reduced-order identification. It is shown that the parameter estimates converge to the solution of the well-known eigenvalue equation. Unlike the ordinary equation-error adaptive IIR filter, the MNEE adaptive IIR filter matches the second-order response as well as the impulse response of an unknown system. The simulation results confirm that the simple MNEE algorithm can provide a stable, unbiased estimate in the reduced-order case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability issues in error control coding in the complex field, interpolation, and frame bounds

    Publication Year: 2000 , Page(s): 57 - 59
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (59 KB)  

    We give bounds for the eigenvalues and condition number of a matrix, with applications to error control coding in the complex field, spectrum analysis, the missing data problem, interpolation, and the determination of discrete finite frame bounds. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast orthonormal PAST algorithm

    Publication Year: 2000 , Page(s): 60 - 62
    Cited by:  Papers (77)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (78 KB)  

    Subspace decomposition has proven to be an important tool in adaptive signal processing. A number of algorithms have been proposed for tracking the dominant subspace. Among the most robust and most efficient methods is the projection approximation and subspace tracking (PAST) method. This paper elaborates on an orthonormal version of the PAST algorithm for fast estimation and tracking of the principal subspace or/and principal components of a vector sequence. The orthonormal PAST (OPAST) algorithm guarantees the orthonormality of the weight matrix at each iteration. Moreover, it has a linear complexity like the PAST algorithm and a global convergence property like the natural power (NP) method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive CFAR detection in compound-Gaussian clutter with circulant covariance matrix

    Publication Year: 2000 , Page(s): 63 - 65
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (62 KB)  

    We present a fully adaptive detector of coherent pulse trains embedded in compound-Gaussian clutter, whose covariance matrix is a circulant one. Remarkably, the proposed receiver ensures CFAR-ness with respect to the non-Gaussian noise distribution as well as to its temporal correlation. It also exhibits an acceptable loss with respect to previously proposed nonadaptive structures, even for small sizes of the estimation sample. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiresolution-signal direction-of-arrival estimation: a wavelets approach

    Publication Year: 2000 , Page(s): 66 - 68
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (55 KB)  

    This paper presents a general framework for the application of wavelets in array signal processing, including an understanding of the scale. A multiresolution-signal direction-of-arrival (DOA) estimation scheme is proposed based on the wavelet decomposition. Simulations show that the new approach improves the DOA estimation performance, particularly for sources near the broadside direction. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of a discrete-time correlated Laplacian process

    Publication Year: 2000 , Page(s): 69 - 70
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (40 KB)  

    A new method is proposed to generate a discrete-time correlated Laplacian process from four mutually independent, discrete-time Gaussian processes with suitably chosen correlation functions. In contrast to some other known methods, the entire range of correlation coefficients of the resulting Laplacian process can be realized. An example of generating a discrete-time Laplace-Markov process is presented. 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