Turbo代码性能是代码块大小的函数

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI:10.1109/ISIT.1998.708612

S. Dolinar, D. Divsalar, F. Pollara

{"title":"Turbo代码性能是代码块大小的函数","authors":"S. Dolinar, D. Divsalar, F. Pollara","doi":"10.1109/ISIT.1998.708612","DOIUrl":null,"url":null,"abstract":"We show that a single family of turbo codes is \"nearly perfect\" with respect to Shannon's (1959) sphere-packing bound, over a wide range of code rates and block sizes. We also assess the \"imperfectness\" of various non-turbo codes for comparison,.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":"{\"title\":\"Turbo code performance as a function of code block size\",\"authors\":\"S. Dolinar, D. Divsalar, F. Pollara\",\"doi\":\"10.1109/ISIT.1998.708612\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that a single family of turbo codes is \\\"nearly perfect\\\" with respect to Shannon's (1959) sphere-packing bound, over a wide range of code rates and block sizes. We also assess the \\\"imperfectness\\\" of various non-turbo codes for comparison,.\",\"PeriodicalId\":133728,\"journal\":{\"name\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"35\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1998.708612\",\"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. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1998.708612","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 35

摘要

我们表明，在码率和块大小的广泛范围内，相对于Shannon(1959)的球体填充界，单一的涡轮码族是“近乎完美的”。我们还评估了各种非turbo码的“不完美性”，以便进行比较。

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

查看原文本刊更多论文

Turbo code performance as a function of code block size

We show that a single family of turbo codes is "nearly perfect" with respect to Shannon's (1959) sphere-packing bound, over a wide range of code rates and block sizes. We also assess the "imperfectness" of various non-turbo codes for comparison,.

求助全文

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

来源期刊

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)

自引率

0.00%

发文量