Low Complexity Algorithm for Antenna Selection using Hierarchical Matching Pursuit

Jonathan Gois, Vinicius Nunes Henrique Silva, Tadeu Ferreira

DOI: 10.14209/sbrt.2023.1570920483

Evento: XLI Simpósio Brasileiro de Telecomunicações e Processamento de Sinais (SBrT2023)

Keywords: Massive MIMO Antenna Selection Matching Pursuit

Abstract

Massive MIMO systems have grown in popularity due to the implementations of 5G and the prospect of 6G technologies. Massive MIMO enables more efficient use of spectrum resources and larger data rates. When the number of antennas in a base station increases, so do the energy consumption and hardware cost. The high use of energy and processing can be managed through antenna selection. Among the structures proposed in the literature, this article presents hierarchical matching pursuit algorithm for antenna selection (HMPAS) that uses a combination of branch-and-bound with the matching pursuit antenna selection algorithm. In our experiments, the proposed algorithm presented considerable computational complexity reduction resulting in a shorter running time than the benchmark algorithms, while maintaining the error rate.

Download