{"title":"外在树解码","authors":"E. Psota, L. C. Pérez","doi":"10.1109/CISS.2009.5054754","DOIUrl":null,"url":null,"abstract":"A new decoding method, called extrinsic tree decoding, is presented for decoding low-density parity-check codes on modified finite computation trees. The proposed method maintains similar performance to that of existing iterative decoders, while providing a decoding method for which realistic upper bounds can be computed for practical codes.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"306 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Extrinsic tree decoding\",\"authors\":\"E. Psota, L. C. Pérez\",\"doi\":\"10.1109/CISS.2009.5054754\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new decoding method, called extrinsic tree decoding, is presented for decoding low-density parity-check codes on modified finite computation trees. The proposed method maintains similar performance to that of existing iterative decoders, while providing a decoding method for which realistic upper bounds can be computed for practical codes.\",\"PeriodicalId\":433796,\"journal\":{\"name\":\"2009 43rd Annual Conference on Information Sciences and Systems\",\"volume\":\"306 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 43rd Annual Conference on Information Sciences and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2009.5054754\",\"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 43rd Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2009.5054754","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new decoding method, called extrinsic tree decoding, is presented for decoding low-density parity-check codes on modified finite computation trees. The proposed method maintains similar performance to that of existing iterative decoders, while providing a decoding method for which realistic upper bounds can be computed for practical codes.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
