Abstract
This paper presents a cascade structure of an algebraic code-book to improve the performance of low bit-rate speech coder. A codeword of an algebraic codebook consists of a set of pulse amplitudes and positions. In general, the amplitude of each pulse is constrained to be either +1 or -1 due to the limitations of bit-rate and complexity. Thus, the performance of the codebook is varied depending on the characteristic of input target vectors. In this paper, we extend the algebraic codebook structure to two stages in order to provide flexible pulse combinations. While all pulses, M, are simultaneously selected in a classical one-stage algebraic codebook, the cascade structure searches the pulses with a two step procedure, i.e., L pulses at the first stage and (M-L) pulses at the second stage. Experiments confirm that our algorithm provides higher quality than the conventional scheme when the total number of pulses is same. In case of assigning 24 pulses per 8-ms sub-frame, a segmental SNR between target and synthesized signal increases 1.04 dB. In addition, at the same environment, the complexity of fixed codebook search is reduced by about 32%.
| Original language | English |
|---|---|
| Pages (from-to) | 173-176 |
| Number of pages | 4 |
| Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
| Volume | 2 |
| Publication status | Published - 2003 Sep 25 |
| Event | 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing - Hong Kong, Hong Kong Duration: 2003 Apr 6 → 2003 Apr 10 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Signal Processing
- Electrical and Electronic Engineering
Cite this
}
A cascaded algebraic codebook structure to impove the performance of speech coder. / Jung, Sung Kyo; Kim, Kyoung Tae; Kang, Hong-Goo; Youn, Dae Hee.
In: ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, Vol. 2, 25.09.2003, p. 173-176.Research output: Contribution to journal › Conference article
TY - JOUR
T1 - A cascaded algebraic codebook structure to impove the performance of speech coder
AU - Jung, Sung Kyo
AU - Kim, Kyoung Tae
AU - Kang, Hong-Goo
AU - Youn, Dae Hee
PY - 2003/9/25
Y1 - 2003/9/25
N2 - This paper presents a cascade structure of an algebraic code-book to improve the performance of low bit-rate speech coder. A codeword of an algebraic codebook consists of a set of pulse amplitudes and positions. In general, the amplitude of each pulse is constrained to be either +1 or -1 due to the limitations of bit-rate and complexity. Thus, the performance of the codebook is varied depending on the characteristic of input target vectors. In this paper, we extend the algebraic codebook structure to two stages in order to provide flexible pulse combinations. While all pulses, M, are simultaneously selected in a classical one-stage algebraic codebook, the cascade structure searches the pulses with a two step procedure, i.e., L pulses at the first stage and (M-L) pulses at the second stage. Experiments confirm that our algorithm provides higher quality than the conventional scheme when the total number of pulses is same. In case of assigning 24 pulses per 8-ms sub-frame, a segmental SNR between target and synthesized signal increases 1.04 dB. In addition, at the same environment, the complexity of fixed codebook search is reduced by about 32%.
AB - This paper presents a cascade structure of an algebraic code-book to improve the performance of low bit-rate speech coder. A codeword of an algebraic codebook consists of a set of pulse amplitudes and positions. In general, the amplitude of each pulse is constrained to be either +1 or -1 due to the limitations of bit-rate and complexity. Thus, the performance of the codebook is varied depending on the characteristic of input target vectors. In this paper, we extend the algebraic codebook structure to two stages in order to provide flexible pulse combinations. While all pulses, M, are simultaneously selected in a classical one-stage algebraic codebook, the cascade structure searches the pulses with a two step procedure, i.e., L pulses at the first stage and (M-L) pulses at the second stage. Experiments confirm that our algorithm provides higher quality than the conventional scheme when the total number of pulses is same. In case of assigning 24 pulses per 8-ms sub-frame, a segmental SNR between target and synthesized signal increases 1.04 dB. In addition, at the same environment, the complexity of fixed codebook search is reduced by about 32%.
UR - http://www.scopus.com/inward/record.url?scp=0141590344&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0141590344&partnerID=8YFLogxK
M3 - Conference article
VL - 2
SP - 173
EP - 176
JO - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
JF - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
SN - 0736-7791
ER -