权衡编码复杂性和对包擦除通道的反馈需求

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI:10.1109/ALLERTON.2008.4797716

S. Puducheri, T. Fuja

{"title":"权衡编码复杂性和对包擦除通道的反馈需求","authors":"S. Puducheri, T. Fuja","doi":"10.1109/ALLERTON.2008.4797716","DOIUrl":null,"url":null,"abstract":"We study the tradeoffs in employing two different approaches - coding and feedback - for reliable communication over packet erasure channels. Results are shown for a scheme that combines both approaches. Inspired by this scheme, we use rate distortion results to characterize the best achievable tradeoffs for a class of joint coding-and-feedback schemes.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Trading off coding complexity and feedback requirements for the packet erasure channel\",\"authors\":\"S. Puducheri, T. Fuja\",\"doi\":\"10.1109/ALLERTON.2008.4797716\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the tradeoffs in employing two different approaches - coding and feedback - for reliable communication over packet erasure channels. Results are shown for a scheme that combines both approaches. Inspired by this scheme, we use rate distortion results to characterize the best achievable tradeoffs for a class of joint coding-and-feedback schemes.\",\"PeriodicalId\":120561,\"journal\":{\"name\":\"2008 46th Annual Allerton Conference on Communication, Control, and Computing\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 46th Annual Allerton Conference on Communication, Control, and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2008.4797716\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2008.4797716","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们研究了采用两种不同的方法-编码和反馈-在包擦除信道上进行可靠通信的权衡。结果显示了一个方案，结合这两种方法。受此方案的启发，我们使用速率失真结果来表征一类联合编码和反馈方案的最佳可实现折衷。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Trading off coding complexity and feedback requirements for the packet erasure channel

We study the tradeoffs in employing two different approaches - coding and feedback - for reliable communication over packet erasure channels. Results are shown for a scheme that combines both approaches. Inspired by this scheme, we use rate distortion results to characterize the best achievable tradeoffs for a class of joint coding-and-feedback schemes.

求助全文

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

来源期刊

2008 46th Annual Allerton Conference on Communication, Control, and Computing

自引率

0.00%

发文量

期刊最新文献

Learning sparse doubly-selective channels Ergodic two-user interference channels: Is separability optimal? Weight distribution of codes on hypergraphs Compound multiple access channels with conferencing decoders Transmission techniques for relay-interference networks