A comparison of some algebraic structures for CELP coding of speech
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12, 1953-1956
- https://doi.org/10.1109/icassp.1987.1169332
Abstract
The paper discusses how binary error-correcting codes can be used to provide (+1/-1)-waveform codebooks that speed up search in CELP vocoders. Four coding techniques operating at half bit per sample with respectively 8, 16, 24 and 32 samples are compared in terms of complexity and SNR performance, Recent results on spherical codes from regular point lattices are also reported.Keywords
This publication has 5 references indexed in Scilit:
- Baseband speech coding at 2400 bps using "Spherical vector quantization"Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Fast ML decoding algorithm for the Nordstrom - Robinson code (Corresp.)IEEE Transactions on Information Theory, 1987
- La quantification vectorielle des signaux: approche algébriqueAnnals of Telecommunications, 1986
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech latticeIEEE Transactions on Information Theory, 1986
- Tables of sphere packings and spherical codesIEEE Transactions on Information Theory, 1981