
Standard Parasitic Exchange Format (SPEF)-Part 2
Hello, Hope you liked my previous post on “SPEF Format”, and, there had been 4 days since my last post, so I believe the previous […]
Hello, Hope you liked my previous post on “SPEF Format”, and, there had been 4 days since my last post, so I believe the previous […]
Hello, So, this has been due for long time. May be because of tight tape out deadlines, this very important piece of Physical Design flow […]
Lee’s Algorithm guarantees there is exists a valid path and it’s the shortest path.
But, this algorithm is too time and memory consuming, To overcome, these short-comings, there are other more advanced algorithms like Line search Algorithm, Steiner Algorithms, etc.