基于差分进化和遗传算法的Turbo码优化

P. Krömer, V. Snás̃el, J. Platoš, A. Abraham
{"title":"基于差分进化和遗传算法的Turbo码优化","authors":"P. Krömer, V. Snás̃el, J. Platoš, A. Abraham","doi":"10.1109/HIS.2009.289","DOIUrl":null,"url":null,"abstract":"Since their appearance in 1993, first approaching the Shannon limit, turbo codes gave a new direction in the channel encoding field, especially since they have been adopted for multiple telecommunication norms. To obtain good performance, it is necessary to design a robust turbo code interleaver. This paper proposes a a differential evolution approach to find above average turbo code interleavers. Performance is compared with the conventional genetic algorithm approach and the empirical results illustrate that DE performs well.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Optimization of Turbo Codes by Differential Evolution and Genetic Algorithms\",\"authors\":\"P. Krömer, V. Snás̃el, J. Platoš, A. Abraham\",\"doi\":\"10.1109/HIS.2009.289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since their appearance in 1993, first approaching the Shannon limit, turbo codes gave a new direction in the channel encoding field, especially since they have been adopted for multiple telecommunication norms. To obtain good performance, it is necessary to design a robust turbo code interleaver. This paper proposes a a differential evolution approach to find above average turbo code interleavers. Performance is compared with the conventional genetic algorithm approach and the empirical results illustrate that DE performs well.\",\"PeriodicalId\":414085,\"journal\":{\"name\":\"2009 Ninth International Conference on Hybrid Intelligent Systems\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Ninth International Conference on Hybrid Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HIS.2009.289\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Ninth International Conference on Hybrid Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HIS.2009.289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

自1993年出现以来,turbo码首次接近香农极限,为信道编码领域提供了新的方向,特别是在多种电信规范中采用了turbo码。为了获得良好的性能,有必要设计一种鲁棒的turbo码交织器。提出了一种寻找高于平均水平的turbo码交织器的差分进化方法。将其性能与传统的遗传算法方法进行了比较,实证结果表明,遗传算法具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimization of Turbo Codes by Differential Evolution and Genetic Algorithms
Since their appearance in 1993, first approaching the Shannon limit, turbo codes gave a new direction in the channel encoding field, especially since they have been adopted for multiple telecommunication norms. To obtain good performance, it is necessary to design a robust turbo code interleaver. This paper proposes a a differential evolution approach to find above average turbo code interleavers. Performance is compared with the conventional genetic algorithm approach and the empirical results illustrate that DE performs well.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信