抄録
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.
本文言語 | English |
---|---|
ページ(範囲) | 1496-1506 |
ページ数 | 11 |
ジャーナル | IEICE Transactions on Information and Systems |
巻 | E87-D |
号 | 6 |
出版ステータス | Published - 2004 6月 |
外部発表 | はい |
ASJC Scopus subject areas
- ソフトウェア
- ハードウェアとアーキテクチャ
- コンピュータ ビジョンおよびパターン認識
- 電子工学および電気工学
- 人工知能