This paper presents an efficient LSP quantizer implementation for low bit-rate coders. The major feature of the quantizer is that it uses a truncated cepstral distance criterion for the code selection procedure. This approach has generally been considered too computationally costly. We utilized the quantizer with a moving-average predictor, two-stage-split vector quantizer and delayed decision. We have investigated the optimal parameter settings in this case and incorporated the quantizer thus obtained into an ITU-T 4-kbit/s speech coding candidate algorithm with a bit budget of 21 bits. The objective performance is better than that with a conventional weighted mean-square criterion, while the complexity is still kept to a reasonable level. The paper also describes the codebook design and techniques that were employed to achieve robustness in noisy channel conditions.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yusuke HIWASAKI, Kazunori MANO, Kazutoshi YASUNAGA, Toshiyuki MORII, Hiroyuki EHARA, Takao KANEKO, "Design of a Robust LSP Quantizer for a High-Quality 4-kbit/s CELP Speech Coder" in IEICE TRANSACTIONS on Information,
vol. E87-D, no. 6, pp. 1496-1506, June 2004, doi: .
Abstract: This paper presents an efficient LSP quantizer implementation for low bit-rate coders. The major feature of the quantizer is that it uses a truncated cepstral distance criterion for the code selection procedure. This approach has generally been considered too computationally costly. We utilized the quantizer with a moving-average predictor, two-stage-split vector quantizer and delayed decision. We have investigated the optimal parameter settings in this case and incorporated the quantizer thus obtained into an ITU-T 4-kbit/s speech coding candidate algorithm with a bit budget of 21 bits. The objective performance is better than that with a conventional weighted mean-square criterion, while the complexity is still kept to a reasonable level. The paper also describes the codebook design and techniques that were employed to achieve robustness in noisy channel conditions.
URL: https://global.ieice.org/en_transactions/information/10.1587/e87-d_6_1496/_p
Copy
@ARTICLE{e87-d_6_1496,
author={Yusuke HIWASAKI, Kazunori MANO, Kazutoshi YASUNAGA, Toshiyuki MORII, Hiroyuki EHARA, Takao KANEKO, },
journal={IEICE TRANSACTIONS on Information},
title={Design of a Robust LSP Quantizer for a High-Quality 4-kbit/s CELP Speech Coder},
year={2004},
volume={E87-D},
number={6},
pages={1496-1506},
abstract={This paper presents an efficient LSP quantizer implementation for low bit-rate coders. The major feature of the quantizer is that it uses a truncated cepstral distance criterion for the code selection procedure. This approach has generally been considered too computationally costly. We utilized the quantizer with a moving-average predictor, two-stage-split vector quantizer and delayed decision. We have investigated the optimal parameter settings in this case and incorporated the quantizer thus obtained into an ITU-T 4-kbit/s speech coding candidate algorithm with a bit budget of 21 bits. The objective performance is better than that with a conventional weighted mean-square criterion, while the complexity is still kept to a reasonable level. The paper also describes the codebook design and techniques that were employed to achieve robustness in noisy channel conditions.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Design of a Robust LSP Quantizer for a High-Quality 4-kbit/s CELP Speech Coder
T2 - IEICE TRANSACTIONS on Information
SP - 1496
EP - 1506
AU - Yusuke HIWASAKI
AU - Kazunori MANO
AU - Kazutoshi YASUNAGA
AU - Toshiyuki MORII
AU - Hiroyuki EHARA
AU - Takao KANEKO
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E87-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2004
AB - This paper presents an efficient LSP quantizer implementation for low bit-rate coders. The major feature of the quantizer is that it uses a truncated cepstral distance criterion for the code selection procedure. This approach has generally been considered too computationally costly. We utilized the quantizer with a moving-average predictor, two-stage-split vector quantizer and delayed decision. We have investigated the optimal parameter settings in this case and incorporated the quantizer thus obtained into an ITU-T 4-kbit/s speech coding candidate algorithm with a bit budget of 21 bits. The objective performance is better than that with a conventional weighted mean-square criterion, while the complexity is still kept to a reasonable level. The paper also describes the codebook design and techniques that were employed to achieve robustness in noisy channel conditions.
ER -