Fast infinite response filtering for speech processing
- 135 Downloads
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.
KeywordsSpeech Signal Digital Signal Processing Finite Impulse Response Filter Coefficient Code Word
Unable to display preview. Download preview PDF.
- 1.A.V.Oppenheim, Applications of Digital Signal Processing. Prentice-Hall, Inc., Englewood Cliffs, New Jersey,1978.Google Scholar
- 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.R.E. Blahut, Fast algorithms for digital signal processing. Addison-Wessley, Reading, Mass.,1985.Google Scholar
- 4.A.V.Aho, J.E.Hopcroft, J.D.Ullman, The Design and Analysis of Computer Algorithms. Addison-Wessley, Reading, Mass., 1976.Google Scholar