Low-delay CELP and tree coders: comparison and performance improvements
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 25-28 vol.1
- https://doi.org/10.1109/icassp.1991.150270
Abstract
A stochastic tree coder based on the (M,L) search algorithm suggested by V. Iyengar and P. Kabal (1988) and a low-day CELP (code-excited linear prediction) coder proposed by J.H. Chen (1989) are considered. The individual components (predictors, gain adaptation, excitation coding) of the two coders are analyzed. The performances of the two types of coders are compared. The two coders have comparable performance at 16 kb/s under clean channel conditions. Methods to improve the performance of the coders, particularly with a view to bringing the bit rate to below 16 kb/s, are studied. Suggestions for improving the performance include an improved high-order predictor (applicable to both coders), and training of the excitation dictionary as well as a better gain adaptation strategy for the tree coder.Keywords
This publication has 7 references indexed in Scilit:
- On a covariance-lattice algorithm for linear predictionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Fractional rate multi-tree speech codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A low delay 16 kb/s speech coderIEEE Transactions on Signal Processing, 1991
- Recursive triangular array ladder algorithmsIEEE Transactions on Signal Processing, 1991
- Backward adaptive prediction: high-order predictors and formant-pitch configurationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- High-quality coding of telephone speech and wideband audioIEEE Communications Magazine, 1990
- Gain-Adaptive Vector Quantization with Application to Speech CodingIEEE Transactions on Communications, 1987