A Double Sigmoid-Based Beamforming Algorithm With Reduced Computational Complexity

  • Raimundo N Robert Federal University of Santa Catarina
  • Ciro André Pitz Federal University of Santa Catarina
  • Rui Seara Federal University of Santa Catarina

Abstract

This paper introduces a new adaptive beamforming algorithm for cellular systems. Such an algorithm is based on the adaptive combination of vector projections (ACVP) framework presented in the open literature. The main novelty of the proposed algorithm is the use of both unipolar and bipolar sigmoid functions for supporting the adjustment of the combination coefficients used in the ACVP framework. The degree of freedom of these sigmoid functions allows updating the beamforming coefficients by using a smaller number of vector projections. As a consequence, the proposed algorithm, termed here double sigmoid ACVP (DS‑ACVP), presents a reduced computational complexity and is capable of outperforming other adaptive beamforming algorithms from the literature. Numerical simulation results corroborate the effectiveness of the proposed approach.

Published
26-04-2019
How to Cite
Robert, R., Pitz, C., & Seara, R. (2019). A Double Sigmoid-Based Beamforming Algorithm With Reduced Computational Complexity. Journal of Communication and Information Systems, 34(1), 120-130. https://doi.org/10.14209/jcis.2019.13
Section
Regular Papers