A code-matched collision-free S-random interleaver for turbo codes

Mohamed S. Omeira, G. Hamad, A. Elbayoumy
{"title":"A code-matched collision-free S-random interleaver for turbo codes","authors":"Mohamed S. Omeira, G. Hamad, A. Elbayoumy","doi":"10.1109/INTELCIS.2015.7397251","DOIUrl":null,"url":null,"abstract":"Due to the increasing throughput requirements of wireless applications, turbo decoders with parallel processing are needed. Interleavers with no memory collisions should to be used in such decoders to avoid overall throughput reduction. In this paper, a new collision-free S-random interleaver design is introduced. The proposed interleaver adds the excellent performance of code-matched interleavers to the collision-free interleaving property. The algorithm for the proposed interleaver construction is detailed. Simulation results show a better error performance for the presented interleaver over the non-code-matched collision-free random interleaver.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTELCIS.2015.7397251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Due to the increasing throughput requirements of wireless applications, turbo decoders with parallel processing are needed. Interleavers with no memory collisions should to be used in such decoders to avoid overall throughput reduction. In this paper, a new collision-free S-random interleaver design is introduced. The proposed interleaver adds the excellent performance of code-matched interleavers to the collision-free interleaving property. The algorithm for the proposed interleaver construction is detailed. Simulation results show a better error performance for the presented interleaver over the non-code-matched collision-free random interleaver.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
turbo码的码匹配无碰撞s随机交织器
由于无线应用对吞吐量的要求越来越高,需要具有并行处理能力的涡轮解码器。在这样的解码器中应该使用没有内存冲突的交织器,以避免总体吞吐量降低。本文介绍了一种新的无碰撞s随机交织器设计。该交织器在具有无碰撞交织特性的基础上,又增加了代码匹配交织器的优良性能。详细介绍了所提出的交织器构建算法。仿真结果表明,该交织器比非编码匹配的无碰撞随机交织器具有更好的误差性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the use of probabilistic model-checking for the verification of prognostics applications Prospective, knowledge based clinical risk analysis: The OPT-model Partial deduction in predicate calculus as a tool for artificial intelligence problem complexity decreasing XML summarization: A survey Finding the pin in the haystack: A Bot Traceback service for public clouds
×
引用
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