{"title":"全局最优位分配","authors":"Xiaolin Wu","doi":"10.1109/DCC.1993.253148","DOIUrl":null,"url":null,"abstract":"Given M quantizers of variable rates, scaler or/and vector, the globally optimal allocation of B bits to the M quantizers can be computed in O(MB/sup 2/) time with integer constraint, or O(MB2/sup B/) time without. The author also considers the nested optimization problem of optimal bit allocation with respect to optimal quantizers. Various algorithmic techniques are proposed to solve this new problem in pseudo-polynomial time.<<ETX>>","PeriodicalId":315077,"journal":{"name":"[Proceedings] DCC `93: Data Compression Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Globally optimal bit allocation\",\"authors\":\"Xiaolin Wu\",\"doi\":\"10.1109/DCC.1993.253148\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given M quantizers of variable rates, scaler or/and vector, the globally optimal allocation of B bits to the M quantizers can be computed in O(MB/sup 2/) time with integer constraint, or O(MB2/sup B/) time without. The author also considers the nested optimization problem of optimal bit allocation with respect to optimal quantizers. Various algorithmic techniques are proposed to solve this new problem in pseudo-polynomial time.<<ETX>>\",\"PeriodicalId\":315077,\"journal\":{\"name\":\"[Proceedings] DCC `93: Data Compression Conference\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] DCC `93: Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1993.253148\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] DCC `93: Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1993.253148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Given M quantizers of variable rates, scaler or/and vector, the globally optimal allocation of B bits to the M quantizers can be computed in O(MB/sup 2/) time with integer constraint, or O(MB2/sup B/) time without. The author also considers the nested optimization problem of optimal bit allocation with respect to optimal quantizers. Various algorithmic techniques are proposed to solve this new problem in pseudo-polynomial time.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[Proceedings] DCC `93: Data Compression Conference](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
