turbo和类turbo代码的性能复杂性权衡

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

S. Dolinar, D. Divsalar, A. Kiely, F. Pollara

{"title":"turbo和类turbo代码的性能复杂性权衡","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":"{\"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}","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

摘要

我们采取了第一个经验步骤，以理解性能复杂性的权衡，这是自涡轮码出现以来新出现的。对于一组turbo码和类turbo码，我们研究了这种权衡，测量了编码器/解码器未能达到球体填充界的程度。

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

查看原文本刊更多论文

Performance-complexity tradeoffs for turbo and turbo-like codes

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.

求助全文

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

来源期刊

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

自引率

0.00%

发文量