{"title":"产品积累代码:属性和性能","authors":"K. Narayanan, Jing Li, C. Georghiades","doi":"10.1109/ITW.2001.955123","DOIUrl":null,"url":null,"abstract":"A new class of codes, named product accumulate codes, which are the concatenation of an outer product code and an inner rate-1 differential encoder (or accumulator) is proposed. We show that these codes can perform within a few tenths of a dB from the Shannon limit for rates/spl ges/1/2. For practical block lengths, these codes provide similar performance to turbo codes but with significantly lower decoding complexity.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Product accumulate codes: properties and performance\",\"authors\":\"K. Narayanan, Jing Li, C. Georghiades\",\"doi\":\"10.1109/ITW.2001.955123\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new class of codes, named product accumulate codes, which are the concatenation of an outer product code and an inner rate-1 differential encoder (or accumulator) is proposed. We show that these codes can perform within a few tenths of a dB from the Shannon limit for rates/spl ges/1/2. For practical block lengths, these codes provide similar performance to turbo codes but with significantly lower decoding complexity.\",\"PeriodicalId\":288814,\"journal\":{\"name\":\"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)\",\"volume\":\"131 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2001.955123\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2001.955123","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Product accumulate codes: properties and performance
A new class of codes, named product accumulate codes, which are the concatenation of an outer product code and an inner rate-1 differential encoder (or accumulator) is proposed. We show that these codes can perform within a few tenths of a dB from the Shannon limit for rates/spl ges/1/2. For practical block lengths, these codes provide similar performance to turbo codes but with significantly lower decoding complexity.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
