IIT Roorkee · Engineering

VLSI Physical Design with Timing Analysis

Prof. Bishnu Prasad Das · 2025 · 62 free video lectures

62 video lectures. Topics: Introduction to VLSI Design; Introduction to VLSI Physical Design; Complexity Analysis for Algorithms; Graphs for Physical Design; Graph searching Algorithms; Spanning Tree and Shortest Path Algorithms; Overview of Timing Analysis; Timing Arcs and Unateness; Delay…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture 01 : Introduction to VLSI Design
  2. Lecture 02 : Introduction to VLSI Physical Design
  3. Lecture 03 : Complexity Analysis for Algorithms
  4. Lecture 04 : Graphs for Physical Design
  5. Lecture 05 : Graph searching Algorithms
  6. Lecture 06 : Spanning Tree and Shortest Path Algorithms
  7. Lecture 07 : Overview of Timing Analysis
  8. Lecture 08: Timing Arcs and Unateness
  9. Lecture 09: Delay Parameters of a Combinational Circuit
  10. Lecture 10: Delay Parameters of a Sequential Circuit
  11. Lecture 11: Timing Analysis in a Sequential Circuit
  12. Lecture 12: STA in Sequential Circuit with Clock Skew – I
  13. Lecture 13: STA in Sequential Circuit with Clock Skew – II
  14. Lecture 14: STA in Sequential Circuit with Clock Jitter
  15. Lecture 15: STA considering OCV and CRPR (Setup check)
  16. Lecture 16: STA considering OCV and CRPR (Hold check)
  17. Lecture 17: STA for Combinational Circuits – I
  18. Lecture 18: STA for Combinational Circuits – II
  19. Lecture 19: Introduction to Partitioning – I
  20. Lecture 20: Introduction to Partitioning – II
  21. Lecture 21: Partitioning Algorithms
  22. Lecture 22: Kernighan – Lin (KL) Algorithm
  23. Lecture 23: Fidduccia-Mattheyeses(FM) Algorithm
  24. Lecture 24 - Introduction to Floorplanning
  25. Lecture - 25: Floorplanning Representations
  26. Lecture – 26: Floorplanning Algorithms - 1
  27. Lecture – 27: Floorplanning Algorithms – 2
  28. Lecture – 28: Pin Assignment and Power - Ground Routing
  29. Lecture 29: Introduction to Placement
  30. Lecture 30: Wirelength estimation techniques
  31. Lecture 31: Min-cut placement
  32. Lecture 32: Placement Algorithms
  33. Lecture 33: Placement algorithms and legalization
  34. Lecture 34: Introduction to Clock Tree Synthesis
  35. Lecture 35: Clock Routing Algorithms – I
  36. Lecture 36: Clock Routing Algorithms – II
  37. Lecture 37: Clock Routing Algorithms – III
  38. Lecture 38 : Introduction and Optimization Goals – Global Routing
  39. Lecture 39: Single net routing (Rectilinear routing)
  40. Lecture 40: Global Routing in the connectivity graph
  41. Lecture 41: Finding Shortest Paths with Dijkstra’s Algorithm
  42. Lecture 42: Full-Netlist Routing
  43. Lecture 43: Introduction: Detailed Routing
  44. Lecture 44: Channel Routing Algorithms – I
  45. Lecture 45: Channel Routing Algorithms – II
  46. Lecture 46: Switchbox and Over the cell routing
  47. Lecture 47: Timing Constraints in latch based system
  48. Lecture 48: Timing Constraints in Pulsed Latch-based System
  49. Lecture 49: Time Borrowing in Latch
  50. Lecture 50: Crosstalk Analysis
  51. Lecture 51: Standard Cell Library
  52. Lecture 52: Low Power Cells in Standard Cell Library
  53. Lecture 53: Sub-threshold Standard Cell Library
  54. Lecture 54: Timing Library for Standard Cells
  55. Lecture 55: PDK and Other files
  56. Lecture 56: Open-Source Tool Installation and Qflow
  57. Lecture 57: Open-Source tool- YOSYS
  58. Lecture 58: OpenSTA Static Timing Analyzer
  59. Lecture 59: OpenROAD Physical Synthesis Flow – I
  60. Lecture 60: OpenROAD Physical Synthesis Flow – II
  61. Live Session 27-02-2024
  62. Live Session 07-03-2025

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Roorkee.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights