Lossless Compression of Mapped Domain Linear Prediction Residual for ITU-T Recommendation G.711.0

N. Harada, Y. Kamamoto, T. Moriya
{"title":"Lossless Compression of Mapped Domain Linear Prediction Residual for ITU-T Recommendation G.711.0","authors":"N. Harada, Y. Kamamoto, T. Moriya","doi":"10.1109/DCC.2010.69","DOIUrl":null,"url":null,"abstract":"ITU-T Rec. G.711 is widely used for the narrow band speech communication. ITU-T has just established a very low complexity and efficient lossless coding standard for G.711, called G.711.0 - Lossless compression of G.711 pulse code modulation. This paper introduces some coding technologies newly proposed and applied to the G.711.0 codec, such as Plus-Minus zero mapping for the mapped domain linear predictive coding and escaped-Huffman coding combined with adaptive recursive Rice coding for lossless compression of the prediction residual. Performance test results for those coding tools are shown in comparison with the results for the conventional technology. The performance is measured based on the figure of merit (FoM), which is a function of the trade-off between compression performance and computational complexity. The proposed tools improve the compression performance by 0.16% in total while keeping the computational complexity of encoder/decoder pair low (about 1.0 WMOPS in average and 1.667 WMOPS in the worst-case).","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2010.69","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

ITU-T Rec. G.711 is widely used for the narrow band speech communication. ITU-T has just established a very low complexity and efficient lossless coding standard for G.711, called G.711.0 - Lossless compression of G.711 pulse code modulation. This paper introduces some coding technologies newly proposed and applied to the G.711.0 codec, such as Plus-Minus zero mapping for the mapped domain linear predictive coding and escaped-Huffman coding combined with adaptive recursive Rice coding for lossless compression of the prediction residual. Performance test results for those coding tools are shown in comparison with the results for the conventional technology. The performance is measured based on the figure of merit (FoM), which is a function of the trade-off between compression performance and computational complexity. The proposed tools improve the compression performance by 0.16% in total while keeping the computational complexity of encoder/decoder pair low (about 1.0 WMOPS in average and 1.667 WMOPS in the worst-case).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
ITU-T G.711.0建议的映射域线性预测残差无损压缩
ITU-T Rec. G.711广泛用于窄带语音通信。ITU-T刚刚为G.711建立了一个非常低复杂度和高效的无损编码标准,称为G.711.0 - G.711脉冲编码调制的无损压缩。本文介绍了在G.711.0编解码器中新提出并应用的编码技术,如映射域线性预测编码的正负零映射和预测残差无损压缩的逃逸-霍夫曼编码与自适应递归Rice编码相结合。给出了这些编码工具的性能测试结果,并与传统技术的测试结果进行了比较。性能是基于性能值(FoM)来衡量的,它是压缩性能和计算复杂性之间权衡的函数。所提出的工具在保持编码器/解码器对的计算复杂度较低(平均约1.0 WMOPS,最坏情况约1.667 WMOPS)的同时,将压缩性能提高了0.16%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Shape Recognition Using Vector Quantization Lossless Reduced Cutset Coding of Markov Random Fields Optimized Analog Mappings for Distributed Source-Channel Coding An MCMC Approach to Lossy Compression of Continuous Sources Lossless Compression of Mapped Domain Linear Prediction Residual for ITU-T Recommendation G.711.0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1