S. Reda EN160 SP’08 Design and Implementation of VLSI Systems (EN1600) Lecture 13: Logical Effort (2/2) Prof. Sherief Reda Division of Engineering, Brown University Spring 2008 [sources: Weste/Addison Wesley – Rabaey/Pearson]

S. Reda EN160 SP’08 Multistage logic networks Logical effort generalizes to multistage networks Path Logical Effort Path Electrical Effort Path Effort Can we write F=GH?

S. Reda EN160 SP’08 Can we write F = GH? No! Consider paths that branch: G = 1 H = 90 / 5 = 18 GH = 18 h 1 = (15 +15) / 5 = 6 h 2 = 90 / 15 = 6 F = g 1 g 2 h 1 h 2 = 36 = 2GH How to fix this problem?

S. Reda EN160 SP’08 Branching effort Introduce branching effort –Accounts for branching between stages in path Now we compute the path effort –F = GBH Note:

S. Reda EN160 SP’08 Logical Effort can help us answering two key questions 1.How large should be each stage in a multi- stage network to achieve the minimium delay? 2.What is the optimal number of stages to achieve the minimum delay

S. Reda EN160 SP’08 1. What is the optimal size of each stage? Delay is minimized when each stage bears the same effort Gate 1 Gate 2 GND Answer can be generalized. Thus, for N stages, minimum delay is achieved when each stage bears the same effort

S. Reda EN160 SP’08 Example: 3-stage path Select gate sizes x and y for least delay from A to B

S. Reda EN160 SP’08 Example: 3-stage path Logical EffortG = Electrical EffortH = Branching EffortB = Path EffortF = Best Stage Effort Parasitic DelayP = DelayD =

S. Reda EN160 SP’08 Example: 3-stage path Logical EffortG = (4/3)*(5/3)*(5/3) = 100/27 Electrical EffortH = 45/8 Branching EffortB = 3 * 2 = 6 Path EffortF = GBH = 125 Best Stage Effort Parasitic DelayP = = 7 DelayD = 3*5 + 7 = 22 = 4.4 FO4

S. Reda EN160 SP’08 Example: 3-stage path Work backward for sizes y = 45 * (5/3) / 5 = 15 x = (15*2) * (5/3) / 5 = 10

S. Reda EN160 SP’08 2. What is the optimal number of stages? Consider adding inverters to end of path –How many give least delay? Define best stage effort

S. Reda EN160 SP’08 Optimal number of stages has no closed-form solution Neglecting parasitics (p inv = 0), we find r = (e) For p inv = 1, solve numerically for r = 3.59 A path achieves least delay by using stages How sensitive is delay to using exactly the best number of stages? ρ = 4 is reasonable