Abstract
We consider the problem of efficient codebook search for the code excited linear predictive (CELP) speech coders. To dimmish the search complexity a trellis codebook is proposed and decoding algorithms based on the Viterbi algorithm are investigated. Numerical results of the computer simulation are presented.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
B.S.Atal, “Predictive Coding of Speech at Low Bit Rates,” IEEE Trans., vol. Com-30, No.4, pp.600–614, Apr.1982.
M.R.Schroeder and B.S.Atal, “Code Excited Linear Prediction (CELP): High quality Speech at Very Low Bit Rates,” International Conference on Acoustics, Speech and Signal Processing, Proceedings, pp.937–940, 1982.
J.P.Campbell, V.C.Welch and T.E.Tremain, CELP Documentation Version 3.2. U.S.Dod, Fort Mead, MD, September, 1990.
A.V.Oppenheim and R.W.Schafer, Digital Signal Processing. Englewood Cliffs, N.J.: Prentice-Hall, 1975.
M.W.Marcellin, T.S.Fisher and J.D.Gibson, “Predictive Trellis Coded Quantization of Speech,” IEEE Trans., vol. ASSP-38, No.1, pp.46–55, Jan. 1990.
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., Kolesnik, V.D., Krachkovsky, V.Y., Kudryashov, B.D., Ovsjannikov, E.P., Troyanovsky, B.K. (1994). On trellis codes for linear predictive speech compression. 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_16
Download citation
DOI: https://doi.org/10.1007/3-540-58265-7_16
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