词条 | Timing closure |
释义 |
}} Timing closure is the process by which a logic design consisting of primitive elements such as combinatorial logic gates ( Many times logic circuit changes are handled by user's EDA tools based on timing constraint directives prepared by a designer. The term is also used for the goal that is achieved, when such a design has reached the end of the flow and its timing requirements are satisfied. The main steps of the design flow, which may be involved in this process, are logic synthesis, placement, clock-tree synthesis and routing. With present technologies all of them need to be timing-aware for a design to properly meet its timing requirements, but with technologies in the range of the micrometre only logic synthesis EDA tools had such a prerequisite. Nevertheless, even if timing-awareness was extended to all these steps starting from well-established principles used for logic synthesis, the two phases, logic and physical, of the timing closure process are conventionally handled by different design teams and different EDA tools. [https://web.archive.org/web/20070228233817/http://www.synopsys.com/products/logic/design_compiler.html Design Compiler] by Synopsys, Encounter RTL Compiler by Cadence Design Systems and BlastCreate by Magma Design Automation are examples of logic synthesis tools. [https://web.archive.org/web/20070206065723/http://www.synopsys.com/products/iccompiler/iccompiler.html IC Compiler] by Synopsys, SoC Encounter by Cadence Design Systems and Blast Fusion by Magma Design Automation are examples of tools capable of timing-aware placement, clock tree synthesis and routing and therefore used for physical timing closure. When the user requires the circuit to meet exceptionally difficult timing constraints, it may be necessary to utilize machine learning[1] [https://www.plunify.com/en/intime/ programs] to find an optimum set of FPGA synthesis, map, place and route tool configuration parameters that ensures the circuit will close timing. A timing requirement needs to be translated into a static timing constraint for an EDA tool to be able to handle it. See also
References
1. ^{{Cite web|url=http://www.plunify.com/xj/wp-content/uploads/sites/7/2017/01/intime_fpl2016.pdf|title=Boosting Convergence of Timing Closure using Feature Selection in a Learning-driven Approach|last=Yanghua|first=Que|date=2016|website=|archive-url=https://web.archive.org/web/20170918144155/http://www.plunify.com/xj/wp-content/uploads/sites/7/2017/01/intime_fpl2016.pdf|archive-date=2017-09-18|dead-url=yes|access-date=}} 1 : Timing in electronic circuits |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。