History etched with VSDOpen2018 – First VLSI online conference….
Hi “Pictures speak it all” Finally, we all did it – VSDOpen – first ever online VLSI conference. Very close to a real one – […]
Tag Archives: Routing
Continue reading
Paper 4: Rapid Physical Implementation and Integration using eFabless platform
This paper describe a rapid backend process flow (synthesis, placement, STA, routing) and top level integration to implement a small RTL IP into a tapeout ready chip using the Efabless online platform [1]. The full process is completed in less than 3 hours. The IP implemented is a configurable frequency divider
Rapid Physical IC Implementation
“Rapid Physical IC Implementation and Integration using Efabless Platform”. This paper describe a rapid backend process flow (synthesis, placement, STA, routing) and top level integration to implement a small RTL IP into a tapeout ready chip using the Efabless online platform
Use this tool for PNR – Its FREE
If you learn this tool and use it to build your own applications, you might end up presenting a paper in our online conference happening soon called “VSDOpen” – The first ever online conference on opensource EDA.
Let’s predict future…And built it…
let’s identify what has happened till date in field of EDA/CAD using Machine intelligence. The image below shows the flow diagram for designing a chip. This is what has happened (or happening) in EDA using machine intelligence.
Listen from CEO/architect himself on Machine learning
This webinar will talk about how do you do that using Machine Learning and Deep Learning techniques. Participants for this webinar range from students to some of service company India head and Program managers. So we will cover from basics to advanced + labs on cloud.
Propagated noise – Let’s clear this once and for all.
Hi “All that glitters is not gold”…. Similarly, “All that bumps is not noise”…. This is what needs to be nailed forever While doing my […]
Maze Routing – Lee’s Algorithm
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.
