From 780a8fca67d0b299d139b48e3d5f229aa76e5ce5 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Matthias=20K=C3=B6fferlein?= Date: Mon, 18 Feb 2019 00:41:35 +0100 Subject: [PATCH] Updated 2019 02 17 (markdown) --- 2019-02-17.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/2019-02-17.md b/2019-02-17.md index d575c02..6d0aee2 100644 --- a/2019-02-17.md +++ b/2019-02-17.md @@ -50,3 +50,7 @@ When sending the output of hierarchical operations to a report database, the mar Functions which require merged polygons utilize the net clustering algorithm to form the merged polygons. All connected shapes are collected and merged into a bigger polygon. This happens in the lowest possible level on the hierarchy where the shape clusters are complete. In some cases - when the shapes from big coherent regions - this may happen on the top cell level and the resulting polygon will be very big. This will lead to poor performance. The XOR function is implemented as two NOT functions because of limitation of the underlying hierarchical processor. Hence XOR executes slower than AND or NOT. If both inputs of the XOR function originate from different layouts, hierarchy mapping has to happen to combine both contributions. This will consume even more time. + +## Next Steps + +The current implementation needs some polishing. The remaining functions need to be ported and tests for DRC scripts need to be written.