1. Home
  2. PD
  3. STA
Content on this page
  • Diff b/w DTA & STA
    •
  • Static Timing Analysis
    •
  • main steps in STA
    •
  • STA(input & output)
    •
  • Timing Report
    •
  • Clocked storage elements
    •
  • Delays
  • Pins related to clock
  • Timing Arc
    •
  • Timing Unate
    •
  • Clock definitions in STA
    •
  • Timing Paths
  • Timing Path Groups
  • Clock Latency
  • Insertion Delay
  • Clock Uncertainty
    •
  • Clock Skew
  • Clock Jitter
  • Glitch
    •
  • Pulse width
    •
  • Duty Cycle
  • Transition/Slew
    •
  • Asynchronous Path
    •
  • Critical Path
    •
  • Shortest Path
  • Clock Gating Path
    •
  • Launch path
  • Arrival Path
  • Required Time
    •
  • Common Path Pessimism(CPP/CRPR)
    •
  • Slack
  • Setup and Hold time
    •
  • Setup & hold time violations
    •
  • Recovery Time
    •
  • Removal Time
  • Recovery & Removal time violations
    •
  • Single Cycle path
  • Multi Cycle Path
  • Half Cycle Path
    •
  • False Path
    •
  • Clock Domain Crossing(CDC)
  • Clock Domain Synchronization Scheme
    •
  • Bottleneck Analysis
    •
  • Multi-VT Cells(HVT LVT SVT)
    •
  • Time Borrowing/Stealing
    •
  • Types of STA (PBA GBA)
    •
  • Diff b/w PBA & GBA
  • Block based STA & Path based STA
    •

    Static Timing Analysis

    Static Timing Analysis

    Difference between Dynamic Timing Analysis and Static Timing Analysis
    Dynamic Timing Analysis
    Static Timing Analysis
    Verifies functionality of the design by applying input vectors and checking for correct output vectors Checks Static Delay requirements of the circuit without any input or output vectors, so analysis times are relatively short and STA does not check for logical correctness of the design
    Quality increases with the increase of input test vectors Clock related all information has to be fed to the design in the form of constraints and the correctness of the constraints decides the quality
    Increased Test Vectors increase Simulation Time Timing can be analyzed for worst case and best case simultaneously and also all timing paths are considered
    Can be used for synchronous as well as asynchronous designs Not suitable for asynchronous designs
    Also best suitable for designs having clocks crossing multiple domains Not suitable for designs having clocks crossing multiple domains
    Computational complexity involved in finding the Input Patterns/Vectors that produces maximum delay at the output Has more pessimism and thus gives maximum delay of the design and STA and it works with timing models

    Static Timing Analysis

    • Effective methodology for verifying the timing characteristics of a design without the use of test vectors
    • Static Timing Analysis can be done only for Register-Transfer-Logic (RTL) designs
    • Functionality of the design must be cleared before the design is subjected to STA
    • STA approach typically takes a fraction of the time it takes to run logic simulation
    STA is basically method of adding the net delays and cell delays to obtain path delays.
    then STA tool analyzes all paths from each and every start point to each and every end point and compares it against the constraint(timing specification) that exists for that path.

    Purpose of Static Timing Analysis

    • Fist, STA calculates the path delays for optimization tools. then based on the path delays, the optimization tool chooses cells from the timing library to create a circuit that meets your timing requirement.
    • Second, STA analyzes the timing of a circuit to verify that the circuit works at the specified frequency.

    Main steps of STA

    • Break the design into sets of timing paths
    • Calculate the delay of each path
    • Check all path delays to see if the given timing constraints are met

    STA inputs and outputs

    STA inputs and outputs

    Timing Report

    timing report

    timing report
    The above timing report is divided in 4 parts as
      Header
    • it consist of start point(FF1) and end point(FF2)
    • path group which tells for which timing path group it belogs.
    • Path type : here it is max which states setup and if it was min then it is hold.
      Data Arrival Section
    • reports the total time taken to arrive at D Pin of Flip flop 2. (ref fig just above timing report)
      Data Required Section
    • reports the total time taken to arrive the clock pin of FF1 minus the setup time of FF2. (ref fig just above timing report)
      Slack
    • timing difference between required and arrival time i.e (RT-AT)

    Typical symbols which can be seen in PrimeTime report :
    • “&” after an incremental delay number shows that the delay number is calculated with Resistor-Capacitor (RC) network back-annotation.
    • “*” for Standard Delay Format (SDF) back-annotation
    • “+” for lumped RC
    • “H” for hybrid annotation
    • “r” in the path column for the rising edge of the signal
    • “f” in the path column for the falling edge of the signal

    • Most timing reports use ns for the time unit. However, you can use the PrimeTime commandreport_unitsto report all theunits, such as capacitance, resistance, time, and voltage units used by the design.

    Clocked Storage Elements

    Transparent Latch, Level Sensitive

  • Data passes through Latch when clock high, latched when clock is low
    latch vs flip flop, difference between latch and flip flop

    D-Type Register or Flip-Flop, Edge-Triggered

  • Data captured on rising edge of clock, held for rest of the cycle
    latch vs flip flop, difference between latch and flip flop

    Delays

    • Time taken by a signal to propagate through a Cell or Net
    • Actual Path Delay is sum of net and Cell Delays along the timing path
    • Cell Delay is a function of Input Transition Time (Slew Rate), Total Output Load (Net Cap + Sum of attached pin caps) and Process Parameters (Temperature, Power Level)
    Intrinsic delay
  • Internal to the Cell from Input pin to Output pin caused by internal capacitance

    Propagation Delay
  • Delay by a cell for a change of input signal to result a change at output signal as a function of Input Slew and Output load
  • Propagation Delay can be Low to High (tPLH) and High to Low (tPHL)
  • Maximum Propagation Delay (Clock to Q) is considered for Setup check

    Contamination Delay
  • Best case delay from valid input to output
  • Minimum Propagation Delay (Clock to Q) which is called Contamination Delay is considered for Hold check

    Net Delay
  • Total time for charging/discharging all the parasitic present in the given net

    Pins related to Clock Design

    clock pins
    Start/ Source / Root Pins
  • Source pin of a Clock

    Stop/ Sink/ Leaf Pins
  • All Clock Pins of Flip Flops
  • Clock wont propagate after this Pin

    Through pin
  • To make a Clock pin of a flop not a CTS Leaf pin

    Preserved Pin
  • If we need to preserve a pin w.r.t. location etc.

    Exclude/ Ignore Pins
  • All non-clock pins (D pin of Flip Flops or combo logic inputs)
  • Not considered for Clock propagation

    Float Pins (Implicit Stop/ Macro Model)
  • Same as Stop/ Sink Pin but internal Clock Latency of it is considered for Clock Tree
  • Its actually entry pin of the Hard Macro

    Explicit Sync (Stop) Pin
  • Input of combo logic while considering Clock Tree
  • Important while considering Clock Gating

    Explicit Exclude (Ignore) Sync Pin
  • Clock Pin of Flop is not considered as Sync/ Stop pin
  • This pin is due to Clock Gating concept
  • In clock gating the signal will be given to AND Gate

    Timing Arc

    timing arc
    • Timing Arc is internal to the cell
    • Combinational Cells has Timing Arcs from each Input to each Output of the cell
    • Flip-flops have Timing Arcs from the Clock Input pin to Data Output Q pin (Propagation delay/ Delay Arc) and from Clock Input pin to Data Input D pin (setup, hold checks/ Constraint Arc)
    • Latches have 2 timing arcs:
      • Clock pin to Output Q pin, when D is stable
      • Data D pin to Output Q pin when D changes (Latch is transparent)

    Timing Unate

    timing unate
    positive unate if a rising transition on an input causes the output to rise (or not to change) and a falling transition on an input causes the output to fall (or not to change). For example, the timing arcs for AND and OR type cells are positive unate. See Figure(a)

    A negative unate timing arc is one where a rising transition on an input causes the output to have a falling transition (or not to change) and a fall ing transition on an input causes the output to have a rising transition (or not to change). For example, the timing arcs for NAND and NOR type cells are negative unate.See Figure(b)

    In a non-unate timing arc, the output transition cannot be determined solely from the direction of change of an input but also depends upon the state of the other inputs. For example, the timing arcs in an XOR cell (exclusive-or) are non-unate. See Figure(c).

    Unateness is important for timing as it specifies how the edges (transitions) can propagate through a cell and how they appear at the output of the cell.

    One can take advantage of the non-unateness property of a timing arc, such as when an xor cell is used, to invert the polarity of a clock. See the exaample below(figure). If input POLCTRL is a logic-0, the clock DDRCLK on output of the cell UXOR0 has the same polarity as the input clock MEMCLK. If POLCTRL is a logic-1, the clock on the output of the cell UXOR0 has the opposite polarity as the input clock MEMCLK.
    timing unate

    Clock definitions in STA

    • Synchronous Clocks
      • 2 clocks are synchronous w.r.t. each other
      • Timing paths launched by one clock and captured by another
    • Asynchronous Clocks
      • 2 clocks are asynchronous w.r.t. each other
      • If no timing relation, STA can’t be applied, so the tool wont check the timing
    • Mutually-Exclusive Clocks
      • Only one clock can be active at the circuit at any given time
    • Generated Clocks
      • Clock generated from a clock source as a multiple of the source clock frequency
      • The frequency can be a multiple or can be a divided by of the source clock
    • Virtual Clocks
      • Exists but not associated with any pin or port of the design
      • Used as a reference in STA to specify Input Delays and Output Loads relative to a clock (Needed to fix the Input2Reg and Reg2Output Violations)
      • By defining Virtual Clock IO Constraints can be defined relative to this Virtual Clock with no specification of the source port or pin

    Timing Paths

    A Timing Path is a point-to-point path in a design which can propagate data from one flip-flop to another
    • Each path has a start point and an end point
    • Start point: Input ports or Clock pins of flip-flops
    • Endpoints: Output ports or Data input pins of flip-flops
    timing paths, sta

    Timing Path Groups

    timing path groups, sta
      Timing paths are grouped into path groups by the clocks controlling their endpoints

    • Input pin/port to Register
      • Delays off-chip + Combinational logic delays up to the first sequential device
    • Register to Register
      • Start at a sequential device
      • CLK-to-Q transition delay + the combinational logic delay + external delay requirements
    • Register to Output pin/port
      • Delay and timing constraint (Setup and Hold) times between sequential devices for synchronous clocks + source and destination clock propagation times
    • Input pin/port to Output pin/port
      • Delays off-chip + combinational logic delays + external delay requirements

    Clock Latency

      • Total time taken by the clock signal to reach the input of the register
      • Source latency is the time between clock sources to clock definition ports
      • Network latency is the time between clock definition ports to clock leaf cells in the design

    Insertion Delay (ID)

      • ID is the clock latency, but after Clock Tree is synthesized. clock latency
      • ID is the physical delay and Clock Latency is the virtual delay
      • Latency is a target given to the tool through SDC file or clock tree attribute file and Insertion Delay is the achieved delay value after CTS

    Clock Uncertainty

    • Clock Uncertainty is the time difference between the arrivals of clock signals at registers in one clock domain or between domains
    • Uncertainties include Clock Skew, Clock Jitter and Clock Margin

    clock skew
    • Clock Skew refers to the absolute time difference in clock signal arrival between two points in the clock network
           TLAUNCH_CLOCK - TCAPTURE_CLOCK = TSKEW

    • Positive Skew occurs when the Capture Clock is late w.r.t. Launch Clock

    • Negative Skew occurs when the Capture Clock is early w.r.t. Launch Clock

    • Local Skew is the Skew between the clock phase delays of two flip-flops which are the Source and Target flop of a path (Source and Destination flop)

    • Global Skew is the difference between the longest and shortest branch of a Clock Tree (Maximum Insertion Delay – Minimum Insertion Delay)

    Clock Jitter

    • Jitter is the short-term variations of a signal with respect to its ideal position in time
    • The two major components of Jitter are random Jitter and deterministic Jitter
    • Factors causing Jitter includes imperfections in Clock oscillator, supply voltage variations, Temperature variations, Crosstalk
    clock jitter

    Glitch

    • Unexpected switching of any waveform
    • Due to late arrival time of Gate and it is for a short period of time
    • Cause extra delay and also it can cause extra power from false transitions
    jitter

    Pulse Width

    • Pulse Width is the time between the active and inactive states of the same signal
    • Minimum high pulse width is the amount of time after the rising edge of a clock, that the clock signal of a clocked device must remain stable
    • Minimum low pulse width is the amount of time after the falling edge of a clock, that the clock signal of a clocked device must remain stable

    Duty Cycle

    • Percentage of clock period having high pulse
    • Typically clock waveforms are of 50% Duty Cycle

    Transition/ Slew

    • Time taken by a signal to change the state (Volts/Second)
    • Rise Slew (tR) is called Rise Time and Fall Slew (tF) is called Fall Time
    • Minimum/ Maximum Transition is the Minimum/ Maximum slope allowed at leaf pins
    • Transition affects Power Dissipation, Latency and Pulse width

    Asynchronous Path

    • A path from an input port to an asynchronous set or clear pin of a sequential element

    Critical Path

    • The path which creates longest delay
    • Also called worst path/ late path/ max. path
    • Timing sensitive functional paths no additional gates are allowed to be added to the path

    Shortest Path

    • One that takes the shortest time; this is also called the best path or early path or a min path
    timing analysis

    Clock Gating Path

    • Path passed through a “gated element” to achieve additional advantages
    • Clock Gating transformation does not change the state of the flops and register
    clock gating path

    Launch Path

    • Launch path is launch clock path which is responsible for launching the data at launch flip flop

    Capture Path

    • Capture path is capture clock path which is responsible for capturing the data at capture flip flop

    Arrival Time

    • Launch path and data path together constitute arrival time of data at the input of capture flip-flop

    Required Time

    • Capture clock period and its path delay together constitute required time of data at the input of capture register
    timing analysis

    Common Path Pessimism

    • Same Clock Path may be a Launch Path for one Data Path and can be a Capture Path for another Data Path
    • While doing OCV derating, same path may get both Min./ Max. delay
    • But a path can have either as a Maximum delay or a Minimum delay (or anything in between) but never both delays at the same time
    • STA tools will have techniques to remove artificially introduced pessimism between the Launch Clock Path and the Capture Clock Path
    crpr, clock reconvergence pessimism removal

    Slack

    • Difference between Required Time (RT) and Arrival Time (AT)
    • Positive Slack at a node implies that the arrival time at that node may be increased without affecting the overall delay of the circuit
    • Negative Slack implies that a path is too slow, and the path must speed up if the whole circuit is to work at the desired speed

    Setup Time

    Setup time is the minimum amount of time the data signal should be held steady before the clock event so that the data are reliably sampled by the clock
    TLAUNCH_CLOCK + TCLK-Q_MAX + TCOMB_MAX ≤ TCAPTURE_CLOCK - TSETUP

    Hold Time

    Hold time is the minimum amount of time the data signal should be held steady after the clock event so that the data are reliably sampled
    TLAUNCH CLOCK + TCLK-Q_MIN + TCOMBO_MIN ≥ TCAPTURE_CLOCK + THOLD

    Setup Time and Hold Time Violations

    • If Setup time, TSETUP for a flip-flop and if the data is not stable before TSETUP from the active edge of clock, then there is a Setup Violation at that flip-flop
    • If hold time, THOLD for a flip flop and if the data is not stable after THOLD time from the active edge of clock, then there is a hold violation at that flip-flop
    • For a single cycle circuit the signal has to propagate through Data path in one clock cycle
    sta, setup hold

    Recovery Time

    • Recovery time is the minimum time that an asynchronous control input pin must be stable after being de-asserted and before the next clock transition (active edge)

    Removal Time

    • Removal time is the minimum time that an asynchronous control input pin must be stable before being de-asserted and before the previous clock transition (active edge)

    Recovery Time and Removal Time Violations

    • This check is to ensure that the asynchronously signal rise/ fall edge is not occurring at the clock edge; it should be some time before or after the clock edge
    • If that violates, then Recovery Time and Removal Time Violations
    • Although a flip-flop is asynchronously SET or CLEAR, the negation from its RESET state is synchronous
    recovery and removal timing

    Single Cycle Path

    • Timing path that is designed to take only one clock cycle for the data to propagate from the start point to the endpoint
    • Start point and endpoint are flops clocked by the same clock
    • By default tool will consider all timing paths as single cycle paths
    single cycle path

    Multi-Cycle Path

    • Timing path that is designed to take more than one clock cycle for the data to propagate from the start point to the endpoint
    • Start point and endpoint are flops clocked by the same clock
    • Need to specify the Launch edge and Capturing edge in SDC
    multi cycle path

    Half Cycle Path

    • Timing path that is designed to take half clock cycle (both of the clock edges) for the data to propagate from the start point to the endpoint
    • Start point and endpoint are flops clocked by the same clock
    • No need to specify the Launch edge and Capturing edge in SDC, since the tool can identify it from the netlist
    half cycle path

    False Path

    • Physically exist in the design but are Logically/ Functionally inactive/incorrect path
    • Means no data is transferred from Start Point to End Point
    • The goal in STA is to do timing analysis on all “true” timing paths, so these paths are excluded from timing analysis
    • Similarly timing can be disable for a pin or port or cell where the delay will be computed but won’t report it
    false path

    Clock Domain Crossing (CDC)

    • For designs with Asynchronous Clock Domains, the CDC signal violates the Setup/ Hold window of the receiving clock, resulting in metastability
    • Metastability results in unpredicted values and unpredictable delays
    • Those clocks has to be balanced together else, due to difference in the latency that may lead to timing violations
    • Max. Delay Constraint is used to make CDC paths to get synchronized
    clock domain crossing

    Clock Domain Synchronization Scheme

    • Pulse Width check
      • The control signals is stable for longer than one receive clock period
      • Ensures that data will not be lost due to inadequate width of the control signal
    • Data Stability check
      • The data updated by the transmit domain cannot be captured by the immediately following receive clock edge
      • Ensures that the captured data will not be metastable in the receive domain
    metastability

    Bottleneck Analysis

    • Lists the cells causing the timing violations on multiple paths
    • By identifying and fixing the violation caused by a Bottleneck Cell improved timing can be achieved
    bottleneck analysis

    Multi-VT Cells

    • Different threshold voltages are achieved by implanting dopants in different concentration
    • Need Multi-VT Library
    • Sub-threshold leakage varies exponentially with VT compared to the weaker dependency of delay over VT
    • If the optimization target is power performance, first use the HVT cells library and then try LVT cells
    • If the optimization target is to meet timing then first use LVT cells and then HVT cells
    • If you swap the capture flop from SVT to LVT or HVT, there will be very minimal setup/hold impact in most flops, it is of zero impact for hold
    • If you swap the launch flop from SVT to LVT or HVT, Setup will be improve and hold will be impacted correspondingly

    High Voltage Threshold (HVT )

    • Use in non-timing critical paths
    • Use in power critical paths
    • Has low leakage and low speed

    Low Voltage Threshold (LVT )

    • Use in timing critical paths
    • Use in non-power critical paths
    • Has high leakage and high speed

    Standard Voltage Threshold/ Regular Voltage Threshold (SVT/ RVT)

    • Medium delay and medium power requirement

    Time Borrowing

    • Time Borrowing is basically for Latched based Timing Analysis
    • Edge-triggered flip-flops change states at the clock edges, whereas latches change states as long as the clock pin is enabled
    • In latch based design longer combinational path can be compensated by shorter path delays in the subsequent logic stages
    • The technique of Borrowing Time from the shorter paths of the subsequent logic stages to the longer path is called Time Borrowing or Cycle Stealing
      time borrowing
    • Time Borrowing typically only affects setup slack calculation since time borrowing slows data arrival times
    • When the clocks of the Launching and Capturing Latches are out of phase, time borrowing is not to happen
    • Timing borrowing can be multistage
    • Maximum Borrow Time: Clock Pulse Width minus the library Setup Time of the Latch
    • Negative Borrow Time: Arrival Time minus the clock edge is a negative number, the amount of time borrowing is negative (no borrowing)

    Time Borrowing: Scenarios

    time borrowing
    • Scenario 1: When data is launching from a positive edge triggered flip flop and capture is to a negative level sensitive latch
    • Scenario 2: When launch is from a negative level sensitive latch and capture is to a positive edge triggered flip flop
    • Scenario 3: When launch and capture are from positive level sensitive latches

    Types of Static Timing Analysis

    • Path Based STA (PBA)
      • First, extract all possible topological paths
      • Next, for each path calculate it’s delay and compare it with endpoint (required) value
      • Calculate the Arrival Time (AT) by adding cell delay in timing paths
      • Check all path delays to see if the given Required Arrival Time (RAT) is met
    • Graph Based STA (GBA)
      • Two types of timing data :
      • Arrival times, AT (propagated forward from inputs)
      • Required Arrival Times RAT (propagated from outputs)
      • Slack is calculated on every design element: Slack = RT – AT
    graph based sta

    Difference between Path Based STA(PBA) and Graphh Based STA(GBA)

    pba gba

    Block-based STA vs. Path-based STA (example)

    timing analysis, static timming analysis

    • What is synthesis?
    • Goals of synthesis
    • Synthesis Flow
    • Synthesis (input & output)
    • HDL file gen. & lib setup
    • Reading files
    • Design envi. Constraints
    • Compile
    • Generate Reports
    • Write files
    Go To page
    • Netlist(.v or .vhd)
    • Constraints
    • Liberty Timing File(.lib or .db)
    • Library Exchange Format(LEF)
    • Technology Related files
    • TLU+ File
    • Milkyway Library
    • Power Specification File
    • Optimization Directives
    • Design Exchange Formats
    • Clock Tree Constraints/ Specification
    • IO Information File
    Go To page
    • import design
    • sanity checks
    • partitioning (flat and hierarchy)
    • objectives of floorplan
    • Inputs of floorplan
    • Floorplan flowchart
    • Floorplan Techniques
    • Terminologies and definitions
    • Steps in FloorPlan
    • Utilization
    • IO Placement
    • Macro Placement
    • Macro Placement Tips
    • Blockages (soft,hard,partial)
    • Halo/keepout margin
    • Issues arises due to bad floor-plan)
    • FloorPlan Qualifications
    • FloorPlan Output
    Go To page
    • levels of power distribution
    • Power Management
    • Powerplanning involves
    • Inputs of powerplan
    • Properties of ideal powerplan
    • Power Information
    • PowerPlan calculations
    • Sub-Block configuration
    • fullchip configuration
    • UPF Content
    • Isolation Cell
    • Level Shifters
    • Retention Registers
    • Power Switches
    • Types of Power dissipation
    • IR Drop
    • Electromigration
    Go To page
    • Pre-Placement
    • Pre-Placement Optimization
    • Placement
    • Placement Objectives
    • Goals of Placement
    • Inputs of Placement
    • Checks Before placement
    • Placement Methods(Timing & Congestion)
    • Placement Steps
    • Placement Optimization
    • Placement Qualifications
    • Placement Outputs
    Go To page
    • Pre-CTS Optimization
    • CTS
    • Diff b/w HFNS & CTS
    • Diff b/w Clock & normal buffer
    • CTS inputs
    • CTS Goals
    • Clock latency
    • Clock problems
    • Main concerns for Clock design
    • Clock Skew
    • Clock Jitter
    • CTS Pre requisites
    • CTS Objects
    • CTS Flow
    • Clock Tree Reference
    • Clock Tree Exceptions
    • CTS Algorithm
    • Analyze the Clock tree
    • Post CTS Optimization
    • CTS Outputs
    Go To page
    • Importance of Routing as Technology Shrinks
    • Routing Objectives
    • Routing
    • Routing Inputs
    • Routing Goals
    • Routing constraints
    • Routing Flow
    • Trial/Global Routing
    • Track Assignment
    • Detail/Nano Routing
    • Grid based Routing
    • Routing Preferences
    • Post Routing Optimization
    • Filler Cell Insertion
    • Metal Fill
    • Spare Cells Tie-up/ Tie-down
    Go To page
    • Diff b/w DTA & STA
    • Static Timing Analysis
    • main steps in STA
    • STA(input & output)
    • Timing Report
    • Clocked storage elements
    • Delays
    • Pins related to clock
    • Timing Arc
    • Timing Unate
    • Clock definitions in STA
    • Timing Paths
    • Timing Path Groups
    • Clock Latency
    • Insertion Delay
    • Clock Uncertainty
    • Clock Skew
    • Clock Jitter
    • Glitch
    • Pulse width
    • Duty Cycle
    • Transition/Slew
    • Asynchronous Path
    • Critical Path
    • Shortest Path
    • Clock Gating Path
    • Launch path
    • Arrival Path
    • Required Time
    • Common Path Pessimism(CPP/CRPR)
    • Slack
    • Setup and Hold time
    • Setup & hold time violations
    • Recovery Time
    • Removal Time
    • Recovery & Removal time violations
    • Single Cycle path
    • Multi Cycle Path
    • Half Cycle Path
    • False Path
    • Clock Domain Crossing(CDC)
    • Clock Domain Synchronization Scheme
    • Bottleneck Analysis
    • Multi-VT Cells(HVT LVT SVT)
    • Time Borrowing/Stealing
    • Types of STA (PBA GBA)
    • Diff b/w PBA & GBA
    • Block based STA & Path based STA
    Go To page

    • Congestion Analysis
    • Routing Congestion Analysis
    • Placement Cong. Analysis
    • Routing Congestion causes
    • Congestion Fixes
    • Global & local cong.
    • Congestion Profiles
    Go To page
    • Power Analysis
    • Leakeage Power
    • Switching Power
    • Short Circuit
    • Leakage/static Power
    • Static power Dissipation
    • Types of Static Leakage
    • Static Power Reduction Techniques
    • Dynamic/Switching Power
    • Dynamic Power calculation depends on
    • Types of Dynamic Power
    • Dynamic Power Reduction Techniques
    Go To page
    • IR Drop Analysis
    • Types of IR Drop & their methodologies
    • IR Drop Reasons
    • IR Drop Robustness Checks
    • IR Drop Impacts
    • IR Drop Remedies
    • Ldi/dt Effects
    Go To page

    • Design Parasitics
    • Latch-Up
    • Electrostatic Discharge(ESD)
    • Electromigration
    • Antenna Effect
    • Crosstalk
    • Soft Errors
    • Sef Heating
    Go To page
    • Cells in PD
    • Standard Cells
    • ICG Cells
    • Well Taps
    • End Caps
    • Filler Cells
    • Decap Cells
    • ESD Clamp
    • Spare Cells
    • Tie Cells
    • Delay Cells
    • Metrology Cells
    Go To page
    • IO Pads
    • Types of IO Pads
    Go To page
    • Delay Calculation
    • Delay Models
    • Interconnect Delay Models
    • Cell Delay Models
    Go To page
    • Engineering Change Order
    • Post Synthesis ECO
    • Post Route ECO
    • Post Silicon ECO
    • Metal Layer ECO Example
    Go To page
    • std cell library types
    • Classification wrt density and Vth
    Go To page

    • The Discontinuity
    • Discontinuity: Classification
    • DFM/DFY
    • Yield Classification
    • Why DFM/DFY?
    • DFM/DFY Solution
    • Wire Spreading
    • metal Fill
    • CAA
    • CMP Aware-Design
    • Redundant Via
    • RET
    • Litho Process Check(LPC)
    • Layout Dependent Effects
    • Resolution Enhancement Techniques
    • Types of RET
    • Optical Proximity Correction(OPC)
    • Scattering Bars
    • Multiple Patterning
    • Phase-shift Masking
    • Off-Axis Illumination
    Go To page
    • Corners
    • Need for corner analysis
    • PVT Variations
    • Corner Analysis
    • PVT/RC Corners
    • Temperature Inversion
    • Cross Corner Analysis
    • Modes of Analysis
    • MC/MM Analysis
    • OCV
    • Derating
    • OCV Timing Checks
    • OCV Enhancements
    • AOCV
    • SSTA
    • CRPR/CPPR
    Go To page
    Copyright © 2021