串级卷积码的交织器设计

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

Ralph Höst, Stefan Johannesson, Ralph Jordan

{"title":"串级卷积码的交织器设计","authors":"Ralph Höst, Stefan Johannesson, Ralph Jordan","doi":"10.1109/ISIT.2001.936075","DOIUrl":null,"url":null,"abstract":"Serially concatenated convolutional codes are considered. The free distance of this construction is shown to be lower-bounded by the product of the free distances of the outer and inner codes, if the precipices of the interleaver are sufficiently large. It is shown how to construct a convolutional scrambler with a given precipice.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On interleaver design for serially concatenated convolutional codes\",\"authors\":\"Ralph Höst, Stefan Johannesson, Ralph Jordan\",\"doi\":\"10.1109/ISIT.2001.936075\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Serially concatenated convolutional codes are considered. The free distance of this construction is shown to be lower-bounded by the product of the free distances of the outer and inner codes, if the precipices of the interleaver are sufficiently large. It is shown how to construct a convolutional scrambler with a given precipice.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"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.936075\",\"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.936075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

考虑串行连接的卷积码。如果交织器的悬崖足够大，则该结构的自由距离由内外码的自由距离的乘积表示为下限。给出了如何用给定的悬崖构造卷积扰频器。

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

查看原文

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

本刊更多论文

On interleaver design for serially concatenated convolutional codes

Serially concatenated convolutional codes are considered. The free distance of this construction is shown to be lower-bounded by the product of the free distances of the outer and inner codes, if the precipices of the interleaver are sufficiently large. It is shown how to construct a convolutional scrambler with a given precipice.

求助全文

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

来源期刊

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

自引率

0.00%

发文量

期刊最新文献

A simple encodable/decodable OFDM QPSK code with low peak-to-mean envelope power ratio The effect of redundancy on measurement Decision directed algorithms for multiuser detection A new modulation scheme using asymmetric error correcting code embedded in optical orthogonal code for optical CDMA Matrix CUSUM: a recursive multi-hypothesis change detection algorithm