This paper proposes a novel geometric programming based formulation to solve a gate-sizing and retiming problem in the context of circuit optimization. The gate-sizing aspect of the problem involves continuous variables while the retiming problem involves the placement of registers in the circuit and can be naturally modeled using discrete variables. Our formulation is solved using first-order convex programming. We show promising experimental results on industrial circuits. We also investigate formally the computational complexity of the problem. To our knowledge, this is the first effort that solves this problem in a single optimization framework.

中文翻译：

---

具有流水线约束的门大小调整的凸编程解决方案

本文提出了一种新颖的基于几何编程的公式，以解决电路优化背景下的门尺寸调整和重定时问题。该问题的门电路大小方面涉及连续变量，而重定时问题涉及电路中寄存器的放置，并且可以使用离散变量自然地对其建模。我们的公式是使用一阶凸规划求解的。我们在工业电路上显示出令人鼓舞的实验结果。我们还正式调查了问题的计算复杂性。据我们所知，这是在单个优化框架中解决此问题的第一步。