COLO: Combined osprey and lyrebird optimization for optimal antenna selection for massive MIMO system

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computers & Electrical Engineering Pub Date : 2025-03-17 DOI:10.1016/j.compeleceng.2025.110245
Raghunath Mandipudi, Chandra Shekhar Kotikalapudi
{"title":"COLO: Combined osprey and lyrebird optimization for optimal antenna selection for massive MIMO system","authors":"Raghunath Mandipudi,&nbsp;Chandra Shekhar Kotikalapudi","doi":"10.1016/j.compeleceng.2025.110245","DOIUrl":null,"url":null,"abstract":"<div><div>Massive MIMO (M-MIMO) design is essential for enhancing spatial multiplexing gains in modern communication systems, but it often compromises energy efficiency (EE). Selecting the optimal antenna subset is crucial for boosting EE without negatively impacting spectrum efficiency (SE). However, due to the exponential increase in processing time as antenna count rises, exhaustive search methods become impractical for large MIMO systems. To address this, a novel optimization approach for optimal antenna selection (OAS) is proposed, combining the Osprey Optimization Algorithm (OOA) and Lyrebird Optimization Algorithm (LOA) into a hybrid COLO algorithm. COLO introduces key innovations, including a Feature Dependency-based (FDB) selection technique, a Global Positioning Strategy (GPS) for better search guidance, and OOA integration for enhanced exploration and exploitation. This approach aims to maximize SE while improving system efficiency. The suggested COLO for the maximal scenario has a lower fitness of 4.55×10–09, whereas the traditional LOA, RPO, OOA, EHO, COA, CB-PSO, and GA+CSO+PSO models achieve a higher fitness than COLO. The performance of COLO-based OAS is evaluated against existing methods in terms of efficiency, antenna count, statistical analysis, and convergence, demonstrating its superiority in maximizing SE.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"123 ","pages":"Article 110245"},"PeriodicalIF":4.0000,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Electrical Engineering","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0045790625001880","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Massive MIMO (M-MIMO) design is essential for enhancing spatial multiplexing gains in modern communication systems, but it often compromises energy efficiency (EE). Selecting the optimal antenna subset is crucial for boosting EE without negatively impacting spectrum efficiency (SE). However, due to the exponential increase in processing time as antenna count rises, exhaustive search methods become impractical for large MIMO systems. To address this, a novel optimization approach for optimal antenna selection (OAS) is proposed, combining the Osprey Optimization Algorithm (OOA) and Lyrebird Optimization Algorithm (LOA) into a hybrid COLO algorithm. COLO introduces key innovations, including a Feature Dependency-based (FDB) selection technique, a Global Positioning Strategy (GPS) for better search guidance, and OOA integration for enhanced exploration and exploitation. This approach aims to maximize SE while improving system efficiency. The suggested COLO for the maximal scenario has a lower fitness of 4.55×10–09, whereas the traditional LOA, RPO, OOA, EHO, COA, CB-PSO, and GA+CSO+PSO models achieve a higher fitness than COLO. The performance of COLO-based OAS is evaluated against existing methods in terms of efficiency, antenna count, statistical analysis, and convergence, demonstrating its superiority in maximizing SE.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Electrical Engineering
Computers & Electrical Engineering 工程技术-工程:电子与电气
CiteScore
9.20
自引率
7.00%
发文量
661
审稿时长
47 days
期刊介绍: The impact of computers has nowhere been more revolutionary than in electrical engineering. The design, analysis, and operation of electrical and electronic systems are now dominated by computers, a transformation that has been motivated by the natural ease of interface between computers and electrical systems, and the promise of spectacular improvements in speed and efficiency. Published since 1973, Computers & Electrical Engineering provides rapid publication of topical research into the integration of computer technology and computational techniques with electrical and electronic systems. The journal publishes papers featuring novel implementations of computers and computational techniques in areas like signal and image processing, high-performance computing, parallel processing, and communications. Special attention will be paid to papers describing innovative architectures, algorithms, and software tools.
期刊最新文献
COLO: Combined osprey and lyrebird optimization for optimal antenna selection for massive MIMO system A multi-perturbation consistency framework for semi-supervised person re-identification Integrating frequency limitation and feature refinement for robust 3D Gaussian segmentation AI-DeepFrothNet: Continuous monitoring and tracking of froth flotation working condition by root cause analysis and optimized predictive control Feature subset selection for big data via parallel chaotic binary differential evolution and feature-level elitism
×
引用
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