Trellis code excited linear prediction (TCELP) speech coding

Author

Lee, Cheng-Chieh ; Shoham, Yair

Author_Institution

Bell Labs., Lucent Technol., Murray Hill, NJ, USA

fYear

1999

fDate

1999

Firstpage

108

Lastpage

110

Abstract

This paper describes using the trellis-based scalar-vector quantizer for sources with memory to solve the excitation codebook search problem of code excited linear prediction (CELP) speech coders. This approach leads to a 24 kbit/s telephony-bandwidth low-delay (3 msec) trellis CELP coder, which outperforms both ITU-T 15 kbit/s G.728 LD-CELP and G.726 32 kbit/s ADPCM. Since the codebook is derived from a scalar alphabet, the proposed coder can effectively handle excitation vectors in the 24-dimensional space (to realize considerable vector quantization gains) and has a computational complexity of approximately 75% of that of ITU-T G.728 LD-CELP

Keywords

computational complexity; linear predictive coding; search problems; speech coding; trellis codes; vector quantisation; vocoders; 24 kbit/s; 24-dimensional space; TCELP; computational complexity; excitation codebook search problem; excitation vectors; low-delay speech coder; memory sources; scalar alphabet; speech coding; telephony-bandwidth trellis CELP coder; trellis code excited linear prediction; trellis-based scalar-vector quantizer; vector quantization gains; Computational complexity; Convolutional codes; Delay; Filters; Partitioning algorithms; Rate-distortion; Search problems; Speech coding; Speech synthesis; Vector quantization;

fLanguage

English

Publisher

ieee

Conference_Titel

Speech Coding Proceedings, 1999 IEEE Workshop on

Conference_Location

Porvoo

Print_ISBN

0-7803-5651-9

Type

conf

DOI

10.1109/SCFT.1999.781500

Filename

781500