基于归一化最小均方和粒子群优化算法的增强型数字预失真器

Omar Z. Alngar, W. El-Deeb, El-Sayed M. El-Rabaie
{"title":"基于归一化最小均方和粒子群优化算法的增强型数字预失真器","authors":"Omar Z. Alngar, W. El-Deeb, El-Sayed M. El-Rabaie","doi":"10.1109/JEC-ECC.2017.8305770","DOIUrl":null,"url":null,"abstract":"In this paper, two modified digital predistorters based on particle swarm optimization and normalized least mean square algorithms are introduced. The proposed algorithms reduce the non-linearity and memory effects that cause in-band distortions and increase the spectral regrowth in adjacent channels. the first proposed algorithm solves the convergence guarantees by the local search caused by particle swarm optimization. The second algorithm solves the same problem and improves the full random distributed particles defined in the swarm, simultaneously. Simulation results of the two proposed algorithms are demonstrated and compared with the conventional particle swarm optimization algorithm, traditional normalized least mean square algorithm and also compared with each other.","PeriodicalId":406498,"journal":{"name":"2017 Japan-Africa Conference on Electronics, Communications and Computers (JAC-ECC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Enhanced digital predistorter based on normalized least mean square and particle swarm optimization algorithms\",\"authors\":\"Omar Z. Alngar, W. El-Deeb, El-Sayed M. El-Rabaie\",\"doi\":\"10.1109/JEC-ECC.2017.8305770\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, two modified digital predistorters based on particle swarm optimization and normalized least mean square algorithms are introduced. The proposed algorithms reduce the non-linearity and memory effects that cause in-band distortions and increase the spectral regrowth in adjacent channels. the first proposed algorithm solves the convergence guarantees by the local search caused by particle swarm optimization. The second algorithm solves the same problem and improves the full random distributed particles defined in the swarm, simultaneously. Simulation results of the two proposed algorithms are demonstrated and compared with the conventional particle swarm optimization algorithm, traditional normalized least mean square algorithm and also compared with each other.\",\"PeriodicalId\":406498,\"journal\":{\"name\":\"2017 Japan-Africa Conference on Electronics, Communications and Computers (JAC-ECC)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Japan-Africa Conference on Electronics, Communications and Computers (JAC-ECC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JEC-ECC.2017.8305770\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Japan-Africa Conference on Electronics, Communications and Computers (JAC-ECC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JEC-ECC.2017.8305770","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文介绍了两种改进的基于粒子群优化和归一化最小均方算法的数字预失真器。所提出的算法减少了引起带内失真的非线性和记忆效应,并增加了相邻信道的频谱再生。第一种算法解决了粒子群算法的局部搜索带来的收敛性保证问题。第二种算法解决了同样的问题,同时改进了群中定义的全随机分布粒子。对两种算法的仿真结果进行了验证,并与传统的粒子群优化算法、传统的归一化最小均方算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Enhanced digital predistorter based on normalized least mean square and particle swarm optimization algorithms
In this paper, two modified digital predistorters based on particle swarm optimization and normalized least mean square algorithms are introduced. The proposed algorithms reduce the non-linearity and memory effects that cause in-band distortions and increase the spectral regrowth in adjacent channels. the first proposed algorithm solves the convergence guarantees by the local search caused by particle swarm optimization. The second algorithm solves the same problem and improves the full random distributed particles defined in the swarm, simultaneously. Simulation results of the two proposed algorithms are demonstrated and compared with the conventional particle swarm optimization algorithm, traditional normalized least mean square algorithm and also compared with each other.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信