Speech Encoding by a Stack Algorithm
- 1 June 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 28 (6), 825-830
- https://doi.org/10.1109/tcom.1980.1094736
Abstract
A metric-first tree coding algorithm, similar to the stack algorithm, is used to encode voiced speech. From experimental evidence, it is shown how to optimize the algorithm's performance with respect to the algorithm's storage, execution time, and number of tree branches searched per symbol released as output. For each of these, the optimal parameterizing of the algorithm differs markedly. Similarities are pointed out between our results for speech and earlier theoretical results for the binary i.i.d, source with Hamming distortion measure. Comparisons to the M algorithm are made.Keywords
This publication has 13 references indexed in Scilit:
- Adaptive Tree Encoding of Speech at 8000 Bits/s with a Frequency-Weighted Error CriterionIEEE Transactions on Communications, 1979
- Tree-Encoding of Speech Using the (M, L)-Algorithm and Adaptive QuantizationIEEE Transactions on Communications, 1978
- The contour extraction problem with biomedical applicationsComputer Graphics and Image Processing, 1978
- A multiple stack algorithm for erasurefree decoding of convolutional codesIEEE Transactions on Communications, 1977
- Real-number convolutional codes for speech-like quasi-stationary sources (Corresp.)IEEE Transactions on Information Theory, 1977
- Generalized stack algorithms for decoding convolutional codesIEEE Transactions on Information Theory, 1975
- Tree encoding of speechIEEE Transactions on Information Theory, 1975
- A stack algorithm for source coding with a fidelity criterionIEEE Transactions on Information Theory, 1974
- Tree encoding for symmetric sources with a distortion measureIEEE Transactions on Information Theory, 1974
- A 2-cycle algorithm for source coding with a fidelity criterionIEEE Transactions on Information Theory, 1973