Difference between revisions of "KLayout's deep verification base project"
| Line 5: | Line 5: | ||
With the DRC module and the underlying API, KLayout made a first step towards layout analysis and large scale layout manipulation. With the Deep Verification Base project I want to lay the basis for in-depth analysis features - looking below the surface of a flat, mask-like layout view. Hierarchy comprehension and network analysis are the main focus topics for this project, the final vision being rich LVS verification capabilities. | With the DRC module and the underlying API, KLayout made a first step towards layout analysis and large scale layout manipulation. With the Deep Verification Base project I want to lay the basis for in-depth analysis features - looking below the surface of a flat, mask-like layout view. Hierarchy comprehension and network analysis are the main focus topics for this project, the final vision being rich LVS verification capabilities. | ||
In this talk I will highlight the | In this talk I will highlight the ideas, the methods involved and the goals of the project which will lay the basis for this feature. | ||
Revision as of 21:53, 11 March 2019
KLayout's Deep Verification Base Project
Being a quick, powerful viewer and lightweight editor for mask layout files, KLayout's strengths were long found in the area of visualisation and editing of huge quantities of polygon shapes take from GDS, OASIS and a variety of other layout formats.
With the DRC module and the underlying API, KLayout made a first step towards layout analysis and large scale layout manipulation. With the Deep Verification Base project I want to lay the basis for in-depth analysis features - looking below the surface of a flat, mask-like layout view. Hierarchy comprehension and network analysis are the main focus topics for this project, the final vision being rich LVS verification capabilities.
In this talk I will highlight the ideas, the methods involved and the goals of the project which will lay the basis for this feature.