Nadim Ghaddar, Shouvik Ganguly, Lele Wang, Young-Han Kim
{"title":"有损源编码的乐高积木方法","authors":"Nadim Ghaddar, Shouvik Ganguly, Lele Wang, Young-Han Kim","doi":"10.1109/cwit55308.2022.9817668","DOIUrl":null,"url":null,"abstract":"Coding schemes for the lossy source coding problem are developed starting from point-to-point channel codes that are designed for symmetric channels. Bounds on the attained average distortion of the coding schemes are derived in terms of the parameters of the point-to-point channel codes. Assuming that the constituent channel codes satisfy some properties on the rate, the error probability and the input-output distribution of the decoding functions, the performance guarantees hold irrespective of other properties of the codes. Moreover, it is shown that the proposed coding schemes achieve the rate-distortion bound, provided that the constituent codes are rate-optimal. This would allow one to leverage commercial off-the-shelf codes for point-to-point symmetric channels in the practical implementation of lossy source codes.","PeriodicalId":401562,"journal":{"name":"2022 17th Canadian Workshop on Information Theory (CWIT)","volume":"71 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Lego- Brick Approach to Lossy Source Coding\",\"authors\":\"Nadim Ghaddar, Shouvik Ganguly, Lele Wang, Young-Han Kim\",\"doi\":\"10.1109/cwit55308.2022.9817668\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Coding schemes for the lossy source coding problem are developed starting from point-to-point channel codes that are designed for symmetric channels. Bounds on the attained average distortion of the coding schemes are derived in terms of the parameters of the point-to-point channel codes. Assuming that the constituent channel codes satisfy some properties on the rate, the error probability and the input-output distribution of the decoding functions, the performance guarantees hold irrespective of other properties of the codes. Moreover, it is shown that the proposed coding schemes achieve the rate-distortion bound, provided that the constituent codes are rate-optimal. This would allow one to leverage commercial off-the-shelf codes for point-to-point symmetric channels in the practical implementation of lossy source codes.\",\"PeriodicalId\":401562,\"journal\":{\"name\":\"2022 17th Canadian Workshop on Information Theory (CWIT)\",\"volume\":\"71 6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 17th Canadian Workshop on Information Theory (CWIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/cwit55308.2022.9817668\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 17th Canadian Workshop on Information Theory (CWIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/cwit55308.2022.9817668","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Coding schemes for the lossy source coding problem are developed starting from point-to-point channel codes that are designed for symmetric channels. Bounds on the attained average distortion of the coding schemes are derived in terms of the parameters of the point-to-point channel codes. Assuming that the constituent channel codes satisfy some properties on the rate, the error probability and the input-output distribution of the decoding functions, the performance guarantees hold irrespective of other properties of the codes. Moreover, it is shown that the proposed coding schemes achieve the rate-distortion bound, provided that the constituent codes are rate-optimal. This would allow one to leverage commercial off-the-shelf codes for point-to-point symmetric channels in the practical implementation of lossy source codes.