Logic Effort
D ( g a t e ) = l n 2 R e q , g a t e ( C i n t , g a t e + C L ) l n 2 R e q , i n v C i n t , i n v = R e q , g a t e ( C i n t , g a t e + C L ) R e q , i n v C i n t , i n v = R e q , g a t e C i n t , g a t e R e q , i n v C i n t , i n v + R e q , g a t e C L R e q , i n v C i n t , i n v = R e q , g a t e C i n t , g a t e R e q , i n v C i n t , i n v + R e q , g a t e C g i n , g a t e R e q , i n v C i n t , i n v ∗ C L C g i n , g a t e = P + L E ∗ F O = P a r a s i t i c d e l a y ( P ) + L o g i c a l E f f o r t ( L E ) ∗ F a n o u t ( F O ) D(gate) = \frac{ln2\; R_{eq,gate}(C_{int,gate}+C_L)}{ln2\; R_{eq,inv}C_{int,inv}} \; = \; \frac{R_{eq,gate}(C_{int,gate}+C_L)}{R_{eq,inv}C_{int,inv}} \\ = \frac{R_{eq,gate}C_{int,gate}}{R_{eq,inv}C_{int,inv}} \ + \ \frac{R_{eq,gate}C_L}{R_{eq,inv}C_{int,inv}} \\ = \frac{R_{eq,gate}C_{int,gate}}{R_{eq,inv}C_{int,inv}} \ + \ \frac{R_{eq,gate}C_{gin,gate}}{R_{eq,inv}C_{int,inv}} \ \ast \ \frac{C_L}{C_{gin,gate}} = \pmb{P + LE \ast FO} \\ = \pmb{Parasitic delay(P) \ + \ Logical Effort(LE) \ \ast \ Fanout(FO) } D(gate)=ln2Req,invCint,invln2Req,gate(Cint,gate+CL)=Req,invCint,invReq,gate(Cint,gate+CL)=Req,invCint,invReq,gateCint,gate + Req,invCint,invReq,gateCL=Req,invCint,invReq,gateCint,gate + Req,invCint,invReq,gateCgin,gate ∗ Cgin,gateCL=P+LE∗FOP+LE∗FOP+LE∗FO=Parasiticdelay(P) + LogicalEffort(LE) ∗ Fanout(FO)Parasiticdelay(P) + LogicalEffort(LE) ∗ Fanout(FO)Parasiticdelay(P) + Lo
推荐阅读
-
详解PADS软件中Logic多门电路设计的细节点与步骤
-
1631. Path With Minimum Effort
-
在使用Effort内存数据库进行单元测试时遇到错误
-
in an effort to
-
[LeetCode] 1631. Path With Minimum Effort
-
Daily LeetCode Challenge: 1631 - Minimum Effort Path (Medium) in Java | Find the Route with Least Physical Exhaustion
-
【Leetcode】1631. Path With Minimum Effort
-
An Error vs Effort ParadoxLevel 2 headings may be created by course providers in the future.
-
A little effort everyday, you will make a big difference.
-
Micro ROS教程:轻松实现Best Effort订阅者编程笔记