AI 中文总结
研究通过时间调制匹配突破楚极限的问题，推导非线性微分条件证明可微调制函数次优，得出最优切换轨迹是Bang-Bang分布，还建立上限揭示天线电尺寸与切换时间的关系。
AI 中文摘要
本文表明，通过时间调制匹配超越关于品质因数的楚极限需要非光滑切换策略。我们推导了一个非线性微分条件以表明可微调制函数是次优的，然后表明使楚极限违反最大化的最优切换轨迹是分段常数（Bang-Bang）分布。最后，我们建立了一个连接天线尺寸、切换速度和误码率的上限，这表明随着天线电尺寸变小，切换时间变长。
英文摘要
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.
CommentsAccepted to the IEEE Asilomar conference 2026
