2026/07/26 by Mohamed Akrout, Miguel Rodrigo Castellanos
Computer Science · Mathematics · #cs.IT #math.IT
This paper shows that surpassing the Chu limit on Q-factors via time-modulated matching requires non-smooth switching strategies. We derive a nonlinear differential condition to show that differentiable modulation functions are sub-optimal, then show that the optimal switching trajectory for maximizing the violation of the Chu limit is a piecewise-constant (Bang-Bang) profile. Finally, we establish an upper-bound connecting the antenna size, switching speed, and bit error rate, which reveals that switching time becomes longer as antennas become electrically smaller.