{"title":"Throughput performance of an incremental-redundancy ARQ scheme in the block-fading Gaussian collision channel","authors":"G. Caire, C. Leanderson","doi":"10.1109/ISIT.2001.935918","DOIUrl":null,"url":null,"abstract":"The throughput performance of an incremental-redundancy ARQ scheme based on simple convolutional codes of rate 1/M is evaluated for the block-fading Gaussian collision channel. The performance of these codes is seen to get close to the limiting performance of binary random codes with typical set decoding.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"36 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.935918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The throughput performance of an incremental-redundancy ARQ scheme based on simple convolutional codes of rate 1/M is evaluated for the block-fading Gaussian collision channel. The performance of these codes is seen to get close to the limiting performance of binary random codes with typical set decoding.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
