子带编码的最佳位分配算法

ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing Pub Date : 1988-04-11 DOI:10.1109/ICASSP.1988.196695

P. Westerink, J. Biemond, D. Boekee

{"title":"子带编码的最佳位分配算法","authors":"P. Westerink, J. Biemond, D. Boekee","doi":"10.1109/ICASSP.1988.196695","DOIUrl":null,"url":null,"abstract":"An optimal bit allocation algorithm is presented that is suitable for all practical situations. Each source to be coded is assumed to have its own set of admissible quantizers (which can be either scalar or vector quantizers) which do not need to have integer bit rates. The distortion versus rate characteristic of each quantizer set may have an arbitrary shape. The algorithm is very simple in structure and can be applied to any practical coding scheme (such as a subband coder) that needs dynamic bit allocation.<<ETX>>","PeriodicalId":448544,"journal":{"name":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"156","resultStr":"{\"title\":\"An optimal bit allocation algorithm for sub-band coding\",\"authors\":\"P. Westerink, J. Biemond, D. Boekee\",\"doi\":\"10.1109/ICASSP.1988.196695\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An optimal bit allocation algorithm is presented that is suitable for all practical situations. Each source to be coded is assumed to have its own set of admissible quantizers (which can be either scalar or vector quantizers) which do not need to have integer bit rates. The distortion versus rate characteristic of each quantizer set may have an arbitrary shape. The algorithm is very simple in structure and can be applied to any practical coding scheme (such as a subband coder) that needs dynamic bit allocation.<<ETX>>\",\"PeriodicalId\":448544,\"journal\":{\"name\":\"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"156\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.1988.196695\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.1988.196695","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 156

摘要

提出了一种适用于各种实际情况的最优位分配算法。假设每个要编码的源都有自己的一组可接受的量化器(可以是标量量化器或矢量量化器)，这些量化器不需要具有整数比特率。每个量化器集的失真与率特性可以具有任意形状。该算法结构简单，可应用于任何需要动态分配比特的实际编码方案(如子带编码器)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An optimal bit allocation algorithm for sub-band coding

An optimal bit allocation algorithm is presented that is suitable for all practical situations. Each source to be coded is assumed to have its own set of admissible quantizers (which can be either scalar or vector quantizers) which do not need to have integer bit rates. The distortion versus rate characteristic of each quantizer set may have an arbitrary shape. The algorithm is very simple in structure and can be applied to any practical coding scheme (such as a subband coder) that needs dynamic bit allocation.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing

自引率

0.00%

发文量