Advertisement

Fast infinite response filtering for speech processing

  • Irina E. Bocharova
  • Boris D. Kudryashov
Conference paper
  • 135 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 829)

Abstract

The problem of reducing the number of multiplications in infinite response filtering is considered. We show how this operation may be decomposed on finite response filtrations and so-named halfconvolutions. Examples of the efficient procedures for filters of low order are presented.

Keywords

Speech Signal Digital Signal Processing Finite Impulse Response Filter Coefficient Code Word 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A.V.Oppenheim, Applications of Digital Signal Processing. Prentice-Hall, Inc., Englewood Cliffs, New Jersey,1978.Google Scholar
  2. 2.
    J.P.Campbell, V.C.Welch and T.E.Tremain, CELP Documentation Version 3.2. U.S.Dod, Fort Mead, MD, September, 1990.Google Scholar
  3. 3.
    R.E. Blahut, Fast algorithms for digital signal processing. Addison-Wessley, Reading, Mass.,1985.Google Scholar
  4. 4.
    A.V.Aho, J.E.Hopcroft, J.D.Ullman, The Design and Analysis of Computer Algorithms. Addison-Wessley, Reading, Mass., 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Irina E. Bocharova
    • 1
  • Boris D. Kudryashov
    • 1
  1. 1.St.-Petersburg Academy of Airspace InstrumentationSt.-PetersburgRussia

Personalised recommendations