Awesome lectures.................. Sir, you haven't discussed about Simulated Annealing (second type of iterative improvement partitioning technique) also sir we would appreciate if you could tell us which book to refer for this course.
The example of the min cut algorithm seems incorrect. In the second step b and f should have been interchanged as it leads to smaller cost increase of 0.5 compared to 1.5 for b and g. Further the original netlist should not have connections between c and d or e and f. Can someone please verify this?
Very helpful video for beginner! Detailed lecture with supported example is great!
Awesome lectures.................. Sir, you haven't discussed about Simulated Annealing (second type of iterative improvement partitioning technique)
also sir we would appreciate if you could tell us which book to refer for this course.
He is the Best prof in our IIT KGP
The example of the min cut algorithm seems incorrect. In the second step b and f should have been interchanged as it leads to smaller cost increase of 0.5 compared to 1.5 for b and g. Further the original netlist should not have connections between c and d or e and f. Can someone please verify this?
Great video lecture. Well done and well explained. Thank you very much!
great video
what is node @13:52
Thanks a lot
awesome lecture
He is the best in our kgp
Did he teach vlsi
@@nayanendubiswas8992
theory theory theory..no examples.. nothing...whats the difference between a book and these videos then
I agree with you that the lecture is not intersting ..Can u Pls suggesting me something better which u found ?