GA-Aided Directivity in Volumetric and Planar Massive-Antenna Array Design

• URL: http://arxiv.org/abs/2301.02940v1
• Date: Sat, 7 Jan 2023 21:52:19 GMT
• Title: GA-Aided Directivity in Volumetric and Planar Massive-Antenna Array Design
• Authors: Bruno Felipe Costa, Taufik Abr\~ao
• Abstract summary: The problem of directivity enhancement, leading to the increase in the directivity gain over a certain desired angle of arrival/departure (AoA/AoD) is considered in this work. A new volumetric array of the directivity array is proposed using rectangular rectangular angles and a generalzimuth elevation pattern. Such a directivity distance is formulated to achieve as high directivity gains as possible.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The problem of directivity enhancement, leading to the increase in the directivity gain over a certain desired angle of arrival/departure (AoA/AoD), is considered in this work. A new formulation of the volumetric array directivity problem is proposed using the rectangular coordinates to describe each antenna element and the desired azimuth and elevation angles with a general element pattern. Such a directivity problem is formulated to find the optimal minimum distance between the antenna elements $d_\text{min}$ aiming to achieve as high directivity gains as possible. {An expedited implementation method is developed to place the antenna elements in a distinctive plane dependent on ($\theta_0$; $\phi_0$). A novel concept on optimizing directivity for the uniform planar array (OUPA) is introduced to find a quasi-optimal solution for the non-convex optimization problem with low complexity. This solution is reached by deploying the proposed successive evaluation and validation (SEV) method. {Moreover, the genetic} algorithm (GA) method was deployed to find the directivity optimization solution expeditiously. For a small number of antenna elements {, typically $N\in [4,\dots, 9]$,} the achievable directivity by GA optimization demonstrates gains of $\sim 3$ dBi compared with the traditional beamforming technique, using steering vector for uniform linear arrays (ULA) and uniform circular arrays (UCA), while gains of $\sim1.5$ dBi are attained when compared with an improved UCA directivity method. For a larger number of antenna elements {, two improved GA procedures, namely GA-{\it marginal} and GA-{\it stall}, were} proposed and compared with the OUPA method. OUPA also indicates promising directivity gains surpassing $30$ dBi for massive MIMO scenarios.

Related papers

• A Gradient Meta-Learning Joint Optimization for Beamforming and Antenna Position in Pinching-Antenna Systems [63.213207442368294]
  We consider a novel optimization design for multi-waveguide pinching-antenna systems.<n>The proposed GML-JO algorithm is robust to different choices and better performance compared with the existing optimization methods.
  arXiv  Detail & Related papers  (2025-06-14T17:35:27Z)
• Global Convergence of Adaptive Sensing for Principal Eigenvector Estimation [9.170594803531866]
  Subspace tracking algorithms like Oja's offer more efficient alternatives but typically require full-dimensional observations.<n>We prove this adaptive sensing approach achieves global convergence in the presence of noise.<n>Results have important implications for applications where acquiring full-dimensional samples is challenging or costly.
  arXiv  Detail & Related papers  (2025-05-16T05:41:11Z)
• Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency [52.60557300927007]
  We present a $textbfMA-OSMA$ algorithm to transfer the discrete submodular problem into a continuous optimization. We also introduce a projection-free $textbfMA-OSEA$ algorithm, which effectively utilizes the KL divergence by mixing a uniform distribution. Our algorithms significantly improve the $(frac11+c)$-approximation provided by the state-of-the-art OSG algorithm.
  arXiv  Detail & Related papers  (2025-02-07T15:57:56Z)
• Obtaining Lower Query Complexities through Lightweight Zeroth-Order Proximal Gradient Algorithms [65.42376001308064]
  We propose two variance reduced ZO estimators for complex gradient problems. We improve the state-of-the-art function complexities from $mathcalOleft(minfracdn1/2epsilon2, fracdepsilon3right)$ to $tildecalOleft(fracdepsilon2right)$.
  arXiv  Detail & Related papers  (2024-10-03T15:04:01Z)
• Double Variance Reduction: A Smoothing Trick for Composite Optimization Problems without First-Order Gradient [40.22217106270146]
  Variance reduction techniques are designed to decrease the sampling variance, thereby accelerating convergence rates of first-order (FO) and zeroth-order (ZO) optimization methods. In composite optimization problems, ZO methods encounter an additional variance called the coordinate-wise variance, which stems from the random estimation. This paper proposes the Zeroth-order Proximal Double Variance Reduction (ZPDVR) method, which utilizes the averaging trick to reduce both sampling and coordinate-wise variances.
  arXiv  Detail & Related papers  (2024-05-28T02:27:53Z)
• ELRA: Exponential learning rate adaption gradient descent optimization method [83.88591755871734]
  We present a novel, fast (exponential rate), ab initio (hyper-free) gradient based adaption. The main idea of the method is to adapt the $alpha by situational awareness. It can be applied to problems of any dimensions n and scales only linearly.
  arXiv  Detail & Related papers  (2023-09-12T14:36:13Z)
• Orthogonal Directions Constrained Gradient Method: from non-linear equality constraints to Stiefel manifold [16.099883128428054]
  We propose a novel algorithm, the Orthogonal Directions Constrained Method (ODCGM) ODCGM only requires computing a projection onto a vector space. We show that ODCGM exhibits the near-optimal oracle complexities.
  arXiv  Detail & Related papers  (2023-03-16T12:25:53Z)
• Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
  Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications. This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
  arXiv  Detail & Related papers  (2023-01-30T15:46:39Z)
• Optimal Pattern synthesis of linear antenna array using Ant Hill Colonization Optimization algorithm(AHCOA) [1.588193964339148]
  AHCOA is a new nature inspired meta algorithm inspired by how there is a hierarchy and departments in the ant hill. It has high probabilistic potential in solving unconstrained but also constrained optimization problems.
  arXiv  Detail & Related papers  (2022-07-06T10:22:05Z)
• Matching Pursuit Based Scheduling for Over-the-Air Federated Learning [67.59503935237676]
  This paper develops a class of low-complexity device scheduling algorithms for over-the-air learning via the method of federated learning. Compared to the state-of-the-art proposed scheme, the proposed scheme poses a drastically lower efficiency system. The efficiency of the proposed scheme is confirmed via experiments on the CIFAR dataset.
  arXiv  Detail & Related papers  (2022-06-14T08:14:14Z)
• Learning to Approximate: Auto Direction Vector Set Generation for Hypervolume Contribution Approximation [6.617487928813376]
  Hypervolume contribution is an important concept in evolutionary multi-objective optimization (EMO) An R2 indicator variant (i.e., $RtextHVC$ indicator) is proposed to approximate the hypervolume contribution. In this paper, we propose textitLearning to Approximate (LtA), a direction vector set generation method for the $RtextHVC$ indicator.
  arXiv  Detail & Related papers  (2022-01-18T02:31:15Z)
• AdaGDA: Faster Adaptive Gradient Descent Ascent Methods for Minimax Optimization [104.96004056928474]
  We propose a class of faster adaptive gradient descent methods for non-strongly-concave minimax problems. We show that our method reaches a lower sample complexity of $O(kappa2.5epsilon-3)$ with the mini-batch size $O(kappa)$.
  arXiv  Detail & Related papers  (2021-06-30T14:47:09Z)
• Correcting Momentum with Second-order Information [50.992629498861724]
  We develop a new algorithm for non-critical optimization that finds an $O(epsilon)$epsilon point in the optimal product. We validate our results on a variety of large-scale deep learning benchmarks and architectures.
  arXiv  Detail & Related papers  (2021-03-04T19:01:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.