{"title":"基于同心置换码的矢量量化器设计","authors":"Mohit K. Sharma, A. Rajesh, P. K. Bora","doi":"10.1109/NCC.2012.6176776","DOIUrl":null,"url":null,"abstract":"We address an important issue in the design of concentric permutation code based vector quantizers to select the optimal integer partitions. We establish that, for concentric permutation code based vector quantizers, the optimum integer partitions exhibit monotonicity with its index. In addition, a reduced complexity encoding scheme for concentric permutation code based vector quantizers is presented.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On concentric permutation code based vector quantizer design\",\"authors\":\"Mohit K. Sharma, A. Rajesh, P. K. Bora\",\"doi\":\"10.1109/NCC.2012.6176776\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address an important issue in the design of concentric permutation code based vector quantizers to select the optimal integer partitions. We establish that, for concentric permutation code based vector quantizers, the optimum integer partitions exhibit monotonicity with its index. In addition, a reduced complexity encoding scheme for concentric permutation code based vector quantizers is presented.\",\"PeriodicalId\":178278,\"journal\":{\"name\":\"2012 National Conference on Communications (NCC)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2012.6176776\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2012.6176776","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On concentric permutation code based vector quantizer design
We address an important issue in the design of concentric permutation code based vector quantizers to select the optimal integer partitions. We establish that, for concentric permutation code based vector quantizers, the optimum integer partitions exhibit monotonicity with its index. In addition, a reduced complexity encoding scheme for concentric permutation code based vector quantizers is presented.