基于最优距离二次置换多项式的Turbo码交织器

E. Rosnes, O. Takeshita
{"title":"基于最优距离二次置换多项式的Turbo码交织器","authors":"E. Rosnes, O. Takeshita","doi":"10.1109/ISIT.2006.261897","DOIUrl":null,"url":null,"abstract":"An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation. Also, the recently proposed quadratic permutation polynomial (QPP) based interleavers by Sun and Takeshita (IEEE Trans. Inform. Theory, Jan. 2005) provide excellent performance for short-to-medium block lengths. In this work the minimum distance of turbo codes with QPP-based interleavers is considered in detail. Large tables of optimum (in terms of turbo code minimum distance and multiplicity) QPPs for turbo codes with 8-state and 16-state constituent codes are presented. The minimum distances are compared to existing results in the literature on dithered relative prime (DRP) interleavers. The optimality of the new tables makes them an excellent source of information to advance the understanding of permutation polynomial (PP) based interleavers","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"Optimum Distance Quadratic Permutation Polynomial-Based Interleavers for Turbo Codes\",\"authors\":\"E. Rosnes, O. Takeshita\",\"doi\":\"10.1109/ISIT.2006.261897\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation. Also, the recently proposed quadratic permutation polynomial (QPP) based interleavers by Sun and Takeshita (IEEE Trans. Inform. Theory, Jan. 2005) provide excellent performance for short-to-medium block lengths. In this work the minimum distance of turbo codes with QPP-based interleavers is considered in detail. Large tables of optimum (in terms of turbo code minimum distance and multiplicity) QPPs for turbo codes with 8-state and 16-state constituent codes are presented. The minimum distances are compared to existing results in the literature on dithered relative prime (DRP) interleavers. The optimality of the new tables makes them an excellent source of information to advance the understanding of permutation polynomial (PP) based interleavers\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.261897\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.261897","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 38

摘要

交织器是影响turbo码信道编码性能的关键部件。代数结构特别有趣,因为它们允许分析设计和简单实用的硬件实现。此外,Sun和Takeshita最近提出了基于二次置换多项式(QPP)的交织器。通知。Theory, 2005年1月)为中短块长度提供了出色的性能。本文详细研究了基于qpp交织器的turbo码的最小距离问题。给出了具有8状态和16状态组成码的turbo码的最优qpp(根据turbo码最小距离和多重性)大表。将最小距离与已有文献中关于抖动相对素数交织器的结果进行了比较。新表的最优性使它们成为促进对基于置换多项式(PP)的交织器的理解的极好的信息源
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimum Distance Quadratic Permutation Polynomial-Based Interleavers for Turbo Codes
An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation. Also, the recently proposed quadratic permutation polynomial (QPP) based interleavers by Sun and Takeshita (IEEE Trans. Inform. Theory, Jan. 2005) provide excellent performance for short-to-medium block lengths. In this work the minimum distance of turbo codes with QPP-based interleavers is considered in detail. Large tables of optimum (in terms of turbo code minimum distance and multiplicity) QPPs for turbo codes with 8-state and 16-state constituent codes are presented. The minimum distances are compared to existing results in the literature on dithered relative prime (DRP) interleavers. The optimality of the new tables makes them an excellent source of information to advance the understanding of permutation polynomial (PP) based interleavers
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信