在本文中，我们将迭代作为优化循环(refinementcycles)讨论，而非可交付增量。

In this article, we talk about iterations as refinement cycles, and not necessarily as deliverable increments.

youdao

文中提出了显式冗余的队列循环优化算法，完全消除了此类冗余，从而有效地减少了生成电路的基片面积，提高了电路的可测试性。

This paper proposes a queue loop optimization algorithm to remove explicit redundancy completely which decreases the circuit area and improves the testability.

youdao

文中提出了显式冗余的队列循环优化算法，完全消除了此类冗余，从而有效地减少了生成电路的基片面积，提高了电路的可测试性。

This paper proposes a queue loop optimization algorithm to remove explicit redundancy completely which decreases the circuit area and improves the testability.

youdao