速率接近信道容量的同步数据传输

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-03-25 DOI:10.1109/ITWITWN.2007.4318032

A. Zhdanov

{"title":"速率接近信道容量的同步数据传输","authors":"A. Zhdanov","doi":"10.1109/ITWITWN.2007.4318032","DOIUrl":null,"url":null,"abstract":"The existing ARQ schemes (including a hybrid ARQ) have a throughput depending on packet error probability. In this paper we describe a strategy for delay tolerant applications which provide a constant throughput until the algorithm robustness criterion is not failed. The algorithm robustness criterion is applied to find the optimum size of the retransmission block in the assumption of the small changes of coding rate within the rate compatible codes family.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Isochronous Data Transmission With Rates Close to Channel Capacity\",\"authors\":\"A. Zhdanov\",\"doi\":\"10.1109/ITWITWN.2007.4318032\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The existing ARQ schemes (including a hybrid ARQ) have a throughput depending on packet error probability. In this paper we describe a strategy for delay tolerant applications which provide a constant throughput until the algorithm robustness criterion is not failed. The algorithm robustness criterion is applied to find the optimum size of the retransmission block in the assumption of the small changes of coding rate within the rate compatible codes family.\",\"PeriodicalId\":257392,\"journal\":{\"name\":\"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITWITWN.2007.4318032\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITWITWN.2007.4318032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

现有的ARQ方案(包括混合ARQ方案)的吞吐量取决于数据包的错误概率。本文描述了一种延迟容忍应用的策略，该策略在算法鲁棒性准则不失效之前提供恒定的吞吐量。采用算法鲁棒性准则，在速率兼容码族内编码速率变化较小的假设下，寻找最优重传块大小。

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

查看原文本刊更多论文

Isochronous Data Transmission With Rates Close to Channel Capacity

The existing ARQ schemes (including a hybrid ARQ) have a throughput depending on packet error probability. In this paper we describe a strategy for delay tolerant applications which provide a constant throughput until the algorithm robustness criterion is not failed. The algorithm robustness criterion is applied to find the optimum size of the retransmission block in the assumption of the small changes of coding rate within the rate compatible codes family.

求助全文

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

来源期刊

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks

自引率

0.00%

发文量