The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Berbeza daripada ramalan jangka panjang yang digunakan dalam codec pertuturan moden, standard codec kadar bit rendah Internet (iLBC) secara bebas mengekod baki pengekodan ramalan linear (LPC) bingkai demi bingkai. Dalam makalah ini, reka bentuk kebolehskalaan kerumitan dicadangkan untuk pengekodan carian buku kod dinamik dalam codec pertuturan iLBC. Di samping itu, pertukaran antara kerumitan pengiraan dan kualiti pertuturan boleh dicapai dengan menetapkan parameter pendekatan yang dicadangkan secara dinamik. Keputusan simulasi menunjukkan bahawa kerumitan pengiraan boleh dikurangkan dengan berkesan dengan penurunan kualiti pertuturan yang tidak dapat dilihat.
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.
Salinan
Fu-Kun CHEN, Kuo-Bao KUO, "Complexity Scalability Design in the Internet Low Bit Rate Codec (iLBC) for Speech Coding" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 5, pp. 1238-1243, May 2010, doi: 10.1587/transinf.E93.D.1238.
Abstract: Differing from the long-term prediction used in the modern speech codec, the standard of the internet low bit rate codec (iLBC) independently encodes the residual of the linear predictive coding (LPC) frame by frame. In this paper, a complexity scalability design is proposed for the coding of the dynamic codebook search in the iLBC speech codec. In addition, a trade-off between the computational complexity and the speech quality can be achieved by dynamically setting the parameter of the proposed approach. Simulation results show that the computational complexity can be effectively reduced with imperceptible degradation of the speech quality.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.1238/_p
Salinan
@ARTICLE{e93-d_5_1238,
author={Fu-Kun CHEN, Kuo-Bao KUO, },
journal={IEICE TRANSACTIONS on Information},
title={Complexity Scalability Design in the Internet Low Bit Rate Codec (iLBC) for Speech Coding},
year={2010},
volume={E93-D},
number={5},
pages={1238-1243},
abstract={Differing from the long-term prediction used in the modern speech codec, the standard of the internet low bit rate codec (iLBC) independently encodes the residual of the linear predictive coding (LPC) frame by frame. In this paper, a complexity scalability design is proposed for the coding of the dynamic codebook search in the iLBC speech codec. In addition, a trade-off between the computational complexity and the speech quality can be achieved by dynamically setting the parameter of the proposed approach. Simulation results show that the computational complexity can be effectively reduced with imperceptible degradation of the speech quality.},
keywords={},
doi={10.1587/transinf.E93.D.1238},
ISSN={1745-1361},
month={May},}
Salinan
TY - JOUR
TI - Complexity Scalability Design in the Internet Low Bit Rate Codec (iLBC) for Speech Coding
T2 - IEICE TRANSACTIONS on Information
SP - 1238
EP - 1243
AU - Fu-Kun CHEN
AU - Kuo-Bao KUO
PY - 2010
DO - 10.1587/transinf.E93.D.1238
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2010
AB - Differing from the long-term prediction used in the modern speech codec, the standard of the internet low bit rate codec (iLBC) independently encodes the residual of the linear predictive coding (LPC) frame by frame. In this paper, a complexity scalability design is proposed for the coding of the dynamic codebook search in the iLBC speech codec. In addition, a trade-off between the computational complexity and the speech quality can be achieved by dynamically setting the parameter of the proposed approach. Simulation results show that the computational complexity can be effectively reduced with imperceptible degradation of the speech quality.
ER -