2010 Data Compression Conference 2010
DOI: 10.1109/dcc.2010.17
|View full text |Cite
|
Sign up to set email alerts
|

A Lossless Circuit Layout Image Compression Algorithm for Maskless Lithography Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
3
2
2

Relationship

3
4

Authors

Journals

citations
Cited by 9 publications
(11 citation statements)
references
References 8 publications
0
11
0
Order By: Relevance
“…In earlier work, 13 we restricted the contour lines to be either horizontal or vertical and decomposed an arbitrary polygon into a number of Manhattan polygons, i.e., polygons with right angle corners. This decomposition is well-suited to this application because most components of circuit layouts are produced using CAD tools which design the circuit in a rectilinear space, and even the non-Manhattan parts can be easily described by Manhattan components.…”
Section: Corner Transformationmentioning
confidence: 99%
“…In earlier work, 13 we restricted the contour lines to be either horizontal or vertical and decomposed an arbitrary polygon into a number of Manhattan polygons, i.e., polygons with right angle corners. This decomposition is well-suited to this application because most components of circuit layouts are produced using CAD tools which design the circuit in a rectilinear space, and even the non-Manhattan parts can be easily described by Manhattan components.…”
Section: Corner Transformationmentioning
confidence: 99%
“…Observe that a corner is either the beginning of a line going to the right and/or down or the end of a line. Yang & Savari (2010) (2011) more recently observed that a row (or a column) of the original binary layout image consists of alternating runs of 1s (fill) and runs of 0s (empty). Therefore it is more efficient to encode pixels where there are transitions from 0 to 1 (or 1 to 0) using symbol "1" and to encode the other places using symbol "0."…”
Section: Corner Transformationmentioning
confidence: 99%
“…end for 11: end for Based on the experimental success in Yang & Savari (2010) and Yang & Savari (2011) for binary layout images it is natural to expect that a combination of the corner transformation for the outline of gray-level polygons and a separate representation for the intensity stream would outperform Block C4.Not et h a tnLv-level gray images for this application have pixel intensity 0 (empty) outside the polygon outline, nLv − 1 (fully filled) inside the polygon outline, and an element of (0,nLv) along the polygon outline. Therefore we need only consider intensities along polygon corners and edges.…”
Section: Corner Transformationmentioning
confidence: 99%
See 2 more Smart Citations