Chao Chen, Xiangyang Ji, Qionghai Dai, Xiaodong Liu
{"title":"基于Burrows-Wheeler变换的二进制有限记忆源的睡狼编码","authors":"Chao Chen, Xiangyang Ji, Qionghai Dai, Xiaodong Liu","doi":"10.1109/DCC.2009.54","DOIUrl":null,"url":null,"abstract":"In this paper, an asymmetric Slepian-Wolf coding(SWC) scheme for binary finite memory source (FMS) is proposed. The a priori information about the source is extracted from the side information at the decoder by Burrows-Wheeler Transform (BWT). Such information is then utilized for the LDPC code based decoding. Benefiting from the universality of BWT, our coding scheme can be applied to any FMS. Experimental results show that our scheme performs significantly better than the scheme which does not utilize the a priori information for decoding.","PeriodicalId":377880,"journal":{"name":"2009 Data Compression Conference","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Slepian-Wolf Coding of Binary Finite Memory Source Using Burrows-Wheeler Transform\",\"authors\":\"Chao Chen, Xiangyang Ji, Qionghai Dai, Xiaodong Liu\",\"doi\":\"10.1109/DCC.2009.54\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an asymmetric Slepian-Wolf coding(SWC) scheme for binary finite memory source (FMS) is proposed. The a priori information about the source is extracted from the side information at the decoder by Burrows-Wheeler Transform (BWT). Such information is then utilized for the LDPC code based decoding. Benefiting from the universality of BWT, our coding scheme can be applied to any FMS. Experimental results show that our scheme performs significantly better than the scheme which does not utilize the a priori information for decoding.\",\"PeriodicalId\":377880,\"journal\":{\"name\":\"2009 Data Compression Conference\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.2009.54\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2009.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Slepian-Wolf Coding of Binary Finite Memory Source Using Burrows-Wheeler Transform
In this paper, an asymmetric Slepian-Wolf coding(SWC) scheme for binary finite memory source (FMS) is proposed. The a priori information about the source is extracted from the side information at the decoder by Burrows-Wheeler Transform (BWT). Such information is then utilized for the LDPC code based decoding. Benefiting from the universality of BWT, our coding scheme can be applied to any FMS. Experimental results show that our scheme performs significantly better than the scheme which does not utilize the a priori information for decoding.