Optimum Discrete Beamforming via Minkowski Sum of Polygons
Abstract
This letter casts the problem of optimum discrete beamforming as the computation of the Minkowski sum of convex polygons, which is itself a convex polygon. The number of vertices of the latter is at most the sum of the number of vertices of the original polygons, enabling its efficient computation. This original and intuitive formulation confirms that the optimum beamforming solution can be found efficiently in broad generality.
Fields of Study & Subjects
Speech and Audio Processing
Direction-of-Arrival Estimation Techniques
Sparse and Compressive Sensing Techniques
Publication details
- Journal / source
- IEEE Signal Processing Letters
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Volume
- 33
- Pages
- 1082–1085
- Publication date
- 1 January 2026