- Видео 15
- Просмотров 218 750
John Reuben
Добавлен 26 ноя 2014
Resistive RAM (memristor) Modeling and In-memory Computing using Majority Logic
This is a guest lecture in which I summarize my recent work on ReRAM modeling and in-memory computing. In the first part of the talk (~ 25 mins) I talk about ReRAM modeling -how to take the Stanford-PKU model and fit it to any ReRAM device. In the second half of the talk, I discuss how a majority gate can be implemented in a ReRAM array with minimal change to the peripheral circuitry. Computing is simplified to a sequence of memory READ and WRITE operations. By exploiting the parallel-friendly nature of the proposed majority gate and the regular structure of the memory array, it is
demonstrated how parallel-prefix adders can be implemented in memory in O(log(n)) latency. A 32-bit adder can...
demonstrated how parallel-prefix adders can be implemented in memory in O(log(n)) latency. A 32-bit adder can...
Просмотров: 6 632
Видео
Mesh based clock distribution
Просмотров 4,3 тыс.7 лет назад
In this lecture, i discuss mesh-based clock distribution method which has received much attention since 2010. Clock mesh is more resistant to on-chip variations when compared to tree, but this achieved at cost of more power.
Left Edge and Dogleg Algorithm for channel routing
Просмотров 21 тыс.8 лет назад
In this lecture, the left edge algorithm for Channel routing in VLSI physical design is discussed with an example. This basic algorithm is crucial for all advances in channel routing. The dogleg algorithm, which improves the left edge algorithm by net-splitting is also discussed.
Sequence Pair for VLSI Placement
Просмотров 9 тыс.8 лет назад
The Sequence pair is a concise representation of non-slicing floor plan. In this lecture, i introduce sequence pair representation and illustrate how it can be used together with simulated annealing for optimization in VLSI placement. I also discuss an example from the book "Practical problems in VLSI PDA" by Sung Kyu Lim
Floor Planning by Integer Linear Programming(ILP)
Просмотров 8 тыс.8 лет назад
Integer Linear Programming(ILP) is a general optimization technique. In this algorithm the floor planning problem in VLSI physical design is formulated as an ILP and solved.
Layout of Inverter, Cadence Virtuoso,90 nm: Part-2
Просмотров 14 тыс.8 лет назад
In this lab demo, we show how to do post layout simulation of a CMOS inverter using Cadence Virtuoso, Technology-90 nm
Layout of Inverter in Cadence Virtuoso,90 nm-Part1
Просмотров 45 тыс.8 лет назад
In this lab demo, we show how to draw the layout of a CMOS inverter using Cadence Virtuoso, Technology-90 nm.
Kernighan-Lin(KL) algorithm for Partitioning
Просмотров 51 тыс.8 лет назад
KL algorithm is an iterative improvement algorithm for bi-partitioning a netlist.Belonging to the class of group migration algorithms, it is based on exchanging a pair of nodes across the partition to reduce the cutset.In this lecture, the algorithm is explained with an example.
Partitioning-an Introduction
Просмотров 7 тыс.8 лет назад
In this lecture, i give an introduction to Partitioning, which is the first step in VLSI physical design automation.
Floor Planning by Polish Expression continued
Просмотров 4,1 тыс.9 лет назад
The continuation of my previous lecture on floor planning using polish expression. The 3 moves suggested by Wong and Liu are illustrated.
Floor planning by Polish Expression
Просмотров 14 тыс.9 лет назад
The polish expression, proposed by Wong and Liu is a succinct representation of slicing floor plans. In this lecture, I explain how floor plans can be represented by polish expressions and how simulated annealing can be used to optimize the floor plan.
Introduction to Floor planning
Просмотров 23 тыс.9 лет назад
In this lecture, I give an introduction to floor planning -the phase in physical design flow after partitioning where the modules are assigned a tentative location on the chip. The goal of floor planning algorithm is to determine optimum locations for the blocks such that the interconnections between them are routable. Includes an interesting animation on slicing tree to represent a floorplan
LCM based Clock Generation
Просмотров 3129 лет назад
This audio slide is a short presentation of my research “A Novel Clock Generation Algorithm for System-on-Chip based on Least Common Multiple ” published by Computers and Electrical Engineering, ELSEVIER, Vol.40, Issue 7, 2014
Exact Zero Skew Algorithm
Просмотров 3,7 тыс.9 лет назад
The exact zero skew clock routing algorithm, proposed by Tsay in 1993 is still used in many clock tree synthesis tools. This algorithm is foundational to all the latest developments in clock distribution. this lecture presents the algorithm with an example
Clock distribution network
Просмотров 8 тыс.9 лет назад
In this lecture, i give an introduction to one of the crucial aspects of physical design- the clock distribution network.
Good explanation and in-depth information. Thank you for the video!
great lecture!
Thank you so much 👏👏👏
great tutorial
Perfect!!!
Very good video! Greetings from Italy.
Impressive, Thank you so much !
🙏🙏Thank you sir
Thanks bro
good
Awesome!
very nice explanation sir
TQSM it was very helpful
Sir, please check with A to C in graph
Thank you sir!
I clicked the option in boundary only while starting layout
Sir that active area boundary automatically disappears sir. What to do?
Thank you sir
Well explained thank you
i got errors NIMP.A.1: Nimp area must be >=0.15 um PIMP.A.1: Pimp area must be >=0.15 um what does they mean sir
The are of the Pimplant and Nimplant must be greater than the or equal to that values For example, I am going to take the values that you have taken. The height of the cell is 0.7μm and the length of that implant is considered as 0.3μm then the are going to become 0.21μm it means here your error is clear. These specifications are going to be generated by the Fabracitaion team hence these values are not fixed for the same technology also it will be dependent on the company of fabrication.
Sir i need c program to perform the left edge algorithm
good evening...
good evening sir...thank you... you helped me for my test
Respected Sir I am a 4th yr ECE Student. I am familiar with the Layout designing of basic gates in Cadence Virtuoso using 90nm and 180 nm tech nodes with DRC and LVS. I am looking for guidance from an experienced person related to this field. Thank You
hi... I have some question regarding 90nm cmos process..Can you help me out
Due to COVID19 Pandemic colleges are not opening and I can't access the cadence software so I searched for an open source software and I found GLADE. Check out my playlist on Layout Designing using GLADE. #LearnFromHome Playlist Link:- ruclips.net/p/PLWcG9vtrFH0YVZvd3yf2Xmm_Gl0y-XXz6 Video 2&3: Glade Downloading, Setup and Configuration. Video 2 link: ruclips.net/video/LMZ3O6Akfro/видео.html Video 3 link: ruclips.net/video/1ueSinMmqkA/видео.html Video 4: Designing Layout of nMOS and pMOS is explained. Video 4 link: ruclips.net/video/oOblwp65WFA/видео.html Video 5: Designing CMOS Inverter Layout using 1 metal layer is explained in detail. Video 5 link: ruclips.net/video/Qr0nTPo-Ri0/видео.html Video 6: Verification of Designed Inverter Layout using LT Spice. Video 6 link: ruclips.net/video/kvrF6Zv6Y_U/видео.html Video 7: Designing CMOS Inverter Layout by using 2 metal layers and Vias. Video 7 link: ruclips.net/video/HZopqROB2GA/видео.html Video 8: Designing 2 Input CMOS NAND Gate. Video 8 link: ruclips.net/video/41067AYX_do/видео.html Video 9: Verification of Designed NAND Gate Layout using LT Spice. Video 9 link: ruclips.net/video/3pufZ6InuHQ/видео.html Video 10: Designing 2 Input CMOS NOR Gate. Video 10 link: ruclips.net/video/skYC2UnJgQ4/видео.html Kindly Like, Share among your engineering friends so that they can also learn from home and subscribe to my Channel for more GLADE Tutorials. Your Support will be appreciated. Thank You
Thanks for the awesome video, simulated annealing video is missing.Can you please upload it
Thank you, great explanation!!
NICE REUBEN
Sir I m new to this cadence do I get cadence for windows OS and can I get a trial version
And when I try to flatten the selected instance even though I hv given to preserve pins I get lavs error saying nmos on schematic is inbound to any layout device
Please do help me to clear this
Crystal clear ,Thanks for this video sir
A very well explained video for this topic. I learned a lot from you. Thank you, sir, you are great. Please, upload more videos.
can i have u r mail id plz sir
Wow! This is the best explanation of KL Algorithm on RUclips. Thank you, brother. It was very helpful.
I am glad it helped you!
Sir can you make the videos for FM algorithm and simulated annealing algorithm.
Example starts at minute 23.
Thank you
Hi Ashish, Sorry, i am not aware of any documentation on the exact width of power/mesh ring.
i have not coded it. You can use a high-level language (like C or MATLAB) and code the steps of KL algorithm
Thank you sir
Would it be possible to share the c code behind turning a sequence pair into a HCG and VCG?
Sir told me zener diode parameters in analoglib cadence tool
I just didn't understand one thing: does the M3 perturbation in SA approach change the sequence pair as M1 and M3 do?
Excellent work Sir, Thank You so much. It was a great help to me.
Simply amazing!! You made it look so easy.
Very clear. Now I can do my homework!
Very helpful, Please come up with more examples and explanations with different analog layout concepts.
I read the reference book and I have a question: How can I calculate the coordinates of blocks without the tree? Actually, how can I calculate with just this representation: 25V1H374VH6V8VH
Since it was 4 years ago you wrote the comment, but write it because maybe some others that doesn't know also can read. You need to know about postfix and prefix. This is how we read tree as sentence representation, and the representation is fixed per each tree. It means you can convert the representation to tree.
Thanks for this video I have a question: How we obtain the location of blocks in the x-y axis? actually how we convert the polish representation to x-y representation?
I think you are wrong about the Left edge algo. You have to iterate through the whole order before starting from the left again, according to the algorithm provided in these slides.
Yes
Thank you