{"title":"A new pilot assignment scheme for mitigating pilot contamination in uplink massive multi-input–multi-output (MIMO) systems","authors":"","doi":"10.1186/s13638-023-02329-1","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Pilot contamination is a serious issue in massive multi–input–multi–output systems which significantly degrades system performance. In this paper, we investigate a new pilot assignment scheme by integrating two-dimensional genetic algorithm with Tabu-Search algorithm (TS) to mitigate the pilot contamination problem. Firstly, we design a two-dimensional genetic algorithm equipped with elitism strategy as a principal algorithm for solving the pilot assignment problem; then, aiming to enhance the convergence speed of the genetic algorithm to the ideal optimal solution, we integrate TS with the genetic algorithm. This integrated pilot assignment scheme, henceforth designated as GATS-PA, is found to be powerful in mitigating the pilot contamination problem. Numerical simulation results verify that the proposed pilot assignment scheme is very close to the ideal optimal solution with few numbers of iterations and outperforms existing methods in terms of enhancing the average uplink rate per user over a wide range of simulation parameters.</p>","PeriodicalId":12040,"journal":{"name":"EURASIP Journal on Wireless Communications and Networking","volume":"6 1","pages":""},"PeriodicalIF":2.3000,"publicationDate":"2024-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURASIP Journal on Wireless Communications and Networking","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1186/s13638-023-02329-1","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0
Abstract
Pilot contamination is a serious issue in massive multi–input–multi–output systems which significantly degrades system performance. In this paper, we investigate a new pilot assignment scheme by integrating two-dimensional genetic algorithm with Tabu-Search algorithm (TS) to mitigate the pilot contamination problem. Firstly, we design a two-dimensional genetic algorithm equipped with elitism strategy as a principal algorithm for solving the pilot assignment problem; then, aiming to enhance the convergence speed of the genetic algorithm to the ideal optimal solution, we integrate TS with the genetic algorithm. This integrated pilot assignment scheme, henceforth designated as GATS-PA, is found to be powerful in mitigating the pilot contamination problem. Numerical simulation results verify that the proposed pilot assignment scheme is very close to the ideal optimal solution with few numbers of iterations and outperforms existing methods in terms of enhancing the average uplink rate per user over a wide range of simulation parameters.
期刊介绍：
The overall aim of the EURASIP Journal on Wireless Communications and Networking (EURASIP JWCN) is to bring together science and applications of wireless communications and networking technologies with emphasis on signal processing techniques and tools. It is directed at both practicing engineers and academic researchers. EURASIP Journal on Wireless Communications and Networking will highlight the continued growth and new challenges in wireless technology, for both application development and basic research. Articles should emphasize original results relating to the theory and/or applications of wireless communications and networking. Review articles, especially those emphasizing multidisciplinary views of communications and networking, are also welcome. EURASIP Journal on Wireless Communications and Networking employs a paperless, electronic submission and evaluation system to promote a rapid turnaround in the peer-review process.
The journal is an Open Access journal since 2004.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
