It looks like you're new here. If you want to get involved, click one of these buttons!
Hi,
In many Design rules, we have the 2 rules :
How to code those 2 rules ? how to gather the NWELL shapes connected together and check their spacing in between them and with another value with the other NWELL shapes ?
Laurent
Comments
Hi Laurent,
that would be the "connected" case vs. "non-connected" one, right?
That would require a net connectivity extraction in the first step. With this information, the check should basically feasible (although I assume that a certain level of flattening has to happen).
The basic framework is there and already used for the antenna checks. But I have to implemented "connected" or "non-connected".
If ultimate performance isn't required now, the following approach is a workaround: extract a netlist into a L2N database and check the unconnected space for all nwell shapes (using "space"). Then we probe the nets for each sides of the violation marker and report the error only if the nets on these sides are different:
Best regards,
Matthias