By Topic

IEEE Signal Processing Letters

Issue 11 • Nov. 1997

Filter Results

Displaying Results 1 - 6 of 6
  • A 4.2 kb/s low-delay speech coder with modified CELP

    Publication Year: 1997, Page(s):301 - 303
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (39 KB)

    In this letter, we propose a low-delay speech coder at 4.2 kb/s. In the proposed coder, we remove short-term prediction and use three-tap long term prediction to exploit the speech redundancy. A "dual-decision" pitch estimation algorithm and an adaptive sinusoidal excitation codebook are introduced to improve the performance of the proposed coder. The synthesized speech of this coder has comparabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative noise and channel estimation under the stochastic matching algorithm framework

    Publication Year: 1997, Page(s):304 - 306
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (95 KB)

    In this letter, we introduce an unsupervised iterative algorithm to adapt HMMs trained using clean speech in order to recognize speech corrupted by an additive and a convolutional noise. Both types of noise are considered as stochastic processes that can be modeled using HMMs and can be estimated by applying Sankar's stochastic matching (SM) algorithm successively in the cepstral and in the linear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new fast QR algorithm based on a priori errors

    Publication Year: 1997, Page(s):307 - 309
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (174 KB)

    This letter presents a new fast QR algorithm based on Givens rotations using a priori errors. The principles behind the triangularization of the weighted input data matrix via QR decomposition and the type of errors used in the updating process are exploited in order to investigate the relationships among different fast algorithms of the QR family. These algorithms are classified according to a ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extensions to common Laplace and Fourier transforms

    Publication Year: 1997, Page(s):310 - 312
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (103 KB)

    The extended versions of common Laplace and Fourier transforms are given. This is achieved by defining a new function f/sub e/(p), p/spl epsiv/C related to the function to be transformed f(t), t/spl epsiv/R. Then f/sub e/(p) is transformed by an integral whose path is defined on an inclined line on the complex plane. The slope of the path is the parameter of the extended definitions which reduce t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing commutative cascades of multidimensional upsamplers and downsamplers

    Publication Year: 1997, Page(s):313 - 316
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    In multiple dimensions, the cascade of an upsampler by L and a downsampler by M commutes if and only if the integer matrices L and M are right coprime and LM=ML. This letter presents algorithms to design L and M that yield commutative upsampler/dowsampler cascades. We prove that commutativity is possible if the Jordan canonical form of the rational (resampling) matrix R=LM/sup -1/ is equivalent to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized block-edge impairment metric for video coding

    Publication Year: 1997, Page(s):317 - 320
    Cited by:  Papers (203)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (145 KB)

    A mew generalized block-edge impairment metric (GBIM) is presented in this paper as a quantitative distortion measure for blocking artifacts in digital video and image coding. This distortion measure does not require the original image sequence as a comparative reference, and is found to be consistent with subjective evaluation. 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
James E. Fowler
Dept Electrical & Computer Engineering
Associate Director                         
Distributed Analytics and Security Institute
Mississippi State University
Mississippi State, MS 39762 USA
fowler@ece.msstate.edu