基于PTS降低OFDM系统PAPR的鸡群优化算法

IF 0.6 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Saruti Gupta, A. Goel
{"title":"基于PTS降低OFDM系统PAPR的鸡群优化算法","authors":"Saruti Gupta, A. Goel","doi":"10.24138/jcomss.v16i3.999","DOIUrl":null,"url":null,"abstract":"Partial transmit sequence (PTS) is a well-known PAPR reduction scheme for the OFDM system. One of the major challenge of this scheme is to find an optimal phase vector using exhaustive search over all the allowed phase factor combinations. This leads to increased search complexity which grows exponentially as the number of sub-blocks is increased. In this paper, chicken swarm optimization (CSO) based PTS system is designed that aims to find an optimal solution in less number of average iterations and therefore results in reduced computational complexity of the system. We have proposed two categories of the algorithm: (i) CSO-PTS system without threshold limit on PAPR (ii) CSO-PTS system with threshold limit on PAPR. Both the schemes offer effective trade-offs between the computational complexity and the PAPR reduction capability of the system. Simulation results confirm that our proposed schemes perform well in terms of low computational complexity, lesser number of average iterations and improved PAPR reduction capability of the OFDM signal without any loss in BER performance of the system.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"16 1","pages":"224-231"},"PeriodicalIF":0.6000,"publicationDate":"2020-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Chicken Swarm Optimization for PTS based PAPR Reduction in OFDM Systems\",\"authors\":\"Saruti Gupta, A. Goel\",\"doi\":\"10.24138/jcomss.v16i3.999\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Partial transmit sequence (PTS) is a well-known PAPR reduction scheme for the OFDM system. One of the major challenge of this scheme is to find an optimal phase vector using exhaustive search over all the allowed phase factor combinations. This leads to increased search complexity which grows exponentially as the number of sub-blocks is increased. In this paper, chicken swarm optimization (CSO) based PTS system is designed that aims to find an optimal solution in less number of average iterations and therefore results in reduced computational complexity of the system. We have proposed two categories of the algorithm: (i) CSO-PTS system without threshold limit on PAPR (ii) CSO-PTS system with threshold limit on PAPR. Both the schemes offer effective trade-offs between the computational complexity and the PAPR reduction capability of the system. Simulation results confirm that our proposed schemes perform well in terms of low computational complexity, lesser number of average iterations and improved PAPR reduction capability of the OFDM signal without any loss in BER performance of the system.\",\"PeriodicalId\":38910,\"journal\":{\"name\":\"Journal of Communications Software and Systems\",\"volume\":\"16 1\",\"pages\":\"224-231\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2020-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Communications Software and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24138/jcomss.v16i3.999\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Communications Software and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24138/jcomss.v16i3.999","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1

摘要

部分发射序列(PTS)是用于OFDM系统的众所周知的PAPR降低方案。该方案的主要挑战之一是在所有允许的相位因子组合上使用穷举搜索来找到最优相位向量。这导致搜索复杂度增加,搜索复杂度随着子块数量的增加而呈指数级增长。在本文中,设计了基于鸡群优化(CSO)的PTS系统,旨在在较少的平均迭代次数中找到最优解,从而降低系统的计算复杂度。我们提出了两类算法:(i)对PAPR没有阈值限制的CSO-PTS系统。这两种方案都在系统的计算复杂性和PAPR降低能力之间提供了有效的折衷。仿真结果证实,我们提出的方案在低计算复杂度、较少的平均迭代次数和改进的OFDM信号PAPR降低能力方面表现良好,而不会对系统的BER性能造成任何损失。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Chicken Swarm Optimization for PTS based PAPR Reduction in OFDM Systems
Partial transmit sequence (PTS) is a well-known PAPR reduction scheme for the OFDM system. One of the major challenge of this scheme is to find an optimal phase vector using exhaustive search over all the allowed phase factor combinations. This leads to increased search complexity which grows exponentially as the number of sub-blocks is increased. In this paper, chicken swarm optimization (CSO) based PTS system is designed that aims to find an optimal solution in less number of average iterations and therefore results in reduced computational complexity of the system. We have proposed two categories of the algorithm: (i) CSO-PTS system without threshold limit on PAPR (ii) CSO-PTS system with threshold limit on PAPR. Both the schemes offer effective trade-offs between the computational complexity and the PAPR reduction capability of the system. Simulation results confirm that our proposed schemes perform well in terms of low computational complexity, lesser number of average iterations and improved PAPR reduction capability of the OFDM signal without any loss in BER performance of the system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Communications Software and Systems
Journal of Communications Software and Systems Engineering-Electrical and Electronic Engineering
CiteScore
2.00
自引率
14.30%
发文量
28
审稿时长
8 weeks
×
引用
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学术官方微信