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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A.V.Oppenheim, Applications of Digital Signal Processing. Prentice-Hall, Inc., Englewood Cliffs, New Jersey,1978.
J.P.Campbell, V.C.Welch and T.E.Tremain, CELP Documentation Version 3.2. U.S.Dod, Fort Mead, MD, September, 1990.
R.E. Blahut, Fast algorithms for digital signal processing. Addison-Wessley, Reading, Mass.,1985.
A.V.Aho, J.E.Hopcroft, J.D.Ullman, The Design and Analysis of Computer Algorithms. Addison-Wessley, Reading, Mass., 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bocharova, I.E., Kudryashov, B.D. (1994). Fast infinite response filtering for speech processing. In: Chmora, A., Wicker, S.B. (eds) Error Control, Cryptology, and Speech Compression. ECCSP 1993. Lecture Notes in Computer Science, vol 829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58265-7_15
Download citation
DOI: https://doi.org/10.1007/3-540-58265-7_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58265-6
Online ISBN: 978-3-540-48588-9
eBook Packages: Springer Book Archive