Emerging millimeter-wave (mmWave) MIMO radars combine the benefits of large bandwidth available at mmWave frequencies with the spatial diversity provided by MIMO architectures, significantly enhancing radar capabilities for automotive, surveillance, and imaging applications. However, deploying large numbers of antennas and transceivers at these high frequencies substantially increases chip complexity and hardware costs. In this paper, we address the design of sparse two-dimensional (2D) antenna arrays that retain the desirable beampattern characteristics of fully populated arrays – namely, narrow mainlobes and low sidelobes – while significantly reducing the required number of antenna elements. We formulate the sparse array design problem as a beampattern matching optimization, which selects optimal subsets of transmit and receive antenna positions from an initial dense grid. To efficiently solve this challenging nonconvex optimization problem, we introduce an iterative algorithm combining Majorization–Minimization (MM) and Alternating Optimization (AO) techniques. We provide theoretical guarantees for convergence to at least a local optimum. Additionally, we propose a weighting vector optimization step to further enhance sidelobe suppression. Numerical simulations confirm that the proposed method maintains angular resolution and Sidelobe Levels (SLLs) comparable to those of full arrays, while substantially reducing hardware complexity and cost. Performance comparisons against existing methods demonstrate notable improvements in sidelobe suppression and computational efficiency without compromising processing gain.

Optimized sparse 2D antenna array design via beampattern matching

Karimian-Sichani, Nazila;Greco, Maria S.;Gini, Fulvio;
2026-01-01

Abstract

Emerging millimeter-wave (mmWave) MIMO radars combine the benefits of large bandwidth available at mmWave frequencies with the spatial diversity provided by MIMO architectures, significantly enhancing radar capabilities for automotive, surveillance, and imaging applications. However, deploying large numbers of antennas and transceivers at these high frequencies substantially increases chip complexity and hardware costs. In this paper, we address the design of sparse two-dimensional (2D) antenna arrays that retain the desirable beampattern characteristics of fully populated arrays – namely, narrow mainlobes and low sidelobes – while significantly reducing the required number of antenna elements. We formulate the sparse array design problem as a beampattern matching optimization, which selects optimal subsets of transmit and receive antenna positions from an initial dense grid. To efficiently solve this challenging nonconvex optimization problem, we introduce an iterative algorithm combining Majorization–Minimization (MM) and Alternating Optimization (AO) techniques. We provide theoretical guarantees for convergence to at least a local optimum. Additionally, we propose a weighting vector optimization step to further enhance sidelobe suppression. Numerical simulations confirm that the proposed method maintains angular resolution and Sidelobe Levels (SLLs) comparable to those of full arrays, while substantially reducing hardware complexity and cost. Performance comparisons against existing methods demonstrate notable improvements in sidelobe suppression and computational efficiency without compromising processing gain.
2026
Sedighi, Saeid; Karimian-Sichani, Nazila; M. R., Bhavani Shankar; Greco, Maria S.; Gini, Fulvio; Ottersten, Björn
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/1344048
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact