块衰落高斯碰撞信道中增量冗余ARQ方案的吞吐量性能

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI:10.1109/ISIT.2001.935918

G. Caire, C. Leanderson

{"title":"块衰落高斯碰撞信道中增量冗余ARQ方案的吞吐量性能","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":"{\"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}","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

摘要

在块衰落高斯碰撞信道中，对基于1/M简单卷积码的增量冗余ARQ方案的吞吐量性能进行了评价。这些码的性能接近典型集译码的二进制随机码的极限性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Throughput performance of an incremental-redundancy ARQ scheme in the block-fading Gaussian collision channel

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

自引率

0.00%

发文量