最佳周期交织器的设计

Y. Wang, Xinjun Du, Hui Li, Yumin Wang
{"title":"最佳周期交织器的设计","authors":"Y. Wang, Xinjun Du, Hui Li, Yumin Wang","doi":"10.1109/WAINA.2008.276","DOIUrl":null,"url":null,"abstract":"The optimal period interleaver can break the divisibility of the input sequence with N0 as the period of the feedback polynomial. But how to find the optimal period interleaver is still in consideration. Based on the divisibility of polynomial, we give a method to find the optimal period interleaver. The simulation results prove this method a good BER performance in the decoding process of short frame Turbo codes.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Design of Optimal Period Interleaver\",\"authors\":\"Y. Wang, Xinjun Du, Hui Li, Yumin Wang\",\"doi\":\"10.1109/WAINA.2008.276\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The optimal period interleaver can break the divisibility of the input sequence with N0 as the period of the feedback polynomial. But how to find the optimal period interleaver is still in consideration. Based on the divisibility of polynomial, we give a method to find the optimal period interleaver. The simulation results prove this method a good BER performance in the decoding process of short frame Turbo codes.\",\"PeriodicalId\":170418,\"journal\":{\"name\":\"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WAINA.2008.276\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAINA.2008.276","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最优周期交织器可以打破以N0为反馈多项式周期的输入序列的可整除性。但是如何找到最优的周期交织器仍在研究中。基于多项式的可整除性,给出了一种求最优周期交织器的方法。仿真结果表明,该方法在短帧Turbo码译码过程中具有良好的误码率性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The Design of Optimal Period Interleaver
The optimal period interleaver can break the divisibility of the input sequence with N0 as the period of the feedback polynomial. But how to find the optimal period interleaver is still in consideration. Based on the divisibility of polynomial, we give a method to find the optimal period interleaver. The simulation results prove this method a good BER performance in the decoding process of short frame Turbo codes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automated Metadata Generation and its Application to Biological Association Extraction Towards a Usenet-Like Discussion System for Users of Disconnected MANETs A New Centroid-Based Classifier for Text Categorization Explaining Answers from Agent Communication of Semantic Web Information Parallel Computing of CG Using an Open Source Windows Grid
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1