{"title":"Performance-complexity tradeoffs for turbo and turbo-like codes","authors":"S. Dolinar, D. Divsalar, A. Kiely, F. Pollara","doi":"10.1109/ISIT.2001.935964","DOIUrl":null,"url":null,"abstract":"We take a first empirical step toward understanding the performance-complexity tradeoffs that have newly arisen since the advent of turbo codes. For a set of turbo and turbo-like codes, we study this tradeoff, measuring the degree to which the coder/decoder fails to attain the sphere packing bound.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.935964","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We take a first empirical step toward understanding the performance-complexity tradeoffs that have newly arisen since the advent of turbo codes. For a set of turbo and turbo-like codes, we study this tradeoff, measuring the degree to which the coder/decoder fails to attain the sphere packing bound.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
