PreprintCC BY 4.0arXiv
Upper Bounds on Efficiency of Pixel Antennas
Abstract
This letter presents a method to compute fundamental bounds on the total efficiency of pixel antennas. Using semidefinite relaxation, we obtain an upper bound on the optimization problem of maximizing the antenna's total efficiency subject to binary-valued pixel states. The bounds are demonstrated for antennas with varying numbers of pixels and compared with realizable solutions obtained using the genetic algorithm.
Related
- Endpoint obstructions to upper bounds on Wilsonian thresholds from finite positive effective field theory moments
- Fundamental Bounds on the Oscillation Efficiency of Markov Networks
- Improved Upper and Lower Bounds for Quantum Convex-Body Volume Estimation
- Bounds on the minimum orbital period of general static spherical black holes: a sharp upper bound and a conditional lower bound
- RDT based upper bounds on the largest average submatrix values
BibTeX
@misc{salmi2026upper,
title = {{Upper Bounds on Efficiency of Pixel Antennas}},
author = {Albert Salmi and Philipp del Hougne and Leo Lahti and Ville Viikari},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.01107},
eprint = {2610.01107},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.01107},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Upper Bounds on Efficiency of Pixel Antennas
AU - Albert Salmi
AU - Philipp del Hougne
AU - Leo Lahti
AU - Ville Viikari
PY - 2026
DA - 2026/10/01
PB - arXiv
DO - 10.48550/arxiv.2610.01107
UR - https://arxiv.org/abs/2610.01107
AB - This letter presents a method to compute fundamental bounds on the total efficiency of pixel antennas. Using semidefinite relaxation, we obtain an upper bound on the optimization problem of maximizing the antenna's total efficiency subject to binary-valued pixel states. The bounds are demonstrated for antennas with varying numbers of pixels and compared with realizable solutions obtained using the genetic algorithm.
ER -