{"title":"有损源编码算法采用无损多终端源代码","authors":"J. Muramatsu, S. Miyake","doi":"10.1109/ISITA.2008.4895482","DOIUrl":null,"url":null,"abstract":"A lossy source coding algorithm is presented that employs lossless multi-terminal source codes. By using nearly optimal lossless multi-terminal source codes, the proposed algorithm achieves the rate-distortion limit. The construction of lossless multi-terminal source codes, which are needed for the lossy source coding algorithm, can be realized by using sparse matrices, known as Low Density Parity Check (LDPC) matrices, or Turbo codes, and practically efficient decoding algorithms such as the Belief Propagation (BP) algorithm and the Linear Codes Linear Program (LCLP) algorithm.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Lossy source coding algorithm using lossless multi-terminal source codes\",\"authors\":\"J. Muramatsu, S. Miyake\",\"doi\":\"10.1109/ISITA.2008.4895482\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A lossy source coding algorithm is presented that employs lossless multi-terminal source codes. By using nearly optimal lossless multi-terminal source codes, the proposed algorithm achieves the rate-distortion limit. The construction of lossless multi-terminal source codes, which are needed for the lossy source coding algorithm, can be realized by using sparse matrices, known as Low Density Parity Check (LDPC) matrices, or Turbo codes, and practically efficient decoding algorithms such as the Belief Propagation (BP) algorithm and the Linear Codes Linear Program (LCLP) algorithm.\",\"PeriodicalId\":338675,\"journal\":{\"name\":\"2008 International Symposium on Information Theory and Its Applications\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Information Theory and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITA.2008.4895482\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895482","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Lossy source coding algorithm using lossless multi-terminal source codes
A lossy source coding algorithm is presented that employs lossless multi-terminal source codes. By using nearly optimal lossless multi-terminal source codes, the proposed algorithm achieves the rate-distortion limit. The construction of lossless multi-terminal source codes, which are needed for the lossy source coding algorithm, can be realized by using sparse matrices, known as Low Density Parity Check (LDPC) matrices, or Turbo codes, and practically efficient decoding algorithms such as the Belief Propagation (BP) algorithm and the Linear Codes Linear Program (LCLP) algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
