Dynamic bit allocation in CELP excitation coding

T. Eriksson, Johan Sjöberg
{"title":"Dynamic bit allocation in CELP excitation coding","authors":"T. Eriksson, Johan Sjöberg","doi":"10.1109/ICASSP.1993.319261","DOIUrl":null,"url":null,"abstract":"The excitation coding, i.e., the LTP (long term predictor) and the innovation coding, requires a large part of the overall bit rate in a CELP (code-excited linear prediction) coder. A method to reduce the excitation coding bit rate is proposed. The fact that the pitch varies only slowly during voiced segments of speech can be exploited to design powerful dynamic bit allocation schemes for the excitation sequence. The bit allocation is determined by two methods. In one method, the LTP index is Huffman-coded. This makes the LTP code book require only a small number of bits during speech segments with stable pitch frequency, i.e., voiced segments. In the other method, a high rate approximation for assigning various numbers of innovation code words for each LTP index is derived. As a complement to dynamic bit allocation, a search method for the LTP index is developed that takes into account the number of innovation code words assigned to each LTP index, in the search for an optimal LTP sequence. Simulations are included that show that with these methods the bit rate can be reduced by 400 bit/s with no changes in speech quality.<<ETX>>","PeriodicalId":428449,"journal":{"name":"1993 IEEE International Conference on Acoustics, Speech, and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 IEEE International Conference on Acoustics, Speech, and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.1993.319261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The excitation coding, i.e., the LTP (long term predictor) and the innovation coding, requires a large part of the overall bit rate in a CELP (code-excited linear prediction) coder. A method to reduce the excitation coding bit rate is proposed. The fact that the pitch varies only slowly during voiced segments of speech can be exploited to design powerful dynamic bit allocation schemes for the excitation sequence. The bit allocation is determined by two methods. In one method, the LTP index is Huffman-coded. This makes the LTP code book require only a small number of bits during speech segments with stable pitch frequency, i.e., voiced segments. In the other method, a high rate approximation for assigning various numbers of innovation code words for each LTP index is derived. As a complement to dynamic bit allocation, a search method for the LTP index is developed that takes into account the number of innovation code words assigned to each LTP index, in the search for an optimal LTP sequence. Simulations are included that show that with these methods the bit rate can be reduced by 400 bit/s with no changes in speech quality.<>
CELP激励编码中的动态位分配
激励编码,即LTP(长期预测器)和创新编码,在CELP(码激励线性预测)编码器中需要很大一部分的总比特率。提出了一种降低激励编码码率的方法。在浊音段中,音高变化缓慢,这一事实可以用来为激励序列设计强大的动态比特分配方案。位的分配由两种方法决定。在一种方法中,LTP索引是霍夫曼编码的。这使得LTP代码本在具有稳定音高频率的语音段(即浊音段)期间只需要少量比特。在另一种方法中,导出了为每个LTP指数分配不同数量的创新码字的高比率近似值。作为对动态位分配的补充,开发了一种LTP索引搜索方法,该方法考虑分配给每个LTP索引的创新码字数量,以搜索最优LTP序列。仿真结果表明,使用这些方法可以在不改变语音质量的情况下将比特率降低400 bit/s。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信