Optimal phase conflict removal for layout of dark field alternating phase shifting masks

Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky

    Research output: Contribution to journalArticle

    24 Citations (Scopus)

    Abstract

    We describe new, efficient algorithms for layout modification and phase assignment for dark field alternating-type phase shifting masks in the single exposure regime. We make the following contributions. First, we suggest new two-coloring and compaction approach that simultaneously optimizes layout and phase assignment which is based on planar embedding of an associated conflict graph. We also describe additional approaches to cooptimization of layout and phase assignment for alternating PSM. Second, we give optimal and fast algorithms to minimize the number of phase conflicts that must be removed to ensure two colorability of the conflict graph. We reduce this problem to the T-join problem which asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A if u belongs to a given node subset T of a weighted graph. Third, we suggest several practical algorithms for the T-join problem. In sparse graphs, our algorithms are faster than previously known methods. Computational experience with industrial VLSI layout benchmarks shows the advantages of the new algorithms.

    Original languageEnglish (US)
    Pages (from-to)175-187
    Number of pages13
    JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
    Volume19
    Issue number2
    DOIs
    StatePublished - Jan 1 2000

    Fingerprint

    Masks
    Coloring
    Compaction

    All Science Journal Classification (ASJC) codes

    • Software
    • Computer Graphics and Computer-Aided Design
    • Electrical and Electronic Engineering

    Cite this

    Berman, Piotr ; Kahng, Andrew B. ; Vidhani, Devendra ; Wang, Huijuan ; Zelikovsky, Alexander. / Optimal phase conflict removal for layout of dark field alternating phase shifting masks. In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2000 ; Vol. 19, No. 2. pp. 175-187.
    @article{16c76f983b4d45ef92a8ea07610af413,
    title = "Optimal phase conflict removal for layout of dark field alternating phase shifting masks",
    abstract = "We describe new, efficient algorithms for layout modification and phase assignment for dark field alternating-type phase shifting masks in the single exposure regime. We make the following contributions. First, we suggest new two-coloring and compaction approach that simultaneously optimizes layout and phase assignment which is based on planar embedding of an associated conflict graph. We also describe additional approaches to cooptimization of layout and phase assignment for alternating PSM. Second, we give optimal and fast algorithms to minimize the number of phase conflicts that must be removed to ensure two colorability of the conflict graph. We reduce this problem to the T-join problem which asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A if u belongs to a given node subset T of a weighted graph. Third, we suggest several practical algorithms for the T-join problem. In sparse graphs, our algorithms are faster than previously known methods. Computational experience with industrial VLSI layout benchmarks shows the advantages of the new algorithms.",
    author = "Piotr Berman and Kahng, {Andrew B.} and Devendra Vidhani and Huijuan Wang and Alexander Zelikovsky",
    year = "2000",
    month = "1",
    day = "1",
    doi = "10.1109/43.828546",
    language = "English (US)",
    volume = "19",
    pages = "175--187",
    journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
    issn = "0278-0070",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "2",

    }

    Optimal phase conflict removal for layout of dark field alternating phase shifting masks. / Berman, Piotr; Kahng, Andrew B.; Vidhani, Devendra; Wang, Huijuan; Zelikovsky, Alexander.

    In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 19, No. 2, 01.01.2000, p. 175-187.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Optimal phase conflict removal for layout of dark field alternating phase shifting masks

    AU - Berman, Piotr

    AU - Kahng, Andrew B.

    AU - Vidhani, Devendra

    AU - Wang, Huijuan

    AU - Zelikovsky, Alexander

    PY - 2000/1/1

    Y1 - 2000/1/1

    N2 - We describe new, efficient algorithms for layout modification and phase assignment for dark field alternating-type phase shifting masks in the single exposure regime. We make the following contributions. First, we suggest new two-coloring and compaction approach that simultaneously optimizes layout and phase assignment which is based on planar embedding of an associated conflict graph. We also describe additional approaches to cooptimization of layout and phase assignment for alternating PSM. Second, we give optimal and fast algorithms to minimize the number of phase conflicts that must be removed to ensure two colorability of the conflict graph. We reduce this problem to the T-join problem which asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A if u belongs to a given node subset T of a weighted graph. Third, we suggest several practical algorithms for the T-join problem. In sparse graphs, our algorithms are faster than previously known methods. Computational experience with industrial VLSI layout benchmarks shows the advantages of the new algorithms.

    AB - We describe new, efficient algorithms for layout modification and phase assignment for dark field alternating-type phase shifting masks in the single exposure regime. We make the following contributions. First, we suggest new two-coloring and compaction approach that simultaneously optimizes layout and phase assignment which is based on planar embedding of an associated conflict graph. We also describe additional approaches to cooptimization of layout and phase assignment for alternating PSM. Second, we give optimal and fast algorithms to minimize the number of phase conflicts that must be removed to ensure two colorability of the conflict graph. We reduce this problem to the T-join problem which asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A if u belongs to a given node subset T of a weighted graph. Third, we suggest several practical algorithms for the T-join problem. In sparse graphs, our algorithms are faster than previously known methods. Computational experience with industrial VLSI layout benchmarks shows the advantages of the new algorithms.

    UR - http://www.scopus.com/inward/record.url?scp=0033904918&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0033904918&partnerID=8YFLogxK

    U2 - 10.1109/43.828546

    DO - 10.1109/43.828546

    M3 - Article

    VL - 19

    SP - 175

    EP - 187

    JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

    JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

    SN - 0278-0070

    IS - 2

    ER -