Optimum power allocation of parallel concatenated convolution turbo code using flower pollination algorithm

S. Banerjee, S. Chattopadhyay
{"title":"Optimum power allocation of parallel concatenated convolution turbo code using flower pollination algorithm","authors":"S. Banerjee, S. Chattopadhyay","doi":"10.1109/CIEC.2016.7513808","DOIUrl":null,"url":null,"abstract":"Efficient and reliable data transmission and storage are the challenging issues in modern communication system. Reproduction of reliable data has been achieved by controlling the errors in a noisy environment. To control this errors data has been coded properly by considering different coding techniques. Turbo Code (TC) is considered as one of the high-performance forward error correcting coding schemes which approaches to the Shannon limit. Here, a novel Parallel Concatenated Convolution Turbo code (PCCTC) has been proposed to improve the Bit Error Rate (BER) performance portentously by allocating optimized power in systematic and parity bits. BER performance of the system has been improved by using two symmetrical convolutional encoders. Through the simulation result, it is observed that the proposed Flower Pollination Algorithm (FPA) optimized Parallel Concatenated Convolution Turbo Code (PCCTC) provides better error performance over Uniform Power Allocation (UPA) based PCCTC as well as Harmony-Search (HS), Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) optimized PCCTC.","PeriodicalId":443343,"journal":{"name":"2016 2nd International Conference on Control, Instrumentation, Energy & Communication (CIEC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd International Conference on Control, Instrumentation, Energy & Communication (CIEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIEC.2016.7513808","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Efficient and reliable data transmission and storage are the challenging issues in modern communication system. Reproduction of reliable data has been achieved by controlling the errors in a noisy environment. To control this errors data has been coded properly by considering different coding techniques. Turbo Code (TC) is considered as one of the high-performance forward error correcting coding schemes which approaches to the Shannon limit. Here, a novel Parallel Concatenated Convolution Turbo code (PCCTC) has been proposed to improve the Bit Error Rate (BER) performance portentously by allocating optimized power in systematic and parity bits. BER performance of the system has been improved by using two symmetrical convolutional encoders. Through the simulation result, it is observed that the proposed Flower Pollination Algorithm (FPA) optimized Parallel Concatenated Convolution Turbo Code (PCCTC) provides better error performance over Uniform Power Allocation (UPA) based PCCTC as well as Harmony-Search (HS), Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) optimized PCCTC.
基于传粉算法的并行串联卷积turbo码的最优功率分配
高效、可靠的数据传输和存储是现代通信系统中具有挑战性的问题。通过控制噪声环境下的误差,实现了可靠数据的再现。为了控制这种错误,考虑了不同的编码技术,对数据进行了适当的编码。Turbo码(Turbo Code, TC)是一种接近香农极限的高性能前向纠错编码方案。本文提出了一种新的并行级联卷积Turbo码(PCCTC),通过在系统位和奇偶位上分配优化的功率来显著提高误码率(BER)性能。采用两个对称的卷积编码器,提高了系统的误码率。仿真结果表明,与基于均匀功率分配(UPA)的PCCTC以及和声搜索(HS)、粒子群优化(PSO)和遗传算法(GA)优化的PCCTC相比,所提出的优化的PCCTC具有更好的误差性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信